%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL080-2 : TPTP v9.2.1. Released v1.0.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 : n017.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:21 PM UTC 2026
% Result : Unsatisfiable 1.58s 1.84s
% Output : CNFRefutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 27 ( 12 unt; 0 nHn; 14 RR)
% Number of literals : 45 ( 0 equ; 22 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 12 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(ic_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_3) ).
cnf(ic_4,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_4) ).
cnf(ic_2,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_2) ).
cnf(prove_ic_JLukasiewicz,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_JLukasiewicz) ).
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(implies(X1,X2),X1),X1)),
ic_3 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
ic_4 ).
cnf(c_0_8,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(pm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(pm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(pm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
ic_2 ).
cnf(c_0_12,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_5,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
prove_ic_JLukasiewicz ).
cnf(c_0_14,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(pm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(pm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),X3))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(pm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(pm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( ~ is_a_theorem(implies(X1,implies(implies(c,a),implies(e,a))))
| ~ is_a_theorem(implies(implies(implies(a,b),c),X1)) ),
inference(pm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(pm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(implies(implies(X2,X4),implies(X1,X4)),X3)) ),
inference(pm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X1),X3))
| ~ is_a_theorem(implies(X1,implies(implies(implies(X1,X2),X1),X3))) ),
inference(pm,[status(thm)],[c_0_10,c_0_16]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(pm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(a,b),c),implies(X1,implies(implies(c,a),implies(e,a)))))
| ~ is_a_theorem(X1) ),
inference(pm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X1,X3),X4),implies(implies(X2,X3),X4)))),
inference(pm,[status(thm)],[c_0_20,c_0_7]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(pm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL080-2 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11 % 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.14/0.32 % Computer : n017.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon May 4 21:55:57 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.58/1.84 % Version : CSE_E---1.7
% 1.58/1.84 % Problem : theBenchmark.p
% 1.58/1.84 % SZS status Unsatisfiable for theBenchmark.p
% 1.58/1.84 % SZS output start CNFRefutation
% See solution above
% 1.58/1.84 % Total time : 1.370s
%------------------------------------------------------------------------------