%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL101-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 : n015.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 1.23s 1.68s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of clauses : 22 ( 15 unt; 0 nHn; 9 RR)
% Number of literals : 31 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 66 ( 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_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).
cnf(p_4,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_4) ).
cnf(prove_p_1,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p_1) ).
cnf(c_0_4,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
lg_2 ).
cnf(c_0_6,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1))),
p_4 ).
cnf(c_0_8,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),equivalent(X5,X6)))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_11,plain,
( is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_13,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))),equivalent(X1,equivalent(X3,X4)))),
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_17,plain,
( is_a_theorem(equivalent(X1,equivalent(X2,X3)))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X4,X2),equivalent(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_16]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4))),
inference(spm,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_19,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
prove_p_1 ).
cnf(c_0_20,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_13,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL101-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.09 % 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.12/0.29 % Computer : n015.cluster.edu
% 0.12/0.29 % Model : x86_64 x86_64
% 0.12/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.29 % Memory : 8042.1875MB
% 0.12/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.29 % CPULimit : 300
% 0.12/0.29 % WCLimit : 300
% 0.12/0.29 % DateTime : Mon May 4 21:59:16 EDT 2026
% 0.12/0.29 % CPUTime :
% 0.12/0.30 % start to proof: theBenchmark
% 1.23/1.68 % Version : CSE_E---1.7
% 1.23/1.68 % Problem : theBenchmark.p
% 1.23/1.68 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.68 % SZS output start CNFRefutation
% See solution above
% 1.23/1.69 % Total time : 1.368s
%------------------------------------------------------------------------------