%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL190-3 : TPTP v9.3.1. Released v2.3.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 : n008.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:50 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.43s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 11 unt; 0 nHn; 14 RR)
% Number of literals : 23 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_4,axiom,
axiom(implies(or(A,B),or(B,A))),
file('LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))),
file('LCL004-0.ax',axiom_1_6) ).
cnf(rule_1,axiom,
( ~ axiom(X)
| theorem(X) ),
file('LCL004-0.ax',rule_1) ).
cnf(rule_2,axiom,
( ~ theorem(Y)
| ~ theorem(implies(Y,X))
| theorem(X) ),
file('LCL004-0.ax',rule_2) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(or(p,or(q,r)),or(p,or(r,q)))),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ theorem(implies(or(p,or(q,r)),or(p,or(r,q)))),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ theorem(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q)))))
| ~ theorem(implies(or(q,r),or(r,q)))
| theorem(implies(or(p,or(q,r)),or(p,or(r,q)))) ),
inference(extension,[status(thm),parent(t1:1)],[rule_2]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ axiom(implies(or(q,r),or(r,q)))
| theorem(implies(or(q,r),or(r,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(implies(or(q,r),or(r,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(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q)))))
| theorem(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q))))) ),
inference(extension,[status(thm),parent(t2:3)],[rule_1]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
cnf(t10,plain,
axiom(implies(implies(or(q,r),or(r,q)),implies(or(p,or(q,r)),or(p,or(r,q))))),
inference(extension,[status(thm),parent(t8:2)],[axiom_1_6]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL190-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_HRN problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n008.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 19 14:19:54 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.43 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.43 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------