%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : COM001-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n031.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:44 PM UTC 2026
% Result : Unsatisfiable 0.26s 1.62s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of clauses : 35 ( 21 unt; 0 nHn; 35 RR)
% Number of literals : 56 ( 0 equ; 25 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 : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 38 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(conditional_success,axiom,
( succeeds(X1,X2)
| ~ has(X2,ifthen(X3,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conditional_success) ).
cnf(state_3,hypothesis,
has(p3,ifthen(equal_function(register_j,n),p4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_3) ).
cnf(goto_success,axiom,
( succeeds(X1,X2)
| ~ has(X2,goto(X3))
| ~ labels(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).
cnf(transitivity_of_success,axiom,
( succeeds(X1,X2)
| ~ succeeds(X1,X3)
| ~ succeeds(X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
cnf(direct_success,axiom,
( succeeds(X1,X2)
| ~ follows(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).
cnf(prove_there_is_a_loop_through_p3,negated_conjecture,
~ succeeds(p3,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
cnf(state_8,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
cnf(state_4,hypothesis,
has(p4,goto(out)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_4) ).
cnf(label_state_3,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
cnf(transition_3_to_8,hypothesis,
follows(p8,p3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_8) ).
cnf(transition_4_to_5,hypothesis,
follows(p5,p4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_4_to_5) ).
cnf(i_0_11,axiom,
( succeeds(X1,X2)
| ~ has(X2,ifthen(X3,X1)) ),
conditional_success,
[final] ).
cnf(i_0_12,hypothesis,
has(p3,ifthen(equal_function(register_j,n),p4)),
state_3,
[final] ).
cnf(i_0_13,axiom,
( succeeds(X1,X2)
| ~ has(X2,goto(X3))
| ~ labels(X3,X1) ),
goto_success,
[final] ).
cnf(i_0_14,axiom,
( succeeds(X1,X2)
| ~ succeeds(X1,X3)
| ~ succeeds(X3,X2) ),
transitivity_of_success,
[final] ).
cnf(i_0_15,axiom,
( succeeds(X1,X2)
| ~ follows(X1,X2) ),
direct_success,
[final] ).
cnf(i_0_16,negated_conjecture,
~ succeeds(p3,p3),
prove_there_is_a_loop_through_p3,
[final] ).
cnf(i_0_17,hypothesis,
has(p8,goto(loop)),
state_8,
[final] ).
cnf(i_0_18,hypothesis,
has(p4,goto(out)),
state_4,
[final] ).
cnf(i_0_19,hypothesis,
labels(loop,p3),
label_state_3,
[final] ).
cnf(i_0_20,hypothesis,
follows(p8,p3),
transition_3_to_8,
[final] ).
cnf(i_0_21,hypothesis,
follows(p5,p4),
transition_4_to_5,
[final] ).
cnf(i_0_22,plain,
succeeds(p4,p3),
inference(scs_inference,[],[i_0_12,i_0_11]) ).
cnf(i_0_23,plain,
( ~ has(X1,ifthen(X2,X3))
| succeeds(X3,X1) ),
inference(rename_variables,[],[i_0_11]) ).
cnf(i_0_24,plain,
succeeds(p8,p3),
inference(scs_inference,[],[i_0_12,i_0_20,i_0_11,i_0_15]) ).
cnf(i_0_25,plain,
( ~ follows(X1,X2)
| succeeds(X1,X2) ),
inference(rename_variables,[],[i_0_15]) ).
cnf(i_0_26,plain,
succeeds(p3,p8),
inference(scs_inference,[],[i_0_12,i_0_19,i_0_20,i_0_17,i_0_11,i_0_15,i_0_13]) ).
cnf(i_0_27,plain,
( ~ has(X1,goto(X2))
| ~ labels(X2,X3)
| succeeds(X3,X1) ),
inference(rename_variables,[],[i_0_13]) ).
cnf(i_0_28,plain,
~ succeeds(p3,p4),
inference(scs_inference,[],[i_0_16,i_0_12,i_0_19,i_0_20,i_0_17,i_0_11,i_0_15,i_0_13,i_0_14]) ).
cnf(i_0_29,plain,
( ~ succeeds(X1,X2)
| succeeds(X3,X2)
| ~ succeeds(X3,X1) ),
inference(rename_variables,[],[i_0_14]) ).
cnf(i_0_30,plain,
succeeds(p5,p4),
inference(scs_inference,[],[i_0_21,i_0_15]) ).
cnf(i_0_31,plain,
( ~ follows(X1,X2)
| succeeds(X1,X2) ),
inference(rename_variables,[],[i_0_15]) ).
cnf(i_0_32,plain,
~ labels(out,p3),
inference(scs_inference,[],[i_0_28,i_0_21,i_0_18,i_0_15,i_0_13]) ).
cnf(i_0_33,plain,
( ~ has(X1,goto(X2))
| ~ labels(X2,X3)
| succeeds(X3,X1) ),
inference(rename_variables,[],[i_0_13]) ).
cnf(i_0_34,plain,
$false,
inference(scs_inference,[],[i_0_16,i_0_28,i_0_24,i_0_26,i_0_21,i_0_18,i_0_15,i_0_13,i_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM001-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.34 % Computer : n031.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Mon May 4 16:20:38 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 0.26/1.62 % Version : CSE_E---1.7
% 0.26/1.62 % Problem : theBenchmark.p
% 0.26/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 0.26/1.62 % SZS output start CNFRefutation
% See solution above
% 0.26/1.65 % Total time : 1.270s
%------------------------------------------------------------------------------