%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : COM002-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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:14:41 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.41s
% Output : Proof 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of clauses : 34 ( 24 unt; 4 nHn; 33 RR)
% Number of literals : 50 ( 0 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(direct_success,axiom,
( ~ follows(Goal_state,Start_state)
| ~ fails(Goal_state,Start_state) ),
file('theBenchmark.p',direct_success) ).
cnf(transitivity_of_success,axiom,
( fails(Intermediate_state,Start_state)
| fails(Goal_state,Intermediate_state)
| ~ fails(Goal_state,Start_state) ),
file('theBenchmark.p',transitivity_of_success) ).
cnf(goto_success,axiom,
( ~ labels(Label,Goal_state)
| ~ has(Start_state,goto(Label))
| ~ fails(Goal_state,Start_state) ),
file('theBenchmark.p',goto_success) ).
cnf(label_state_3,hypothesis,
labels(loop,p3),
file('theBenchmark.p',label_state_3) ).
cnf(transition_3_to_6,hypothesis,
follows(p6,p3),
file('theBenchmark.p',transition_3_to_6) ).
cnf(transition_6_to_7,hypothesis,
follows(p7,p6),
file('theBenchmark.p',transition_6_to_7) ).
cnf(transition_7_to_8,hypothesis,
follows(p8,p7),
file('theBenchmark.p',transition_7_to_8) ).
cnf(state_8,hypothesis,
has(p8,goto(loop)),
file('theBenchmark.p',state_8) ).
cnf(prove_there_is_a_loop_through_p3,negated_conjecture,
fails(p3,p3),
file('theBenchmark.p',prove_there_is_a_loop_through_p3) ).
cnf(t1,plain,
( ~ follows(p6,p3)
| ~ fails(p6,p3) ),
inference(start,[status(thm),parent(0:0)],[direct_success]) ).
cnf(t2,plain,
( fails(p8,p6)
| ~ fails(p8,p3)
| fails(p6,p3) ),
inference(extension,[status(thm),parent(t1:1)],[transitivity_of_success]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( fails(p3,p8)
| ~ fails(p3,p3)
| fails(p8,p3) ),
inference(extension,[status(thm),parent(t2:2)],[transitivity_of_success]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
fails(p3,p3),
inference(extension,[status(thm),parent(t4:2)],[prove_there_is_a_loop_through_p3]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
( ~ has(p8,goto(loop))
| ~ labels(loop,p3)
| ~ fails(p3,p8) ),
inference(extension,[status(thm),parent(t4:3)],[goto_success]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t4:3]) ).
cnf(t10,plain,
labels(loop,p3),
inference(extension,[status(thm),parent(t8:2)],[label_state_3]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t8:2]) ).
cnf(t12,plain,
has(p8,goto(loop)),
inference(extension,[status(thm),parent(t8:3)],[state_8]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t8:3]) ).
cnf(t14,plain,
( fails(p8,p7)
| fails(p7,p6)
| ~ fails(p8,p6) ),
inference(extension,[status(thm),parent(t2:3)],[transitivity_of_success]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t2:3]) ).
cnf(t16,plain,
( ~ follows(p7,p6)
| ~ fails(p7,p6) ),
inference(extension,[status(thm),parent(t14:2)],[direct_success]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
follows(p7,p6),
inference(extension,[status(thm),parent(t16:2)],[transition_6_to_7]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t16:2]) ).
cnf(t20,plain,
( ~ follows(p8,p7)
| ~ fails(p8,p7) ),
inference(extension,[status(thm),parent(t14:3)],[direct_success]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t14:3]) ).
cnf(t22,plain,
follows(p8,p7),
inference(extension,[status(thm),parent(t20:2)],[transition_7_to_8]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t20:2]) ).
cnf(t24,plain,
follows(p6,p3),
inference(extension,[status(thm),parent(t1:2)],[transition_3_to_6]) ).
cnf(t25,plain,
$false,
inference(connection,[status(thm),parent(t24:1)],[t24:1,t1:2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM002-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 15:04:21 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.13/0.41 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.41 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------