TSTP Solution File: SYN611-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SYN611-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n015.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:53:27 EDT 2023
% Result : Unsatisfiable 1.93s 2.03s
% Output : CNFRefutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 30
% Syntax : Number of formulae : 47 ( 13 unt; 21 typ; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 51 ( 27 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 17 >; 9 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 4 con; 0-2 aty)
% Number of variables : 44 ( 3 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
c21: $i ).
tff(decl_23,type,
p16: $i > $o ).
tff(decl_24,type,
p2: ( $i * $i ) > $o ).
tff(decl_25,type,
p5: ( $i * $i ) > $o ).
tff(decl_26,type,
p3: ( $i * $i ) > $o ).
tff(decl_27,type,
c20: $i ).
tff(decl_28,type,
f7: $i > $i ).
tff(decl_29,type,
c22: $i ).
tff(decl_30,type,
f12: ( $i * $i ) > $i ).
tff(decl_31,type,
c19: $i ).
tff(decl_32,type,
f6: $i > $i ).
tff(decl_33,type,
f4: $i > $i ).
tff(decl_34,type,
f15: $i > $i ).
tff(decl_35,type,
f8: $i > $i ).
tff(decl_36,type,
f9: $i > $i ).
tff(decl_37,type,
f13: $i > $i ).
tff(decl_38,type,
p17: ( $i * $i ) > $o ).
tff(decl_39,type,
p18: ( $i * $i ) > $o ).
tff(decl_40,type,
f14: ( $i * $i ) > $i ).
tff(decl_41,type,
f10: ( $i * $i ) > $i ).
tff(decl_42,type,
f11: ( $i * $i ) > $i ).
cnf(p17_20,negated_conjecture,
( p17(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p17(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p17_20) ).
cnf(p2_2,negated_conjecture,
p2(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_2) ).
cnf(p2_12,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p3(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_12) ).
cnf(p17_29,negated_conjecture,
p17(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),f6(f7(f8(c20)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p17_29) ).
cnf(p3_19,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_19) ).
cnf(p3_4,negated_conjecture,
p3(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_4) ).
cnf(p3_24,negated_conjecture,
( p3(f10(X1,X2),f10(X3,X4))
| ~ p3(X1,X3)
| ~ p3(X2,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_24) ).
cnf(p3_22,negated_conjecture,
p3(f12(f4(f6(f7(f8(c20)))),c21),f4(f6(f7(f8(c20))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_22) ).
cnf(not_p17_28,negated_conjecture,
~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p17_28) ).
cnf(c_0_9,negated_conjecture,
( p17(X1,X2)
| ~ p2(X3,X1)
| ~ p2(X4,X2)
| ~ p17(X3,X4) ),
p17_20 ).
cnf(c_0_10,negated_conjecture,
p2(X1,X1),
p2_2 ).
cnf(c_0_11,negated_conjecture,
( p17(X1,X2)
| ~ p17(X3,X2)
| ~ p2(X3,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
( p2(f9(X1),f9(X2))
| ~ p3(X1,X2) ),
p2_12 ).
cnf(c_0_13,negated_conjecture,
( p17(f9(X1),X2)
| ~ p17(f9(X3),X2)
| ~ p3(X3,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
p17(f9(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20)))))),f6(f7(f8(c20)))),
p17_29 ).
cnf(c_0_15,negated_conjecture,
( p3(X1,X2)
| ~ p3(X3,X1)
| ~ p3(X3,X2) ),
p3_19 ).
cnf(c_0_16,negated_conjecture,
p3(X1,X1),
p3_4 ).
cnf(c_0_17,negated_conjecture,
( p17(f9(X1),f6(f7(f8(c20))))
| ~ p3(f10(f14(f4(f9(c19)),c19),f4(f6(f7(f8(c20))))),X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( p3(f10(X1,X2),f10(X3,X4))
| ~ p3(X1,X3)
| ~ p3(X2,X4) ),
p3_24 ).
cnf(c_0_19,negated_conjecture,
( p3(X1,X2)
| ~ p3(X2,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
p3(f12(f4(f6(f7(f8(c20)))),c21),f4(f6(f7(f8(c20))))),
p3_22 ).
cnf(c_0_21,negated_conjecture,
~ p17(f9(f10(f14(f4(f9(c19)),c19),f12(X1,c21))),f6(f7(f8(c20)))),
not_p17_28 ).
cnf(c_0_22,negated_conjecture,
( p17(f9(f10(X1,X2)),f6(f7(f8(c20))))
| ~ p3(f4(f6(f7(f8(c20)))),X2)
| ~ p3(f14(f4(f9(c19)),c19),X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
p3(f4(f6(f7(f8(c20)))),f12(f4(f6(f7(f8(c20)))),c21)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ p3(f4(f6(f7(f8(c20)))),f12(X1,c21)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_16])]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_23,c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN611-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n015.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 18:50:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.61 start to proof: theBenchmark
% 1.93/2.03 % Version : CSE_E---1.5
% 1.93/2.03 % Problem : theBenchmark.p
% 1.93/2.03 % Proof found
% 1.93/2.03 % SZS status Theorem for theBenchmark.p
% 1.93/2.03 % SZS output start Proof
% See solution above
% 1.93/2.04 % Total time : 1.412000 s
% 1.93/2.04 % SZS output end Proof
% 1.93/2.04 % Total time : 1.415000 s
%------------------------------------------------------------------------------