TSTP Solution File: LCL040-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL040-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 : n007.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:51:55 EDT 2023
% Result : Unsatisfiable 1.43s 1.54s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 12
% Syntax : Number of formulae : 55 ( 31 unt; 6 typ; 0 def)
% Number of atoms : 70 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 44 ( 23 ~; 21 |; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 114 ( 28 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,
a: $i ).
tff(decl_26,type,
b: $i ).
tff(decl_27,type,
c: $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_35,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_35) ).
cnf(cn_18,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_18) ).
cnf(cn_40,axiom,
is_a_theorem(implies(X1,not(not(X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_40) ).
cnf(cn_39,axiom,
is_a_theorem(implies(not(not(X1)),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_39) ).
cnf(prove_cn_21,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_21) ).
cnf(c_0_6,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
cn_35 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_9,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,X1))),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,axiom,
is_a_theorem(implies(X1,not(not(X1)))),
cn_40 ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_13]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X1)))),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,implies(X2,X2)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,not(not(X2))))),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_19]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(X1,not(not(X2))))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,axiom,
is_a_theorem(implies(not(not(X1)),X1)),
cn_39 ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),not(not(X2)))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_29,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(implies(implies(X2,X2),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_27]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(not(not(X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_28]) ).
cnf(c_0_31,plain,
is_a_theorem(not(not(implies(X1,implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_29,c_0_13]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X1)),X3),X3)),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_34,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,implies(X3,X2)),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_33]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,implies(X3,X1))),X4),X4)),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X1,X2)),implies(implies(X1,implies(X2,X3)),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X1,X3)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_37]) ).
cnf(c_0_41,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,implies(X3,implies(X4,X2))),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_38]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(implies(X1,implies(implies(X2,implies(X3,X4)),implies(X2,X3))),implies(X1,implies(implies(X2,implies(X3,X4)),implies(X2,X4))))),
inference(spm,[status(thm)],[c_0_11,c_0_39]) ).
cnf(c_0_43,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_6,c_0_40]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(X1,implies(implies(X2,implies(X1,X3)),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))),
prove_cn_21 ).
cnf(c_0_47,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL040-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Thu Aug 24 17:46:55 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.18/0.49 start to proof: theBenchmark
% 1.43/1.54 % Version : CSE_E---1.5
% 1.43/1.54 % Problem : theBenchmark.p
% 1.43/1.54 % Proof found
% 1.43/1.54 % SZS status Theorem for theBenchmark.p
% 1.43/1.54 % SZS output start Proof
% See solution above
% 1.43/1.54 % Total time : 1.041000 s
% 1.43/1.54 % SZS output end Proof
% 1.43/1.54 % Total time : 1.044000 s
%------------------------------------------------------------------------------