%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR021+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 : 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 : Fri Sep 25 01:09:54 PM UTC 2026
% Result : Theorem 3.63s 1.29s
% Output : CNFRefutation 3.63s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f70ERROR: Could not build tree for root c_6995ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1,X2] :
( ( terminates(X0,X2,X1)
& happens(X0,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
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(backwards,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_3) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(backwards,n3),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(backwards,n3),
inference(flattening,[],[f49]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ~ terminates(X0,X2,X1)
| ~ happens(X0,X1)
| ~ holdsAt(X2,plus(X1,n1)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f53,plain,
! [X0,X1,X2] :
( ~ terminates(X0,X2,X1)
| ~ happens(X0,X1)
| ~ holdsAt(X2,plus(X1,n1)) ),
inference(flattening,[],[f52]) ).
fof(f78,plain,
! [X0,X1,X2] :
( ( ~ sP5(X0,X1,X2)
| sP0(X0,X1,X2)
| sP1(X0,X1,X2)
| sP2(X0,X1,X2)
| sP3(X0,X1,X2)
| sP4(X0,X1,X2)
| ( ~ happens(pull,X2)
& X1 = backwards
& X0 = push ) )
& ( ( ~ sP0(X0,X1,X2)
& ~ sP1(X0,X1,X2)
& ~ sP2(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP4(X0,X1,X2)
& ( happens(pull,X2)
| backwards != X1
| push != X0 ) )
| sP5(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f69]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( ~ sP5(X0,X1,X2)
| sP0(X0,X1,X2)
| sP1(X0,X1,X2)
| sP2(X0,X1,X2)
| sP3(X0,X1,X2)
| sP4(X0,X1,X2)
| ( ~ happens(pull,X2)
& X1 = backwards
& X0 = push ) )
& ( ( ~ sP0(X0,X1,X2)
& ~ sP1(X0,X1,X2)
& ~ sP2(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP4(X0,X1,X2)
& ( happens(pull,X2)
| backwards != X1
| push != X0 ) )
| sP5(X0,X1,X2) ) ),
inference(flattening,[],[f78]) ).
fof(f84,plain,
! [X0,X1,X2] :
( ( ~ sP2(X0,X1,X2)
| ( happens(push,X2)
& X1 = backwards
& X0 = pull ) )
& ( ~ happens(push,X2)
| backwards != X1
| pull != X0
| sP2(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f66]) ).
fof(f85,plain,
! [X0,X1,X2] :
( ( ~ sP2(X0,X1,X2)
| ( happens(push,X2)
& X1 = backwards
& X0 = pull ) )
& ( ~ happens(push,X2)
| backwards != X1
| pull != X0
| sP2(X0,X1,X2) ) ),
inference(flattening,[],[f84]) ).
fof(f90,plain,
! [X0,X1,X2] :
( ( ~ terminates(X0,X1,X2)
| sP5(X0,X1,X2) )
& ( ~ sP5(X0,X1,X2)
| terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f70]) ).
fof(f106,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,[],[f75]) ).
fof(f107,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,[],[f106]) ).
fof(f110,plain,
! [X0,X1] :
( ( ~ happens(X0,X1)
| sP9(X0,X1) )
& ( ~ sP9(X0,X1)
| happens(X0,X1) ) ),
inference(nnf_transformation,[],[f76]) ).
fof(f115,plain,
holdsAt(backwards,n3),
inference(cnf_transformation,[],[f50]) ).
fof(f130,plain,
! [X2,X0,X1] :
( ~ sP2(X0,X1,X2)
| sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f145,plain,
! [X2,X0,X1] :
( ~ happens(push,X2)
| backwards != X1
| pull != X0
| sP2(X0,X1,X2) ),
inference(cnf_transformation,[],[f85]) ).
fof(f155,plain,
! [X2,X0,X1] :
( ~ sP5(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f90]) ).
fof(f170,plain,
! [X2,X0,X1] :
( ~ terminates(X0,X2,X1)
| ~ happens(X0,X1)
| ~ holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[],[f53]) ).
fof(f183,plain,
n3 = plus(n1,n2),
inference(cnf_transformation,[],[f26]) ).
fof(f192,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f31]) ).
fof(f203,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
fof(f204,plain,
! [X0,X1] :
( n2 != X1
| pull != X0
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
fof(f211,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f218,plain,
! [X2,X1] :
( ~ happens(push,X2)
| backwards != X1
| sP2(pull,X1,X2) ),
inference(equality_resolution,[],[f145]) ).
fof(f219,plain,
! [X2] :
( ~ happens(push,X2)
| sP2(pull,backwards,X2) ),
inference(equality_resolution,[],[f218]) ).
fof(f236,plain,
! [X1] :
( n2 != X1
| sP9(pull,X1) ),
inference(equality_resolution,[],[f204]) ).
fof(f237,plain,
sP9(pull,n2),
inference(equality_resolution,[],[f236]) ).
tcf(c_53,negated_conjecture,
holdsAt(backwards,n3),
inference(cnf_transformation,[],[f115]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( sP5(X0,X1,X2)
| ~ sP2(X0,X1,X2) ),
inference(cnf_transformation,[],[f130]) ).
tcf(c_80,plain,
! [X0: $i] :
( sP2(pull,backwards,X0)
| ~ happens(push,X0) ),
inference(cnf_transformation,[],[f219]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i,X2: $i] :
( terminates(X0,X1,X2)
| ~ sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f155]) ).
tcf(c_108,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ happens(X2,X1)
| ~ terminates(X2,X0,X1)
| ~ holdsAt(X0,plus(X1,n1)) ),
inference(cnf_transformation,[],[f170]) ).
tcf(c_121,plain,
plus(n1,n2) = n3,
inference(cnf_transformation,[],[f183]) ).
tcf(c_130,plain,
! [X0: $i,X1: $i] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f192]) ).
tcf(c_135,plain,
sP9(pull,n2),
inference(cnf_transformation,[],[f237]) ).
tcf(c_136,plain,
! [X0: $i,X1: $i] :
( sP9(X0,X1)
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f203]) ).
tcf(c_148,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f211]) ).
tcf(c_265,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ~ sP9(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_148]) ).
tcf(c_299,plain,
! [X0: $i,X1: $i,X2: $i] :
( terminates(X0,X1,X2)
| ~ sP2(X0,X1,X2) ),
inference(prop_impl_just,[status(thm)],[c_92,c_66]) ).
tcf(c_325,plain,
! [X0: $i] :
( sP2(pull,backwards,X0)
| ~ happens(push,X0) ),
inference(prop_impl_just,[status(thm)],[c_80]) ).
tcf(c_381,plain,
! [X0: $i,X1: $i] :
( sP9(X0,X1)
| ~ sP8(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_136]) ).
tcf(c_2416,plain,
! [X0: $i,X1: $i] :
( happens(X1,X0)
| ( X1 != pull )
| ( X0 != n2 ) ),
inference(resolution_lifted,[status(thm)],[c_135,c_265]) ).
tcf(c_2417,plain,
happens(pull,n2),
inference(unflattening,[status(thm)],[c_2416]) ).
tcf(c_3206,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( terminates(X0,X1,X2)
| ~ happens(push,X3)
| ( X2 != X3 )
| ( X1 != backwards )
| ( X0 != pull ) ),
inference(resolution_lifted,[status(thm)],[c_299,c_325]) ).
tcf(c_3207,plain,
! [X0: $i] :
( terminates(pull,backwards,X0)
| ~ happens(push,X0) ),
inference(unflattening,[status(thm)],[c_3206]) ).
tcf(c_6102,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ happens(X2,X1)
| ~ terminates(X2,X0,X1)
| ~ holdsAt(X0,plus(n1,X1)) ),
inference(superposition,[status(thm)],[c_130,c_108]) ).
tcf(c_6969,plain,
! [X0: $i,X1: $i] :
( ~ happens(X0,n2)
| ~ holdsAt(X1,n3)
| ~ terminates(X0,X1,n2) ),
inference(superposition,[status(thm)],[c_121,c_6102]) ).
tcf(c_6991,plain,
( ~ happens(pull,n2)
| ~ happens(push,n2)
| ~ holdsAt(backwards,n3) ),
inference(superposition,[status(thm)],[c_3207,c_6969]) ).
fof(f74,definition,
! [X0,X1] :
( sP8(X0,X1)
<=> ( X1 = n2
& X0 = push ) ),
introduced(definition,[new_symbols(definition,[sP8])],[predicate_definition_introduction]) ).
fof(f75,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(f76,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP9(X0,X1) ),
inference(definition_folding,[],[f16,f75,f74]) ).
fof(f108,plain,
! [X0,X1] :
( ( ~ sP8(X0,X1)
| ( X1 = n2
& X0 = push ) )
& ( n2 != X1
| push != X0
| sP8(X0,X1) ) ),
inference(nnf_transformation,[],[f74]) ).
fof(f109,plain,
! [X0,X1] :
( ( ~ sP8(X0,X1)
| ( X1 = n2
& X0 = push ) )
& ( n2 != X1
| push != X0
| sP8(X0,X1) ) ),
inference(flattening,[],[f108]) ).
fof(f209,plain,
! [X0,X1] :
( n2 != X1
| push != X0
| sP8(X0,X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f238,plain,
! [X1] :
( n2 != X1
| sP8(push,X1) ),
inference(equality_resolution,[],[f209]) ).
fof(f239,plain,
sP8(push,n2),
inference(equality_resolution,[],[f238]) ).
tcf(c_145,plain,
sP8(push,n2),
inference(cnf_transformation,[],[f239]) ).
tcf(c_1371,plain,
! [X0: $i,X1: $i] :
( sP9(X0,X1)
| ( X1 != n2 )
| ( X0 != push ) ),
inference(resolution_lifted,[status(thm)],[c_381,c_145]) ).
tcf(c_1372,plain,
sP9(push,n2),
inference(unflattening,[status(thm)],[c_1371]) ).
tcf(c_2429,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ( X1 != n2 )
| ( X0 != push ) ),
inference(resolution_lifted,[status(thm)],[c_265,c_1372]) ).
tcf(c_2430,plain,
happens(push,n2),
inference(unflattening,[status(thm)],[c_2429]) ).
tcf(c_6995,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6991,c_2417,c_2430,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR021+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.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Fri Sep 25 08:04:53 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/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...
% 3.63/1.29 % SZS status Started for theBenchmark.p
% 3.63/1.29 % SZS status Theorem for theBenchmark.p
% 3.63/1.29
% 3.63/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.63/1.29
% 3.63/1.29 % ------ iProver source info
% 3.63/1.29
% 3.63/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 3.63/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.63/1.29 % git: non_committed_changes: false
% 3.63/1.29
% 3.63/1.29 % ------ Parsing...
% 3.63/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.63/1.29
% 3.63/1.29 % ------ Preprocessing... sup_sim: 1 sf_s rm: 2 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: 10 0s sf_e pe_s pe_e %
% 3.63/1.29
% 3.63/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.63/1.29
% 3.63/1.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.63/1.29 % ------ Proving...
% 3.63/1.29 % ------ Problem Properties
% 3.63/1.29
% 3.63/1.29 %
% 3.63/1.29 % clauses 72
% 3.63/1.29 % conjectures 1
% 3.63/1.29 % EPR 59
% 3.63/1.29 % Horn 46
% 3.63/1.29 % unary 27
% 3.63/1.29 % binary 20
% 3.63/1.29 % lits 158
% 3.63/1.29 % lits eq 54
% 3.63/1.29 % fd_pure 0
% 3.63/1.29 % fd_pseudo 0
% 3.63/1.29 % fd_cond 21
% 3.63/1.29 % fd_pseudo_cond 1
% 3.63/1.29 % AC symbols 0
% 3.63/1.29
% 3.63/1.29 % ------ Schedule dynamic 5 is on
% 3.63/1.29
% 3.63/1.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.63/1.29
% 3.63/1.29
% 3.63/1.29 % ------
% 3.63/1.29 % Current options:
% 3.63/1.29 % ------
% 3.63/1.29
% 3.63/1.29
% 3.63/1.29 %
% 3.63/1.29
% 3.63/1.29 % ------ Proving...
% 3.63/1.29 %
% 3.63/1.29
% 3.63/1.29 % SZS status Theorem for theBenchmark.p
% 3.63/1.29
% 3.63/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.63/1.30
% 3.63/1.30
%------------------------------------------------------------------------------