%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL029-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n027.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:13 PM UTC 2026
% Result : Unsatisfiable 1.39s 1.76s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 24 ( 12 unt; 0 nHn; 12 RR)
% Number of literals : 39 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c0_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_3) ).
cnf(c0_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_1) ).
cnf(c0_2,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_2) ).
cnf(prove_c0_5,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_5) ).
cnf(c0_4,axiom,
is_a_theorem(implies(falsehood,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_4) ).
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(implies(X1,X2),X1),X1)),
c0_3 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
c0_1 ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(pm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(pm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(pm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
c0_2 ).
cnf(c_0_13,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)),
prove_c0_5 ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(pm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(pm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(pm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(a,falsehood),falsehood),X1))
| ~ is_a_theorem(implies(X1,a)) ),
inference(pm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(implies(X2,X3),X2))) ),
inference(pm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(pm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
~ is_a_theorem(implies(implies(implies(falsehood,X1),implies(implies(a,falsehood),X1)),a)),
inference(pm,[status(thm)],[c_0_17,c_0_8]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(implies(X1,implies(implies(X2,X3),X2)),X2))
| ~ is_a_theorem(X1) ),
inference(pm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
is_a_theorem(implies(falsehood,X1)),
c0_4 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL029-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n027.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:53:04 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.39/1.76 % Version : CSE_E---1.7
% 1.39/1.76 % Problem : theBenchmark.p
% 1.39/1.76 % SZS status Unsatisfiable for theBenchmark.p
% 1.39/1.76 % SZS output start CNFRefutation
% See solution above
% 1.39/1.77 % Total time : 1.369s
%------------------------------------------------------------------------------