%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL428-1 : TPTP v9.2.1. Bugfixed v5.5.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 : n011.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:40:19 PM UTC 2026
% Result : Unsatisfiable 1.56s 1.84s
% Output : CNFRefutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 29 ( 16 unt; 0 nHn; 14 RR)
% Number of literals : 50 ( 0 equ; 26 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 18 ( 18 usr; 17 con; 0-2 aty)
% Number of variables : 59 ( 3 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(mv2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv2) ).
cnf(mv3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv3) ).
cnf(mv1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv1) ).
cnf(prove_hr,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_hr) ).
cnf(mv5,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X1)),implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mv5) ).
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,X2),implies(implies(X2,X3),implies(X1,X3)))),
mv2 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
mv3 ).
cnf(c_0_9,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv1 ).
cnf(c_0_10,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X2,X1),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_12,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,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_13,c_0_14]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),X3))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)),
prove_hr ).
cnf(c_0_18,plain,
( is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X4))),X4))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X1,implies(implies(X3,X2),X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_20,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_9]),c_0_9])]) ).
cnf(c_0_21,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X1)),implies(X2,X1))),
mv5 ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_24,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_16]),c_0_21])]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_16]),c_0_8])]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_25,c_0_7]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_9]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL428-1 : TPTP v9.2.1. Bugfixed v5.5.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 : n011.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 22:33:17 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.56/1.84 % Version : CSE_E---1.7
% 1.56/1.84 % Problem : theBenchmark.p
% 1.56/1.84 % SZS status Unsatisfiable for theBenchmark.p
% 1.56/1.84 % SZS output start CNFRefutation
% See solution above
% 1.56/1.85 % Total time : 1.371s
%------------------------------------------------------------------------------