%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COM002-2 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:12:45 PM UTC 2026
% Result : Unsatisfiable 0.25s 1.62s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 19
% Syntax : Number of clauses : 55 ( 38 unt; 4 nHn; 51 RR)
% Number of literals : 80 ( 0 equ; 39 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 16 con; 0-2 aty)
% Number of variables : 44 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(conditional_success,axiom,
( ~ fails(X1,X2)
| ~ has(X2,ifthen(X3,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conditional_success) ).
cnf(goto_success,axiom,
( ~ fails(X1,X2)
| ~ has(X2,goto(X3))
| ~ labels(X3,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).
cnf(state_3,hypothesis,
has(p3,ifthen(equal_function(register_j,n),p4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_3) ).
cnf(state_7,hypothesis,
has(p7,assign(register_j,plus(register_j,n1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_7) ).
cnf(state_6,hypothesis,
has(p6,assign(register_k,times(n2,register_k))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_6) ).
cnf(transitivity_of_success,axiom,
( fails(X1,X3)
| fails(X3,X2)
| ~ fails(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).
cnf(direct_success,axiom,
( ~ fails(X1,X2)
| ~ follows(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).
cnf(state_2,hypothesis,
has(p2,assign(register_k,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_2) ).
cnf(state_1,hypothesis,
has(p1,assign(register_j,n0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_1) ).
cnf(state_8,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).
cnf(state_4,hypothesis,
has(p4,goto(out)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_4) ).
cnf(label_state_3,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).
cnf(transition_7_to_8,hypothesis,
follows(p8,p7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_7_to_8) ).
cnf(transition_6_to_7,hypothesis,
follows(p7,p6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_6_to_7) ).
cnf(transition_3_to_6,hypothesis,
follows(p6,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_6) ).
cnf(transition_4_to_5,hypothesis,
follows(p5,p4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_4_to_5) ).
cnf(transition_2_to_3,hypothesis,
follows(p3,p2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_2_to_3) ).
cnf(transition_1_to_2,hypothesis,
follows(p2,p1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_1_to_2) ).
cnf(prove_there_is_a_loop_through_p3,negated_conjecture,
fails(p3,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
cnf(i_0_19,axiom,
( ~ fails(X1,X2)
| ~ has(X2,ifthen(X3,X1)) ),
conditional_success,
[final] ).
cnf(i_0_20,axiom,
( ~ fails(X1,X2)
| ~ has(X2,goto(X3))
| ~ labels(X3,X1) ),
goto_success,
[final] ).
cnf(i_0_21,hypothesis,
has(p3,ifthen(equal_function(register_j,n),p4)),
state_3,
[final] ).
cnf(i_0_22,hypothesis,
has(p7,assign(register_j,plus(register_j,n1))),
state_7,
[final] ).
cnf(i_0_23,hypothesis,
has(p6,assign(register_k,times(n2,register_k))),
state_6,
[final] ).
cnf(i_0_24,axiom,
( fails(X1,X3)
| fails(X3,X2)
| ~ fails(X1,X2) ),
transitivity_of_success,
[final] ).
cnf(i_0_25,axiom,
( ~ fails(X1,X2)
| ~ follows(X1,X2) ),
direct_success,
[final] ).
cnf(i_0_26,hypothesis,
has(p2,assign(register_k,n1)),
state_2,
[final] ).
cnf(i_0_27,hypothesis,
has(p1,assign(register_j,n0)),
state_1,
[final] ).
cnf(i_0_28,hypothesis,
has(p8,goto(loop)),
state_8,
[final] ).
cnf(i_0_29,hypothesis,
has(p4,goto(out)),
state_4,
[final] ).
cnf(i_0_30,hypothesis,
labels(loop,p3),
label_state_3,
[final] ).
cnf(i_0_31,hypothesis,
follows(p8,p7),
transition_7_to_8,
[final] ).
cnf(i_0_32,hypothesis,
follows(p7,p6),
transition_6_to_7,
[final] ).
cnf(i_0_33,hypothesis,
follows(p6,p3),
transition_3_to_6,
[final] ).
cnf(i_0_34,hypothesis,
follows(p5,p4),
transition_4_to_5,
[final] ).
cnf(i_0_35,hypothesis,
follows(p3,p2),
transition_2_to_3,
[final] ).
cnf(i_0_36,hypothesis,
follows(p2,p1),
transition_1_to_2,
[final] ).
cnf(i_0_37,negated_conjecture,
fails(p3,p3),
prove_there_is_a_loop_through_p3,
[final] ).
cnf(i_0_38,plain,
~ fails(p4,p3),
inference(scs_inference,[],[i_0_21,i_0_19]) ).
cnf(i_0_39,plain,
( ~ has(X1,ifthen(X2,X3))
| ~ fails(X3,X1) ),
inference(rename_variables,[],[i_0_19]) ).
cnf(i_0_40,plain,
~ fails(p8,p7),
inference(scs_inference,[],[i_0_21,i_0_31,i_0_19,i_0_25]) ).
cnf(i_0_41,plain,
( ~ follows(X1,X2)
| ~ fails(X1,X2) ),
inference(rename_variables,[],[i_0_25]) ).
cnf(i_0_42,plain,
~ fails(p3,p8),
inference(scs_inference,[],[i_0_21,i_0_30,i_0_31,i_0_28,i_0_19,i_0_25,i_0_20]) ).
cnf(i_0_43,plain,
( ~ has(X1,goto(X2))
| ~ labels(X2,X3)
| ~ fails(X3,X1) ),
inference(rename_variables,[],[i_0_20]) ).
cnf(i_0_44,plain,
fails(p8,p3),
inference(scs_inference,[],[i_0_37,i_0_21,i_0_30,i_0_31,i_0_28,i_0_19,i_0_25,i_0_20,i_0_24]) ).
cnf(i_0_45,plain,
( ~ fails(X1,X2)
| fails(X1,X3)
| fails(X3,X2) ),
inference(rename_variables,[],[i_0_24]) ).
cnf(i_0_46,plain,
~ fails(p7,p6),
inference(scs_inference,[],[i_0_32,i_0_25]) ).
cnf(i_0_47,plain,
( ~ follows(X1,X2)
| ~ fails(X1,X2) ),
inference(rename_variables,[],[i_0_25]) ).
cnf(i_0_48,plain,
fails(p7,p3),
inference(scs_inference,[],[i_0_44,i_0_40,i_0_32,i_0_25,i_0_24]) ).
cnf(i_0_49,plain,
( ~ fails(X1,X2)
| fails(X1,X3)
| fails(X3,X2) ),
inference(rename_variables,[],[i_0_24]) ).
cnf(i_0_50,plain,
( ~ labels(out,X1)
| ~ fails(X1,p4) ),
inference(scs_inference,[],[i_0_44,i_0_40,i_0_32,i_0_29,i_0_25,i_0_24,i_0_20]) ).
cnf(i_0_51,plain,
( ~ has(X1,goto(X2))
| ~ labels(X2,X3)
| ~ fails(X3,X1) ),
inference(rename_variables,[],[i_0_20]) ).
cnf(i_0_52,plain,
~ fails(p6,p3),
inference(scs_inference,[],[i_0_33,i_0_25]) ).
cnf(i_0_53,plain,
( ~ follows(X1,X2)
| ~ fails(X1,X2) ),
inference(rename_variables,[],[i_0_25]) ).
cnf(i_0_54,plain,
$false,
inference(scs_inference,[],[i_0_46,i_0_48,i_0_33,i_0_25,i_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM002-2 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n010.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 16:18:51 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 0.25/1.62 % Version : CSE_E---1.7
% 0.25/1.62 % Problem : theBenchmark.p
% 0.25/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.25/1.62 % SZS output start CNFRefutation
% See solution above
% 0.25/1.66 % Total time : 1.271s
%------------------------------------------------------------------------------