TSTP Solution File: LCL064-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : LCL064-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 : n005.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:52:02 EDT 2023
% Result : Unsatisfiable 0.82s 0.94s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 21 unt; 6 typ; 0 def)
% Number of atoms : 113 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 110 ( 57 ~; 53 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 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 : 132 ( 24 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_49,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_49) ).
cnf(prove_cn_1,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_1) ).
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,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
cn_35 ).
cnf(c_0_7,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_5,c_0_6]) ).
cnf(c_0_8,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
cn_18 ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_13,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
cn_49 ).
cnf(c_0_14,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(implies(X1,X2),X1))
| ~ is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),X1))
| ~ is_a_theorem(implies(implies(not(X1),not(X2)),X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,X1))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(implies(not(X1),not(X2)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_21,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,implies(X3,X1)))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_17]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(not(not(X1)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_27,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X1),X2))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),not(X2))) ),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X2),X2))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(not(not(X1)),X2))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(X1,implies(X2,not(not(X2))))),
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_34,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X2),X1))
| ~ is_a_theorem(implies(X2,not(X2))) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(X1,not(not(X2))))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_33]) ).
cnf(c_0_36,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X1,X3)))
| ~ is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_37,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),not(not(X1)))) ),
inference(spm,[status(thm)],[c_0_34,c_0_29]) ).
cnf(c_0_38,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_35]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X1,X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_10]) ).
cnf(c_0_41,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(not(X1),implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_40]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_23,c_0_29]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_43]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(X1,not(not(implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_12,c_0_44]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(implies(X1,X4),X3))
| ~ is_a_theorem(implies(X1,implies(X2,X4))) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_49,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(not(X1),not(not(implies(X2,implies(X1,X3)))))),
inference(spm,[status(thm)],[c_0_19,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
prove_cn_1 ).
cnf(c_0_52,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(not(implies(X1,implies(X2,X3))),X2)),
inference(spm,[status(thm)],[c_0_23,c_0_50]) ).
cnf(c_0_54,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,implies(implies(b,c),implies(a,c))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_56,negated_conjecture,
~ is_a_theorem(implies(b,implies(implies(b,c),implies(a,c)))),
inference(spm,[status(thm)],[c_0_54,c_0_10]) ).
cnf(c_0_57,plain,
( is_a_theorem(implies(X1,implies(implies(X1,X2),X3)))
| ~ is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_38,c_0_7]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_38,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : LCL064-1 : TPTP v8.1.2. Released v1.0.0.
% 0.09/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n005.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 : Fri Aug 25 04:55:08 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.82/0.94 % Version : CSE_E---1.5
% 0.82/0.94 % Problem : theBenchmark.p
% 0.82/0.94 % Proof found
% 0.82/0.94 % SZS status Theorem for theBenchmark.p
% 0.82/0.94 % SZS output start Proof
% See solution above
% 0.82/0.94 % Total time : 0.382000 s
% 0.82/0.94 % SZS output end Proof
% 0.82/0.94 % Total time : 0.385000 s
%------------------------------------------------------------------------------