%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL098-1 : 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 : 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:24 PM UTC 2026
% Result : Unsatisfiable 30.76s 19.88s
% Output : CNFRefutation 30.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of clauses : 15 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 25 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(lg_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_3) ).
cnf(prove_lg_4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_4) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)),
lg_3 ).
cnf(c_0_5,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X5),equivalent(equivalent(X3,X4),X5)),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)))
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X4)) ),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X5)),X6))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X3,X4),X5)),X6)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X5)),X6)))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(equivalent(X4,X5),X6)),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X5)),X1),equivalent(equivalent(X4,X5),X2)))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_11,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X2,X3),X4),X5),equivalent(equivalent(equivalent(X2,X6),X4),equivalent(equivalent(X3,X6),X5))),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
prove_lg_4 ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))),
inference(spm,[status(thm)],[c_0_11,c_0_4]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LCL098-1 : 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.13/0.32 % Computer : n018.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon May 4 21:59:17 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 30.76/19.88 % Version : CSE_E---1.7
% 30.76/19.88 % Problem : theBenchmark.p
% 30.76/19.88 % SZS status Unsatisfiable for theBenchmark.p
% 30.76/19.88 % SZS output start CNFRefutation
% See solution above
% 30.85/19.98 % Total time : 15.393s
%------------------------------------------------------------------------------