TSTP Solution File: SYN077-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN077-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n010.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:49:58 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of formulae : 31 ( 3 unt; 6 typ; 0 def)
% Number of atoms : 66 ( 5 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 81 ( 40 ~; 41 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
f: $i > $i ).
tff(decl_23,type,
big_f: ( $i * $i ) > $o ).
tff(decl_24,type,
a: $i ).
tff(decl_25,type,
g: ( $i * $i ) > $i ).
tff(decl_26,type,
h: $i > $i ).
tff(decl_27,type,
i: ( $i * $i ) > $i ).
cnf(clause_4,negated_conjecture,
( ~ big_f(X1,a)
| ~ big_f(X1,X2)
| ~ big_f(X3,g(X1,X2))
| ~ big_f(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
cnf(clause_6,negated_conjecture,
( big_f(i(X2,X1),X1)
| big_f(X2,a)
| ~ big_f(X1,h(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
cnf(clause_1,axiom,
( X1 = X2
| ~ big_f(X1,f(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
cnf(clause_3,negated_conjecture,
( big_f(g(X1,X2),X2)
| ~ big_f(X1,a)
| ~ big_f(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
cnf(clause_7,negated_conjecture,
( big_f(X1,a)
| big_f(i(X1,X2),h(X1))
| ~ big_f(X2,h(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
cnf(clause_2,axiom,
( big_f(X1,f(X2))
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
cnf(clause_5,negated_conjecture,
( big_f(X1,h(X1))
| big_f(X1,a) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
cnf(c_0_7,negated_conjecture,
( ~ big_f(X1,a)
| ~ big_f(X1,X2)
| ~ big_f(X3,g(X1,X2))
| ~ big_f(X3,X2) ),
clause_4 ).
cnf(c_0_8,negated_conjecture,
( big_f(i(X2,X1),X1)
| big_f(X2,a)
| ~ big_f(X1,h(X2)) ),
clause_6 ).
cnf(c_0_9,axiom,
( X1 = X2
| ~ big_f(X1,f(X2)) ),
clause_1 ).
cnf(c_0_10,negated_conjecture,
( big_f(g(X1,X2),X2)
| ~ big_f(X1,a)
| ~ big_f(X1,X2) ),
clause_3 ).
cnf(c_0_11,negated_conjecture,
( big_f(X1,a)
| ~ big_f(i(X1,g(X2,X3)),X3)
| ~ big_f(g(X2,X3),h(X1))
| ~ big_f(X2,a)
| ~ big_f(X2,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( big_f(X1,a)
| big_f(i(X1,X2),h(X1))
| ~ big_f(X2,h(X1)) ),
clause_7 ).
cnf(c_0_13,negated_conjecture,
( g(X1,f(X2)) = X2
| ~ big_f(X1,f(X2))
| ~ big_f(X1,a) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
( big_f(X1,f(X2))
| X1 != X2 ),
clause_2 ).
cnf(c_0_15,negated_conjecture,
( big_f(X1,a)
| ~ big_f(X2,h(X1))
| ~ big_f(X2,a) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ big_f(X1,f(X2))
| ~ big_f(X3,f(X2))
| ~ big_f(X3,a)
| ~ big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_17,plain,
big_f(X1,f(X1)),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( big_f(X1,a)
| ~ big_f(i(X1,X2),a)
| ~ big_f(X2,h(X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( ~ big_f(X1,f(X2))
| ~ big_f(X1,a)
| ~ big_f(X2,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( big_f(X1,a)
| ~ big_f(a,h(X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( big_f(X1,h(X1))
| big_f(X1,a) ),
clause_5 ).
cnf(c_0_22,negated_conjecture,
( ~ big_f(X1,a)
| ~ big_f(X1,X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
big_f(a,a),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN077-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 19:17:05 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.006000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.009000 s
%------------------------------------------------------------------------------