TSTP Solution File: SYN012-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN012-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 1 01:48:37 EDT 2023
% Result : Unsatisfiable 0.52s 0.57s
% Output : CNFRefutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 24 ( 2 unt; 3 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 52 ( 26 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 40 ( 2 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
big_f: ( $i * $i ) > $o ).
tff(decl_23,type,
g: ( $i * $i ) > $i ).
tff(decl_24,type,
big_g: ( $i * $i ) > $o ).
cnf(clause_5,negated_conjecture,
( big_f(X1,X2)
| ~ big_g(g(X1,X2),g(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).
cnf(clause_6,negated_conjecture,
( big_g(X1,X2)
| big_g(g(X1,X2),g(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_2,negated_conjecture,
( big_f(X1,g(X1,X2))
| ~ big_f(X1,X2)
| ~ big_g(X2,g(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_7,negated_conjecture,
( ~ big_g(X1,X2)
| ~ big_g(g(X1,X2),g(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_3,negated_conjecture,
( big_g(g(X1,X2),g(X1,X2))
| ~ big_f(X1,X2)
| ~ big_f(g(X1,X2),g(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_1,negated_conjecture,
( big_g(X2,g(X1,X2))
| ~ big_f(X1,X2)
| ~ big_f(X1,g(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).
cnf(c_0_6,negated_conjecture,
( big_f(X1,X2)
| ~ big_g(g(X1,X2),g(X1,X2)) ),
clause_5 ).
cnf(c_0_7,negated_conjecture,
( big_g(X1,X2)
| big_g(g(X1,X2),g(X1,X2)) ),
clause_6 ).
cnf(c_0_8,negated_conjecture,
( big_f(X1,g(X1,X2))
| ~ big_f(X1,X2)
| ~ big_g(X2,g(X1,X2)) ),
clause_2 ).
cnf(c_0_9,negated_conjecture,
( big_g(X1,X2)
| big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ big_g(X1,X2)
| ~ big_g(g(X1,X2),g(X1,X2)) ),
clause_7 ).
cnf(c_0_11,negated_conjecture,
( big_g(g(X1,X2),g(X1,X2))
| ~ big_f(X1,X2)
| ~ big_f(g(X1,X2),g(X1,X2)) ),
clause_3 ).
cnf(c_0_12,negated_conjecture,
( big_f(X1,g(X2,X1))
| big_f(X2,g(X2,X1))
| ~ big_f(X2,X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( big_f(g(X1,X2),g(X1,X2))
| ~ big_g(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( big_g(g(X1,X2),g(X1,X2))
| ~ big_f(X1,X2) ),
inference(csr,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( big_g(X2,g(X1,X2))
| ~ big_f(X1,X2)
| ~ big_f(X1,g(X1,X2)) ),
clause_1 ).
cnf(c_0_16,negated_conjecture,
( big_f(g(X1,X2),g(g(X1,X2),g(X1,X2)))
| ~ big_g(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( ~ big_g(X1,X2)
| ~ big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( big_g(g(X1,X2),g(g(X1,X2),g(X1,X2)))
| ~ big_g(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ big_g(X1,X2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_7,c_0_19]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYN012-1 : TPTP v8.1.2. Released v1.1.0.
% 0.12/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 20:20:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.52/0.57 % Version : CSE_E---1.5
% 0.52/0.57 % Problem : theBenchmark.p
% 0.52/0.57 % Proof found
% 0.52/0.57 % SZS status Theorem for theBenchmark.p
% 0.52/0.57 % SZS output start Proof
% See solution above
% 0.52/0.57 % Total time : 0.004000 s
% 0.52/0.57 % SZS output end Proof
% 0.52/0.57 % Total time : 0.006000 s
%------------------------------------------------------------------------------