%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL069-1 : TPTP v9.2.1. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n018.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 : Tue May 5 04:39:19 PM UTC 2026
% Result : Unsatisfiable 2.00s 1.93s
% Output : CNFRefutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of clauses : 60 ( 25 unt; 0 nHn; 21 RR)
% Number of literals : 112 ( 0 equ; 54 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 161 ( 55 sgn)
% Comments :
%------------------------------------------------------------------------------
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_59,axiom,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X3,X2),implies(implies(X1,X3),X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_59) ).
cnf(cn_19,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_19) ).
cnf(cn_37,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_37) ).
cnf(prove_cn_3,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_3) ).
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(not(X1),X2),implies(implies(X3,X2),implies(implies(X1,X3),X2)))),
cn_59 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
cn_19 ).
cnf(c_0_8,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2)))
| ~ is_a_theorem(implies(not(X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(not(X1),X3))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_12,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X2),X1))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_14,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
cn_37 ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,implies(X2,not(X3))))
| ~ is_a_theorem(implies(X4,implies(X1,implies(X2,not(X3)))))
| ~ is_a_theorem(implies(X3,X4)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(implies(X1,X3),X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,implies(X2,not(X3))))
| ~ is_a_theorem(implies(X3,implies(X2,not(X3)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,implies(X2,not(not(implies(X3,X2)))))),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(not(not(X1)),implies(implies(X2,X3),implies(implies(X1,X2),X3)))),
inference(spm,[status(thm)],[c_0_16,c_0_6]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,not(not(implies(X2,X1)))))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_19]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X3,implies(X1,not(X2))))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_24,plain,
( is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2)))
| ~ is_a_theorem(not(not(X3))) ),
inference(spm,[status(thm)],[c_0_5,c_0_20]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(X2,not(X3))))
| ~ is_a_theorem(implies(X3,not(X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(X1,not(not(implies(X2,X1))))),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,implies(implies(X3,X1),not(X2)))) ),
inference(spm,[status(thm)],[c_0_23,c_0_7]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(not(X1),implies(implies(X2,X1),X3)))
| ~ is_a_theorem(not(not(X2))) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,not(X1)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_25]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(X1,not(not(implies(X2,implies(X3,X1)))))),
inference(spm,[status(thm)],[c_0_9,c_0_26]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X4,implies(X1,implies(X2,X3))))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X1))))),
inference(spm,[status(thm)],[c_0_9,c_0_13]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(X1,not(not(X1))))
| ~ is_a_theorem(not(not(X2))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( is_a_theorem(not(not(implies(X1,X2))))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_26]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(not(implies(X1,implies(X2,X3))),not(X3)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(not(X1),not(not(implies(X2,implies(X1,X3)))))),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( is_a_theorem(implies(X1,not(not(X1))))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(not(implies(X1,implies(X2,X3))),not(X3))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_5,c_0_37]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(not(not(X1)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_24]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(X1,implies(X2,not(not(X1)))))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(not(not(X2)))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_5,c_0_42]) ).
cnf(c_0_45,plain,
( is_a_theorem(not(not(X1)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_41]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(X1,implies(X2,not(not(X1))))),
inference(spm,[status(thm)],[c_0_43,c_0_39]) ).
cnf(c_0_47,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(X1,not(not(X2))))
| ~ is_a_theorem(implies(not(X2),X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_46]) ).
cnf(c_0_49,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X3),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_47,c_0_11]) ).
cnf(c_0_50,plain,
is_a_theorem(implies(X1,not(not(implies(X2,X2))))),
inference(spm,[status(thm)],[c_0_48,c_0_18]) ).
cnf(c_0_51,plain,
( is_a_theorem(not(not(implies(X1,X1))))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,plain,
is_a_theorem(not(not(implies(X1,X1)))),
inference(spm,[status(thm)],[c_0_51,c_0_39]) ).
cnf(c_0_53,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X2),X3))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_52]) ).
cnf(c_0_54,plain,
is_a_theorem(implies(not(X1),implies(X2,implies(X3,implies(X1,X4))))),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_55,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(not(implies(X2,X2))),X1)) ),
inference(spm,[status(thm)],[c_0_53,c_0_41]) ).
cnf(c_0_56,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X2,not(X3))) ),
inference(spm,[status(thm)],[c_0_31,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
prove_cn_3 ).
cnf(c_0_58,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL069-1 : TPTP v9.2.1. Bugfixed v1.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n018.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 21:56:17 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 2.00/1.93 % Version : CSE_E---1.7
% 2.00/1.93 % Problem : theBenchmark.p
% 2.00/1.93 % SZS status Unsatisfiable for theBenchmark.p
% 2.00/1.93 % SZS output start CNFRefutation
% See solution above
% 2.00/1.93 % Total time : 1.369s
%------------------------------------------------------------------------------