TSTP Solution File: LCL368-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL368-1 : TPTP v8.1.2. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n021.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 : Thu Aug 31 06:53:43 EDT 2023
% Result : Unsatisfiable 2.80s 2.88s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 12
% Syntax : Number of formulae : 60 ( 24 unt; 7 typ; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 81 ( 43 ~; 38 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 124 ( 26 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
implies: ( $i * $i ) > $i ).
tff(decl_23,type,
is_a_theorem: $i > $o ).
tff(decl_24,type,
not: $i > $i ).
tff(decl_25,type,
x: $i ).
tff(decl_26,type,
y: $i ).
tff(decl_27,type,
z: $i ).
tff(decl_28,type,
u: $i ).
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
cnf(prove_cn_23,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,z)),u),implies(implies(y,implies(x,z)),u))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_23) ).
cnf(c_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_6,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
cn_1 ).
cnf(c_0_7,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X4,X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_18,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_8,c_0_25]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_7]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(not(X2),X4),X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_27]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_9]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))
| ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_6]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(not(implies(X1,X2)),X3))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_12,c_0_36]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_22,c_0_37]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,z)),u),implies(implies(y,implies(x,z)),u))),
prove_cn_23 ).
cnf(c_0_42,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_39]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_12,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
~ is_a_theorem(implies(implies(y,implies(x,z)),implies(x,implies(y,z)))),
inference(spm,[status(thm)],[c_0_41,c_0_7]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
| ~ is_a_theorem(implies(X3,implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(X1,implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ is_a_theorem(implies(x,implies(implies(x,z),z))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X1,implies(not(X3),X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_43]) ).
cnf(c_0_49,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(implies(X2,implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_10,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
~ is_a_theorem(implies(x,implies(not(z),x))),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_49,c_0_11]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL368-1 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n021.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 : Fri Aug 25 04:27:55 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.54 start to proof: theBenchmark
% 2.80/2.87 % Version : CSE_E---1.5
% 2.80/2.87 % Problem : theBenchmark.p
% 2.80/2.87 % Proof found
% 2.80/2.88 % SZS status Theorem for theBenchmark.p
% 2.80/2.88 % SZS output start Proof
% See solution above
% 2.80/2.88 % Total time : 2.325000 s
% 2.80/2.88 % SZS output end Proof
% 2.80/2.88 % Total time : 2.328000 s
%------------------------------------------------------------------------------