%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL207-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n014.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:53 AM UTC 2026
% Result : Unsatisfiable 0.20s 0.50s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of clauses : 28 ( 20 unt; 0 nHn; 25 RR)
% Number of literals : 42 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 13 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_3,axiom,
axiom(or(not(A),or(B,A))),
file('LCL003-0.ax',axiom_1_3) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(A,B)),or(B,A))),
file('LCL003-0.ax',axiom_1_4) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))),
file('LCL003-0.ax',axiom_1_5) ).
cnf(rule_1,axiom,
( ~ axiom(X)
| theorem(X) ),
file('LCL003-0.ax',rule_1) ).
cnf(rule_2,axiom,
( ~ theorem(Y)
| ~ axiom(or(not(Y),X))
| theorem(X) ),
file('LCL003-0.ax',rule_2) ).
cnf(rule_3,axiom,
( ~ theorem(or(not(Y),Z))
| ~ axiom(or(not(X),Y))
| theorem(or(not(X),Z)) ),
file('LCL003-0.ax',rule_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(not(or(not(p),q))),or(not(q),p))),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ theorem(or(not(not(or(not(p),q))),or(not(q),p))),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ axiom(or(not(not(or(not(p),q))),or(p,not(or(not(p),q)))))
| ~ theorem(or(not(or(p,not(or(not(p),q)))),or(not(q),p)))
| theorem(or(not(not(or(not(p),q))),or(not(q),p))) ),
inference(extension,[status(thm),parent(t1:1)],[rule_3]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ axiom(or(not(or(not(q),or(not(or(p,not(or(not(p),q)))),p))),or(not(or(p,not(or(not(p),q)))),or(not(q),p))))
| ~ theorem(or(not(q),or(not(or(p,not(or(not(p),q)))),p)))
| theorem(or(not(or(p,not(or(not(p),q)))),or(not(q),p))) ),
inference(extension,[status(thm),parent(t2:2)],[rule_2]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ axiom(or(not(q),or(not(p),q)))
| ~ theorem(or(not(or(not(p),q)),or(not(or(p,not(or(not(p),q)))),p)))
| theorem(or(not(q),or(not(or(p,not(or(not(p),q)))),p))) ),
inference(extension,[status(thm),parent(t4:2)],[rule_3]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ axiom(or(not(or(not(or(p,not(or(not(p),q)))),or(not(or(not(p),q)),p))),or(not(or(not(p),q)),or(not(or(p,not(or(not(p),q)))),p))))
| ~ theorem(or(not(or(p,not(or(not(p),q)))),or(not(or(not(p),q)),p)))
| theorem(or(not(or(not(p),q)),or(not(or(p,not(or(not(p),q)))),p))) ),
inference(extension,[status(thm),parent(t6:2)],[rule_2]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
( ~ axiom(or(not(or(p,not(or(not(p),q)))),or(not(or(not(p),q)),p)))
| theorem(or(not(or(p,not(or(not(p),q)))),or(not(or(not(p),q)),p))) ),
inference(extension,[status(thm),parent(t8:2)],[rule_1]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
axiom(or(not(or(p,not(or(not(p),q)))),or(not(or(not(p),q)),p))),
inference(extension,[status(thm),parent(t10:2)],[axiom_1_4]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
axiom(or(not(or(not(or(p,not(or(not(p),q)))),or(not(or(not(p),q)),p))),or(not(or(not(p),q)),or(not(or(p,not(or(not(p),q)))),p)))),
inference(extension,[status(thm),parent(t8:3)],[axiom_1_5]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t8:3]) ).
cnf(t16,plain,
axiom(or(not(q),or(not(p),q))),
inference(extension,[status(thm),parent(t6:3)],[axiom_1_3]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t6:3]) ).
cnf(t18,plain,
axiom(or(not(or(not(q),or(not(or(p,not(or(not(p),q)))),p))),or(not(or(p,not(or(not(p),q)))),or(not(q),p)))),
inference(extension,[status(thm),parent(t4:3)],[axiom_1_5]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t4:3]) ).
cnf(t20,plain,
axiom(or(not(not(or(not(p),q))),or(p,not(or(not(p),q))))),
inference(extension,[status(thm),parent(t2:3)],[axiom_1_3]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL207-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.38 % Computer : n014.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sat Sep 19 14:20:51 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.20/0.50 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------