%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL174-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 : n010.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:47 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.57s
% Output : Proof 0.12s
% 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 : 8 ( 3 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 : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(axiom_1_6,axiom,
axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B)))),
file('LCL003-0.ax',axiom_1_6) ).
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(prove_this,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ theorem(or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ axiom(or(not(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))))
| ~ theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r))))
| theorem(or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))) ),
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(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r))))
| theorem(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))) ),
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(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
inference(extension,[status(thm),parent(t4:2)],[axiom_1_6]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
axiom(or(not(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r))))),
inference(extension,[status(thm),parent(t2:3)],[axiom_1_5]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL174-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.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.55 % Computer : n010.cluster.edu
% 0.09/0.55 % Model : x86_64 x86_64
% 0.09/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.55 % Memory : 8046.5625MB
% 0.09/0.55 % OS : Linux 6.8.0-71-generic
% 0.09/0.55 % CPULimit : 300
% 0.09/0.55 % WCLimit : 300
% 0.09/0.55 % DateTime : Sat Sep 19 14:16:43 UTC 2026
% 0.12/0.56 % CPUTime :
% 0.12/0.57 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.57 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------