%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : LCL205-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 : n009.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:52 AM UTC 2026
% Result : Unsatisfiable 5.64s 10.99s
% Output : Proof 5.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 8
% Syntax : Number of clauses : 37 ( 27 unt; 0 nHn; 33 RR)
% Number of literals : 55 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 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 : 14 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_2,axiom,
axiom(or(not(or(A,A)),A)),
file('LCL003-0.ax',axiom_1_2) ).
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_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(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(p),not(q)))),
file('theBenchmark.p',prove_this) ).
cnf(t1,plain,
~ theorem(or(not(not(or(not(p),q))),or(not(p),not(q)))),
inference(start,[status(thm),parent(0:0)],[prove_this]) ).
cnf(t2,plain,
( ~ axiom(or(not(not(or(not(p),q))),or(not(or(not(p),q)),not(or(not(p),q)))))
| ~ theorem(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),or(not(p),not(q))))
| theorem(or(not(not(or(not(p),q))),or(not(p),not(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(not(or(not(p),q)),not(or(not(p),q)))),or(not(p),or(not(or(not(p),q)),not(or(not(p),q))))))
| ~ theorem(or(not(or(not(p),or(not(or(not(p),q)),not(or(not(p),q))))),or(not(p),not(q))))
| theorem(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),or(not(p),not(q)))) ),
inference(extension,[status(thm),parent(t2:2)],[rule_3]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ axiom(or(not(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(q))),or(not(or(not(p),or(not(or(not(p),q)),not(or(not(p),q))))),or(not(p),not(q)))))
| ~ theorem(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(q)))
| theorem(or(not(or(not(p),or(not(or(not(p),q)),not(or(not(p),q))))),or(not(p),not(q)))) ),
inference(extension,[status(thm),parent(t4:2)],[rule_2]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ axiom(or(not(or(not(q),not(or(not(or(not(p),q)),not(or(not(p),q)))))),or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(q))))
| ~ theorem(or(not(q),not(or(not(or(not(p),q)),not(or(not(p),q))))))
| theorem(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(q))) ),
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(q),or(not(p),q)))
| ~ theorem(or(not(or(not(p),q)),not(or(not(or(not(p),q)),not(or(not(p),q))))))
| theorem(or(not(q),not(or(not(or(not(p),q)),not(or(not(p),q)))))) ),
inference(extension,[status(thm),parent(t8:2)],[rule_3]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
( ~ axiom(or(not(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(or(not(p),q)))),or(not(or(not(p),q)),not(or(not(or(not(p),q)),not(or(not(p),q)))))))
| ~ theorem(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(or(not(p),q))))
| theorem(or(not(or(not(p),q)),not(or(not(or(not(p),q)),not(or(not(p),q)))))) ),
inference(extension,[status(thm),parent(t10:2)],[rule_2]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).
cnf(t14,plain,
( ~ axiom(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(or(not(p),q))))
| theorem(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(or(not(p),q)))) ),
inference(extension,[status(thm),parent(t12:2)],[rule_1]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
axiom(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(or(not(p),q)))),
inference(extension,[status(thm),parent(t14:2)],[axiom_1_2]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
axiom(or(not(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(or(not(p),q)))),or(not(or(not(p),q)),not(or(not(or(not(p),q)),not(or(not(p),q))))))),
inference(extension,[status(thm),parent(t12:3)],[axiom_1_4]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t12:3]) ).
cnf(t20,plain,
axiom(or(not(q),or(not(p),q))),
inference(extension,[status(thm),parent(t10:3)],[axiom_1_3]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t10:3]) ).
cnf(t22,plain,
axiom(or(not(or(not(q),not(or(not(or(not(p),q)),not(or(not(p),q)))))),or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(q)))),
inference(extension,[status(thm),parent(t8:3)],[axiom_1_4]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t8:3]) ).
cnf(t24,plain,
axiom(or(not(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),not(q))),or(not(or(not(p),or(not(or(not(p),q)),not(or(not(p),q))))),or(not(p),not(q))))),
inference(extension,[status(thm),parent(t6:3)],[axiom_1_6]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t6:3]) ).
cnf(t26,plain,
axiom(or(not(or(not(or(not(p),q)),not(or(not(p),q)))),or(not(p),or(not(or(not(p),q)),not(or(not(p),q)))))),
inference(extension,[status(thm),parent(t4:3)],[axiom_1_3]) ).
cnf(t27,plain,
$false,
inference(connection,[status(thm),parent(t26:1)],[t26:1,t4:3]) ).
cnf(t28,plain,
axiom(or(not(not(or(not(p),q))),or(not(or(not(p),q)),not(or(not(p),q))))),
inference(extension,[status(thm),parent(t2:3)],[axiom_1_3]) ).
cnf(t29,plain,
$false,
inference(connection,[status(thm),parent(t28:1)],[t28:1,t2:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL205-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/5.37 % Computer : n009.cluster.edu
% 0.09/5.37 % Model : x86_64 x86_64
% 0.09/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37 % Memory : 8046.5625MB
% 0.09/5.37 % OS : Linux 6.8.0-71-generic
% 0.09/5.37 % CPULimit : 300
% 0.09/5.37 % WCLimit : 300
% 0.09/5.37 % DateTime : Sat Sep 19 14:21:04 UTC 2026
% 0.09/5.37 % CPUTime :
% 5.64/10.99 % SZS status Unsatisfiable for theBenchmark
% 5.64/10.99 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------