%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL013-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 08:48:31 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.40s
% Output : Proof 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 14 ( 11 unt; 0 nHn; 13 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 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 : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(Y)
| ~ is_a_theorem(X)
| ~ is_a_theorem(equivalent(X,Y)) ),
file('theBenchmark.p',condensed_detachment) ).
cnf(xgf,axiom,
is_a_theorem(equivalent(X,equivalent(equivalent(Y,equivalent(X,Z)),equivalent(Z,Y)))),
file('theBenchmark.p',xgf) ).
cnf(prove_um,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
file('theBenchmark.p',prove_um) ).
cnf(t1,plain,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))),
inference(start,[status(thm),parent(0:0)],[prove_um]) ).
cnf(t2,plain,
( ~ is_a_theorem(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))),equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))))
| is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))) ),
inference(extension,[status(thm),parent(t1:1)],[condensed_detachment]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ is_a_theorem(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))))
| ~ is_a_theorem(equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))),equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))))))
| is_a_theorem(equivalent(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))),equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))))) ),
inference(extension,[status(thm),parent(t2:2)],[condensed_detachment]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
is_a_theorem(equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c))),equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a)))))),
inference(extension,[status(thm),parent(t4:2)],[xgf]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
is_a_theorem(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b)))),
inference(extension,[status(thm),parent(t4:3)],[xgf]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
is_a_theorem(equivalent(equivalent(b,equivalent(c,a)),equivalent(equivalent(c,equivalent(equivalent(b,equivalent(c,a)),equivalent(a,b))),equivalent(equivalent(a,b),c)))),
inference(extension,[status(thm),parent(t2:3)],[xgf]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL013-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.37 % Computer : n018.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.38 % CPULimit : 300
% 0.08/0.38 % WCLimit : 300
% 0.08/0.38 % DateTime : Sat Sep 19 13:56:58 UTC 2026
% 0.08/0.38 % CPUTime :
% 0.08/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------