%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL108-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 : n025.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:25 PM UTC 2026
% Result : Unsatisfiable 1.31s 1.76s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of clauses : 30 ( 16 unt; 0 nHn; 16 RR)
% Number of literals : 48 ( 0 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 126 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(lg_27_1690,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X5),equivalent(equivalent(equivalent(X6,X5),equivalent(X6,X4)),X7))),equivalent(X3,equivalent(equivalent(X2,X1),X7)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_27_1690) ).
cnf(prove_q_3,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(equivalent(b,a),c)),c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_q_3) ).
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(X1,X2),X3),equivalent(equivalent(X4,X5),equivalent(equivalent(equivalent(X6,X5),equivalent(X6,X4)),X7))),equivalent(X3,equivalent(equivalent(X2,X1),X7)))),
lg_27_1690 ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X4)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X2),X1),equivalent(equivalent(X5,X6),equivalent(equivalent(equivalent(X7,X6),equivalent(X7,X5)),X4)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X2),equivalent(X3,X1)),X4)),equivalent(equivalent(equivalent(X5,X6),equivalent(equivalent(X7,X5),equivalent(X7,X6))),X4))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(X5,X7))),equivalent(X4,equivalent(X6,X7))),X8)),equivalent(equivalent(X2,X3),X8))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),equivalent(equivalent(equivalent(X5,equivalent(equivalent(X6,X7),equivalent(X6,X8))),equivalent(X5,equivalent(X7,X8))),X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,equivalent(X3,X5)))),equivalent(X1,equivalent(X4,X5))),X6),X6)),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,equivalent(equivalent(X3,equivalent(X4,X5)),equivalent(X3,equivalent(X4,X6)))),equivalent(X2,equivalent(X5,X6))),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X4),equivalent(X3,X5)))),equivalent(X1,equivalent(X2,X6))),equivalent(equivalent(X4,X5),X6))),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X4,equivalent(X5,equivalent(equivalent(X6,X1),equivalent(X6,X2)))),equivalent(X4,equivalent(X5,X3)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X4),equivalent(equivalent(X1,equivalent(equivalent(X5,X2),equivalent(X5,X3))),X4))),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))),X5))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X3,X4)),X5)) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X4),equivalent(X3,X5))))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X4,X5)),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_14]) ).
cnf(c_0_16,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,X5)),equivalent(equivalent(equivalent(X6,X3),equivalent(X6,X4)),X5)),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(equivalent(b,a),c)),c)),
prove_q_3 ).
cnf(c_0_21,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_19]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(equivalent(X4,X2),X5))),equivalent(equivalent(X4,X3),X5))),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),equivalent(equivalent(b,a),c)),X1))
| ~ is_a_theorem(equivalent(X1,c)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X4,equivalent(X5,X2)),equivalent(equivalent(X6,X4),equivalent(X6,equivalent(equivalent(X1,X5),X3))))) ),
inference(spm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),X1),c))
| ~ is_a_theorem(equivalent(equivalent(equivalent(b,a),c),X1)) ),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X2)),X3)),X3)),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_27,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(b,a),c),equivalent(equivalent(equivalent(a,b),equivalent(X1,X1)),c))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(equivalent(X4,X1),equivalent(equivalent(X5,X4),equivalent(X5,X2))),X3))),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : LCL108-1 : TPTP v9.2.1. Released v1.0.0.
% 0.09/0.14 % 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.17/0.35 % Computer : n025.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Mon May 4 21:59:43 EDT 2026
% 0.17/0.35 % CPUTime :
% 0.17/0.36 % start to proof: theBenchmark
% 1.31/1.76 % Version : CSE_E---1.7
% 1.31/1.76 % Problem : theBenchmark.p
% 1.31/1.76 % SZS status Unsatisfiable for theBenchmark.p
% 1.31/1.76 % SZS output start CNFRefutation
% See solution above
% 1.31/1.76 % Total time : 1.375s
%------------------------------------------------------------------------------