%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL185-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 : n026.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:49 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.38s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 10 unt; 0 nHn; 12 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 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 : 8 ( 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(rule_1,axiom,
( ~ axiom(X)
| theorem(X) ),
file('LCL003-0.ax',rule_1) ).
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(p),or(p,q))),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ theorem(or(not(p),or(p,q))),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ axiom(or(not(p),or(q,p)))
| ~ theorem(or(not(or(q,p)),or(p,q)))
| theorem(or(not(p),or(p,q))) ),
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(q,p)),or(p,q)))
| theorem(or(not(or(q,p)),or(p,q))) ),
inference(extension,[status(thm),parent(t2:2)],[rule_1]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
axiom(or(not(or(q,p)),or(p,q))),
inference(extension,[status(thm),parent(t4:2)],[axiom_1_4]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
axiom(or(not(p),or(q,p))),
inference(extension,[status(thm),parent(t2:3)],[axiom_1_3]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL185-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.07/0.36 % Computer : n026.cluster.edu
% 0.07/0.36 % Model : x86_64 x86_64
% 0.07/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.36 % Memory : 8046.5625MB
% 0.07/0.36 % OS : Linux 6.8.0-71-generic
% 0.07/0.36 % CPULimit : 300
% 0.07/0.36 % WCLimit : 300
% 0.07/0.36 % DateTime : Sat Sep 19 14:21:06 UTC 2026
% 0.07/0.36 % CPUTime :
% 0.13/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------