%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR023+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n006.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 : Fri Sep 25 01:09:54 PM UTC 2026
% Result : Theorem 2.93s 1.09s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 65 ( 20 unt; 4 def)
% Number of atoms : 226 ( 97 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 256 ( 95 ~; 96 |; 56 &)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 103 ( 0 sgn 103 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X0,X1,X2] :
( ( initiates(X0,X2,X1)
& happens(X0,X1) )
=> holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_holds) ).
fof(f13,axiom,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( happens(push,X2)
& X1 = spinning
& X0 = pull )
| ( ~ happens(push,X2)
& X1 = backwards
& X0 = pull )
| ( ~ happens(pull,X2)
& X1 = forwards
& X0 = push ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',initiates_all_defn) ).
fof(f16,axiom,
! [X0,X1] :
( happens(X0,X1)
<=> ( ( X1 = n2
& X0 = push )
| ( X1 = n2
& X0 = pull )
| ( X1 = n1
& X0 = pull )
| ( X1 = n0
& X0 = push ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(f26,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).
fof(f31,axiom,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f48,conjecture,
holdsAt(spinning,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',spinning_3) ).
fof(f49,negated_conjecture,
~ holdsAt(spinning,n3),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
~ holdsAt(spinning,n3),
inference(flattening,[],[f49]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ~ initiates(X0,X2,X1)
| ~ happens(X0,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(ennf_transformation,[],[f9]) ).
fof(f66,plain,
! [X0,X1,X2] :
( ~ initiates(X0,X2,X1)
| ~ happens(X0,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(flattening,[],[f65]) ).
fof(f95,plain,
! [X0,X1,X2] :
( ( ~ initiates(X0,X1,X2)
| sP0(X0,X1,X2)
| sP1(X0,X1,X2)
| ( ~ happens(pull,X2)
& X1 = forwards
& X0 = push ) )
& ( ( ~ sP0(X0,X1,X2)
& ~ sP1(X0,X1,X2)
& ( happens(pull,X2)
| forwards != X1
| push != X0 ) )
| initiates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f76]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ( ~ initiates(X0,X1,X2)
| sP0(X0,X1,X2)
| sP1(X0,X1,X2)
| ( ~ happens(pull,X2)
& X1 = forwards
& X0 = push ) )
& ( ( ~ sP0(X0,X1,X2)
& ~ sP1(X0,X1,X2)
& ( happens(pull,X2)
| forwards != X1
| push != X0 ) )
| initiates(X0,X1,X2) ) ),
inference(flattening,[],[f95]) ).
fof(f110,plain,
! [X0,X1] :
( ( ~ sP9(X0,X1)
| sP8(X0,X1)
| ( X1 = n2
& X0 = pull )
| ( X1 = n1
& X0 = pull )
| ( X1 = n0
& X0 = push ) )
& ( ( ~ sP8(X0,X1)
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ( n0 != X1
| push != X0 ) )
| sP9(X0,X1) ) ),
inference(nnf_transformation,[],[f85]) ).
fof(f111,plain,
! [X0,X1] :
( ( ~ sP9(X0,X1)
| sP8(X0,X1)
| ( X1 = n2
& X0 = pull )
| ( X1 = n1
& X0 = pull )
| ( X1 = n0
& X0 = push ) )
& ( ( ~ sP8(X0,X1)
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ( n0 != X1
| push != X0 ) )
| sP9(X0,X1) ) ),
inference(flattening,[],[f110]) ).
fof(f114,plain,
! [X0,X1] :
( ( ~ happens(X0,X1)
| sP9(X0,X1) )
& ( ~ sP9(X0,X1)
| happens(X0,X1) ) ),
inference(nnf_transformation,[],[f86]) ).
fof(f136,plain,
! [X2,X0,X1] :
( ~ initiates(X0,X2,X1)
| ~ happens(X0,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[],[f66]) ).
fof(f152,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| initiates(X0,X1,X2) ),
inference(cnf_transformation,[],[f96]) ).
fof(f195,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f196,plain,
! [X0,X1] :
( n2 != X1
| pull != X0
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f203,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f213,plain,
n3 = plus(n1,n2),
inference(cnf_transformation,[],[f26]) ).
fof(f218,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f31]) ).
fof(f248,plain,
~ holdsAt(spinning,n3),
inference(cnf_transformation,[],[f50]) ).
fof(f271,plain,
! [X1] :
( n2 != X1
| sP9(pull,X1) ),
inference(equality_resolution,[],[f196]) ).
fof(f272,plain,
sP9(pull,n2),
inference(equality_resolution,[],[f271]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( holdsAt(X1,plus(X2,n1))
| ~ happens(X0,X2)
| ~ initiates(X0,X1,X2) ),
inference(cnf_transformation,[],[f136]) ).
tcf(c_72,plain,
! [X0: $i,X1: $i,X2: $i] :
( initiates(X0,X1,X2)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f152]) ).
tcf(c_110,plain,
sP9(pull,n2),
inference(cnf_transformation,[],[f272]) ).
tcf(c_111,plain,
! [X0: $i,X1: $i] :
( sP9(X0,X1)
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f195]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f203]) ).
tcf(c_134,plain,
plus(n1,n2) = n3,
inference(cnf_transformation,[],[f213]) ).
tcf(c_139,plain,
! [X0: $i,X1: $i] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f218]) ).
tcf(c_169,negated_conjecture,
~ holdsAt(spinning,n3),
inference(cnf_transformation,[],[f248]) ).
tcf(c_300,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ~ sP9(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
tcf(c_444,plain,
! [X0: $i,X1: $i] :
( sP9(X0,X1)
| ~ sP8(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_111]) ).
tcf(c_2479,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ( X1 != n2 )
| ( X0 != pull ) ),
inference(resolution_lifted,[status(thm)],[c_110,c_300]) ).
tcf(c_2480,plain,
happens(pull,n2),
inference(unflattening,[status(thm)],[c_2479]) ).
tcf(c_7715,negated_conjecture,
~ holdsAt(spinning,n3),
inference(demodulation,[status(thm)],[c_169]) ).
fof(f74,definition,
! [X0,X1,X2] :
( sP0(X0,X1,X2)
<=> ( happens(push,X2)
& X1 = spinning
& X0 = pull ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f75,definition,
! [X0,X1,X2] :
( sP1(X0,X1,X2)
<=> ( ~ happens(push,X2)
& X1 = backwards
& X0 = pull ) ),
introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).
fof(f76,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( sP0(X0,X1,X2)
| sP1(X0,X1,X2)
| ( ~ happens(pull,X2)
& X1 = forwards
& X0 = push ) ) ),
inference(definition_folding,[],[f13,f75,f74]) ).
fof(f84,definition,
! [X0,X1] :
( sP8(X0,X1)
<=> ( X1 = n2
& X0 = push ) ),
introduced(definition,[new_symbols(definition,[sP8])],[predicate_definition_introduction]) ).
fof(f85,definition,
! [X0,X1] :
( sP9(X0,X1)
<=> ( sP8(X0,X1)
| ( X1 = n2
& X0 = pull )
| ( X1 = n1
& X0 = pull )
| ( X1 = n0
& X0 = push ) ) ),
introduced(definition,[new_symbols(definition,[sP9])],[predicate_definition_introduction]) ).
fof(f86,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP9(X0,X1) ),
inference(definition_folding,[],[f16,f85,f84]) ).
fof(f93,plain,
! [X0,X1,X2] :
( ( ~ sP0(X0,X1,X2)
| ( happens(push,X2)
& X1 = spinning
& X0 = pull ) )
& ( ~ happens(push,X2)
| spinning != X1
| pull != X0
| sP0(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f74]) ).
fof(f94,plain,
! [X0,X1,X2] :
( ( ~ sP0(X0,X1,X2)
| ( happens(push,X2)
& X1 = spinning
& X0 = pull ) )
& ( ~ happens(push,X2)
| spinning != X1
| pull != X0
| sP0(X0,X1,X2) ) ),
inference(flattening,[],[f93]) ).
fof(f112,plain,
! [X0,X1] :
( ( ~ sP8(X0,X1)
| ( X1 = n2
& X0 = push ) )
& ( n2 != X1
| push != X0
| sP8(X0,X1) ) ),
inference(nnf_transformation,[],[f84]) ).
fof(f113,plain,
! [X0,X1] :
( ( ~ sP8(X0,X1)
| ( X1 = n2
& X0 = push ) )
& ( n2 != X1
| push != X0
| sP8(X0,X1) ) ),
inference(flattening,[],[f112]) ).
fof(f148,plain,
! [X2,X0,X1] :
( ~ happens(push,X2)
| spinning != X1
| pull != X0
| sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f94]) ).
fof(f201,plain,
! [X0,X1] :
( n2 != X1
| push != X0
| sP8(X0,X1) ),
inference(cnf_transformation,[],[f113]) ).
fof(f251,plain,
! [X2,X1] :
( ~ happens(push,X2)
| spinning != X1
| sP0(pull,X1,X2) ),
inference(equality_resolution,[],[f148]) ).
fof(f252,plain,
! [X2] :
( ~ happens(push,X2)
| sP0(pull,spinning,X2) ),
inference(equality_resolution,[],[f251]) ).
fof(f273,plain,
! [X1] :
( n2 != X1
| sP8(push,X1) ),
inference(equality_resolution,[],[f201]) ).
fof(f274,plain,
sP8(push,n2),
inference(equality_resolution,[],[f273]) ).
tcf(c_66,plain,
! [X0: $i] :
( sP0(pull,spinning,X0)
| ~ happens(push,X0) ),
inference(cnf_transformation,[],[f252]) ).
tcf(c_120,plain,
sP8(push,n2),
inference(cnf_transformation,[],[f274]) ).
tcf(c_1606,plain,
! [X0: $i,X1: $i] :
( sP9(X0,X1)
| ( X1 != n2 )
| ( X0 != push ) ),
inference(resolution_lifted,[status(thm)],[c_444,c_120]) ).
tcf(c_1607,plain,
sP9(push,n2),
inference(unflattening,[status(thm)],[c_1606]) ).
tcf(c_2492,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ( X1 != n2 )
| ( X0 != push ) ),
inference(resolution_lifted,[status(thm)],[c_300,c_1607]) ).
tcf(c_2493,plain,
happens(push,n2),
inference(unflattening,[status(thm)],[c_2492]) ).
tcf(c_9496,plain,
! [X0: $i] :
( initiates(pull,spinning,X0)
| ~ happens(push,X0) ),
inference(superposition,[status(thm)],[c_66,c_72]) ).
tcf(c_10011,plain,
! [X0: $i] :
( holdsAt(spinning,plus(X0,n1))
| ~ happens(push,X0)
| ~ happens(pull,X0) ),
inference(superposition,[status(thm)],[c_9496,c_57]) ).
tcf(c_18094,plain,
! [X0: $i] :
( holdsAt(spinning,plus(n1,X0))
| ~ happens(push,X0)
| ~ happens(pull,X0) ),
inference(superposition,[status(thm)],[c_139,c_10011]) ).
tcf(c_18135,plain,
( holdsAt(spinning,n3)
| ~ happens(push,n2)
| ~ happens(pull,n2) ),
inference(superposition,[status(thm)],[c_134,c_18094]) ).
tcf(c_18154,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_18135,c_7715,c_2493,c_2480]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : CSR023+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 08:07:41 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.42
% 0.14/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.42
% 0.14/0.42 % Detected problem language: tptp
% 0.14/0.43 % Proving...
% 2.93/1.09 % SZS status Started for theBenchmark.p
% 2.93/1.09 % SZS status Theorem for theBenchmark.p
% 2.93/1.09
% 2.93/1.09 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.93/1.09
% 2.93/1.09 % ------ iProver source info
% 2.93/1.09
% 2.93/1.09 % git: date: 2026-07-19 20:42:38 +0200
% 2.93/1.09 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.93/1.09 % git: non_committed_changes: false
% 2.93/1.09
% 2.93/1.09 % ------ Parsing...
% 2.93/1.09 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.93/1.09
% 2.93/1.09 % ------ Preprocessing... sup_sim: 2 sf_s rm: 3 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 sf_s rm: 9 0s sf_e pe_s pe_e %
% 2.93/1.09
% 2.93/1.09 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.93/1.09
% 2.93/1.09 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.93/1.09 % ------ Proving...
% 2.93/1.09 % ------ Problem Properties
% 2.93/1.09
% 2.93/1.09 %
% 2.93/1.09 % clauses 85
% 2.93/1.09 % conjectures 1
% 2.93/1.09 % EPR 68
% 2.93/1.09 % Horn 60
% 2.93/1.09 % unary 27
% 2.93/1.09 % binary 35
% 2.93/1.09 % lits 182
% 2.93/1.09 % lits eq 53
% 2.93/1.09 % fd_pure 0
% 2.93/1.09 % fd_pseudo 0
% 2.93/1.09 % fd_cond 18
% 2.93/1.09 % fd_pseudo_cond 2
% 2.93/1.09 % AC symbols 0
% 2.93/1.09
% 2.93/1.09 % ------ Schedule dynamic 5 is on
% 2.93/1.09
% 2.93/1.09 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.93/1.09
% 2.93/1.09
% 2.93/1.09 % ------
% 2.93/1.09 % Current options:
% 2.93/1.09 % ------
% 2.93/1.09
% 2.93/1.09
% 2.93/1.09 %
% 2.93/1.09
% 2.93/1.09 % ------ Proving...
% 2.93/1.09 %
% 2.93/1.09
% 2.93/1.09 % SZS status Theorem for theBenchmark.p
% 2.93/1.09
% 2.93/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.93/1.09
% 2.93/1.09
%------------------------------------------------------------------------------