%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR017+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n014.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:53 PM UTC 2026
% Result : Theorem 4.57s 1.20s
% Output : CNFRefutation 4.57s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f70ERROR: Could not build tree for root c_7451ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X0,X1,X2] :
( ( terminates(X0,X2,X1)
& happens(X0,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(f22,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
fof(f31,axiom,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f32,axiom,
! [X0,X1] :
( less_or_equal(X0,X1)
<=> ( X0 = X1
| less(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
fof(f34,axiom,
! [X0] :
( less(X0,n1)
<=> less_or_equal(X0,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
fof(f35,axiom,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(f36,axiom,
! [X0] :
( less(X0,n3)
<=> less_or_equal(X0,n2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less3) ).
fof(f43,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( X1 != X0
& ~ less(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(f48,conjecture,
~ holdsAt(spinning,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_spinning_1) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(spinning,n1),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
holdsAt(spinning,n1),
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(f77,plain,
! [X0] :
( ( ~ less(X0,n1)
| less_or_equal(X0,n0) )
& ( ~ less_or_equal(X0,n0)
| less(X0,n1) ) ),
inference(nnf_transformation,[],[f34]) ).
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(f86,plain,
! [X0,X1,X2] :
( ( ~ sP1(X0,X1,X2)
| ( ~ happens(pull,X2)
& X1 = spinning
& X0 = push ) )
& ( happens(pull,X2)
| spinning != X1
| push != X0
| sP1(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f65]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ( ~ sP1(X0,X1,X2)
| ( ~ happens(pull,X2)
& X1 = spinning
& X0 = push ) )
& ( happens(pull,X2)
| spinning != X1
| push != X0
| sP1(X0,X1,X2) ) ),
inference(flattening,[],[f86]) ).
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(f100,plain,
! [X0,X1] :
( ( ~ less(X0,X1)
| ( X1 != X0
& ~ less(X1,X0) ) )
& ( X0 = X1
| less(X1,X0)
| less(X0,X1) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f101,plain,
! [X0,X1] :
( ( ~ less(X0,X1)
| ( X1 != X0
& ~ less(X1,X0) ) )
& ( X0 = X1
| less(X1,X0)
| less(X0,X1) ) ),
inference(flattening,[],[f100]) ).
fof(f102,plain,
! [X0] :
( ( ~ less(X0,n3)
| less_or_equal(X0,n2) )
& ( ~ less_or_equal(X0,n2)
| less(X0,n3) ) ),
inference(nnf_transformation,[],[f36]) ).
fof(f103,plain,
! [X0] :
( ( ~ less(X0,n2)
| less_or_equal(X0,n1) )
& ( ~ less_or_equal(X0,n1)
| less(X0,n2) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f104,plain,
! [X0,X1] :
( ( ~ less_or_equal(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| less_or_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f105,plain,
! [X0,X1] :
( ( ~ less_or_equal(X0,X1)
| X0 = X1
| less(X0,X1) )
& ( ( X0 != X1
& ~ less(X0,X1) )
| less_or_equal(X0,X1) ) ),
inference(flattening,[],[f104]) ).
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(spinning,n1),
inference(cnf_transformation,[],[f50]) ).
fof(f117,plain,
! [X0] :
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f120,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f128,plain,
! [X2,X0,X1] :
( ~ sP1(X0,X1,X2)
| sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f79]) ).
fof(f148,plain,
! [X2,X0,X1] :
( happens(pull,X2)
| spinning != X1
| push != X0
| sP1(X0,X1,X2) ),
inference(cnf_transformation,[],[f87]) ).
fof(f154,plain,
! [X2,X0,X1] :
( ~ sP5(X0,X1,X2)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f90]) ).
fof(f169,plain,
! [X2,X0,X1] :
( ~ terminates(X0,X2,X1)
| ~ happens(X0,X1)
| ~ holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[],[f53]) ).
fof(f180,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f101]) ).
fof(f183,plain,
! [X0] :
( ~ less(X0,n3)
| less_or_equal(X0,n2) ),
inference(cnf_transformation,[],[f102]) ).
fof(f184,plain,
! [X0] :
( ~ less_or_equal(X0,n2)
| less(X0,n3) ),
inference(cnf_transformation,[],[f102]) ).
fof(f185,plain,
! [X0] :
( ~ less(X0,n2)
| less_or_equal(X0,n1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f186,plain,
! [X0] :
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f103]) ).
fof(f188,plain,
! [X0,X1] :
( X0 != X1
| less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f189,plain,
! [X0,X1] :
( ~ less(X0,X1)
| less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f105]) ).
fof(f190,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f31]) ).
fof(f193,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f198,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| sP8(X0,X1)
| n2 = X1
| n1 = X1
| push = X0 ),
inference(cnf_transformation,[],[f107]) ).
fof(f205,plain,
! [X0,X1] :
( n0 != X1
| push != X0
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
fof(f209,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f210,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f110]) ).
fof(f220,plain,
! [X2,X1] :
( happens(pull,X2)
| spinning != X1
| sP1(push,X1,X2) ),
inference(equality_resolution,[],[f148]) ).
fof(f221,plain,
! [X2] :
( happens(pull,X2)
| sP1(push,spinning,X2) ),
inference(equality_resolution,[],[f220]) ).
fof(f230,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f180]) ).
fof(f231,plain,
! [X1] : less_or_equal(X1,X1),
inference(equality_resolution,[],[f188]) ).
fof(f232,plain,
! [X1] :
( n0 != X1
| sP9(push,X1) ),
inference(equality_resolution,[],[f205]) ).
fof(f233,plain,
sP9(push,n0),
inference(equality_resolution,[],[f232]) ).
tcf(c_53,negated_conjecture,
holdsAt(spinning,n1),
inference(cnf_transformation,[],[f115]) ).
tcf(c_54,plain,
! [X0: $i] :
( less(X0,n1)
| ~ less_or_equal(X0,n0) ),
inference(cnf_transformation,[],[f117]) ).
tcf(c_58,plain,
plus(n0,n1) = n1,
inference(cnf_transformation,[],[f120]) ).
tcf(c_66,plain,
! [X0: $i,X1: $i,X2: $i] :
( sP5(X0,X1,X2)
| ~ sP1(X0,X1,X2) ),
inference(cnf_transformation,[],[f128]) ).
tcf(c_83,plain,
! [X0: $i] :
( happens(pull,X0)
| sP1(push,spinning,X0) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_91,plain,
! [X0: $i,X1: $i,X2: $i] :
( terminates(X0,X1,X2)
| ~ sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f154]) ).
tcf(c_107,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ happens(X2,X1)
| ~ terminates(X2,X0,X1)
| ~ holdsAt(X0,plus(X1,n1)) ),
inference(cnf_transformation,[],[f169]) ).
tcf(c_120,plain,
! [X0: $i] : ~ less(X0,X0),
inference(cnf_transformation,[],[f230]) ).
tcf(c_121,plain,
! [X0: $i] :
( less(X0,n3)
| ~ less_or_equal(X0,n2) ),
inference(cnf_transformation,[],[f184]) ).
tcf(c_122,plain,
! [X0: $i] :
( less_or_equal(X0,n2)
| ~ less(X0,n3) ),
inference(cnf_transformation,[],[f183]) ).
tcf(c_123,plain,
! [X0: $i] :
( less(X0,n2)
| ~ less_or_equal(X0,n1) ),
inference(cnf_transformation,[],[f186]) ).
tcf(c_124,plain,
! [X0: $i] :
( less_or_equal(X0,n1)
| ~ less(X0,n2) ),
inference(cnf_transformation,[],[f185]) ).
tcf(c_125,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f189]) ).
tcf(c_126,plain,
! [X0: $i] : less_or_equal(X0,X0),
inference(cnf_transformation,[],[f231]) ).
tcf(c_128,plain,
! [X0: $i,X1: $i] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f190]) ).
tcf(c_131,plain,
push != pull,
inference(cnf_transformation,[],[f193]) ).
tcf(c_132,plain,
sP9(push,n0),
inference(cnf_transformation,[],[f233]) ).
tcf(c_139,plain,
! [X0: $i,X1: $i] :
( sP8(X0,X1)
| ( X1 = n2 )
| ( X1 = n1 )
| ( X0 = push )
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f198]) ).
tcf(c_147,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f210]) ).
tcf(c_148,plain,
! [X0: $i,X1: $i] :
( sP9(X0,X1)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f209]) ).
tcf(c_150,plain,
less_or_equal(n1,n1),
inference(instantiation,[status(thm)],[c_126]) ).
tcf(c_151,plain,
~ less(n1,n1),
inference(instantiation,[status(thm)],[c_120]) ).
tcf(c_157,plain,
( less(n1,n2)
| ~ less_or_equal(n1,n1) ),
inference(instantiation,[status(thm)],[c_123]) ).
tcf(c_257,plain,
! [X0: $i] :
( less(X0,n1)
| ~ less_or_equal(X0,n0) ),
inference(prop_impl_just,[status(thm)],[c_54]) ).
tcf(c_263,plain,
! [X0: $i,X1: $i] :
( ~ happens(X0,X1)
| sP9(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_148]) ).
tcf(c_264,plain,
! [X0: $i,X1: $i] :
( sP9(X0,X1)
| ~ happens(X0,X1) ),
inference(renaming,[status(thm)],[c_263]) ).
tcf(c_265,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ~ sP9(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_147]) ).
tcf(c_267,plain,
! [X0: $i] :
( ~ less(X0,n3)
| less_or_equal(X0,n2) ),
inference(prop_impl_just,[status(thm)],[c_122]) ).
tcf(c_268,plain,
! [X0: $i] :
( less_or_equal(X0,n2)
| ~ less(X0,n3) ),
inference(renaming,[status(thm)],[c_267]) ).
tcf(c_269,plain,
! [X0: $i] :
( less(X0,n3)
| ~ less_or_equal(X0,n2) ),
inference(prop_impl_just,[status(thm)],[c_121]) ).
tcf(c_271,plain,
! [X0: $i] :
( ~ less(X0,n2)
| less_or_equal(X0,n1) ),
inference(prop_impl_just,[status(thm)],[c_124]) ).
tcf(c_272,plain,
! [X0: $i] :
( less_or_equal(X0,n1)
| ~ less(X0,n2) ),
inference(renaming,[status(thm)],[c_271]) ).
tcf(c_307,plain,
! [X0: $i,X1: $i,X2: $i] :
( terminates(X0,X1,X2)
| ~ sP1(X0,X1,X2) ),
inference(prop_impl_just,[status(thm)],[c_91,c_66]) ).
tcf(c_373,plain,
! [X0: $i,X1: $i] :
( less_or_equal(X0,X1)
| ~ less(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_125]) ).
tcf(c_391,plain,
! [X0: $i] :
( sP1(push,spinning,X0)
| happens(pull,X0) ),
inference(prop_impl_just,[status(thm)],[c_83]) ).
tcf(c_392,plain,
! [X0: $i] :
( happens(pull,X0)
| sP1(push,spinning,X0) ),
inference(renaming,[status(thm)],[c_391]) ).
tcf(c_1040,plain,
plus(n1,n0) = n1,
inference(demodulation,[status(thm)],[c_58,c_128]) ).
tcf(c_1499,plain,
! [X0: $i,X1: $i] :
( less(X0,n1)
| ~ less(X1,n3)
| ( n0 != n2 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_257,c_268]) ).
tcf(c_1500,plain,
! [X0: $i] :
( less(X0,n1)
| ~ less(X0,n3)
| ( n0 != n2 ) ),
inference(unflattening,[status(thm)],[c_1499]) ).
tcf(c_1501,plain,
( less(n1,n1)
| ~ less(n1,n3)
| ( n0 != n2 ) ),
inference(instantiation,[status(thm)],[c_1500]) ).
tcf(c_1522,plain,
! [X0: $i,X1: $i] :
( less(X0,n1)
| ~ less(X1,n2)
| ( n0 != n1 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_257,c_272]) ).
tcf(c_1523,plain,
! [X0: $i] :
( less(X0,n1)
| ~ less(X0,n2)
| ( n0 != n1 ) ),
inference(unflattening,[status(thm)],[c_1522]) ).
tcf(c_1524,plain,
( less(n1,n1)
| ~ less(n1,n2)
| ( n0 != n1 ) ),
inference(instantiation,[status(thm)],[c_1523]) ).
tcf(c_1525,plain,
n0 != n1,
inference(global_subsumption_just,[status(thm)],[c_1523,c_150,c_151,c_157,c_1524]) ).
tcf(c_1583,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X0,n3)
| ~ less(X1,X2)
| ( X2 != n2 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_269,c_373]) ).
tcf(c_1584,plain,
! [X0: $i] :
( less(X0,n3)
| ~ less(X0,n2) ),
inference(unflattening,[status(thm)],[c_1583]) ).
tcf(c_1585,plain,
( less(n1,n3)
| ~ less(n1,n2) ),
inference(instantiation,[status(thm)],[c_1584]) ).
tcf(c_2390,plain,
! [X0: $i,X1: $i] :
( happens(X1,X0)
| ( X1 != push )
| ( X0 != n0 ) ),
inference(resolution_lifted,[status(thm)],[c_132,c_265]) ).
tcf(c_2391,plain,
happens(push,n0),
inference(unflattening,[status(thm)],[c_2390]) ).
tcf(c_3093,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( happens(pull,X3)
| terminates(X0,X1,X2)
| ( X2 != X3 )
| ( X1 != spinning )
| ( X0 != push ) ),
inference(resolution_lifted,[status(thm)],[c_307,c_392]) ).
tcf(c_3094,plain,
! [X0: $i] :
( happens(pull,X0)
| terminates(push,spinning,X0) ),
inference(unflattening,[status(thm)],[c_3093]) ).
tcf(c_3666,plain,
n0 != n2,
inference(global_subsumption_just,[status(thm)],[c_1500,c_150,c_151,c_157,c_1501,c_1585]) ).
tcf(c_6118,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ happens(X2,X1)
| ~ terminates(X2,X0,X1)
| ~ holdsAt(X0,plus(n1,X1)) ),
inference(superposition,[status(thm)],[c_128,c_107]) ).
tcf(c_6969,plain,
! [X0: $i,X1: $i] :
( ~ happens(X0,n0)
| ~ holdsAt(X1,n1)
| ~ terminates(X0,X1,n0) ),
inference(superposition,[status(thm)],[c_1040,c_6118]) ).
tcf(c_7037,plain,
( happens(pull,n0)
| ~ happens(push,n0)
| ~ holdsAt(spinning,n1) ),
inference(superposition,[status(thm)],[c_3094,c_6969]) ).
tcf(c_7043,plain,
happens(pull,n0),
inference(forward_subsumption_resolution,[status(thm)],[c_7037,c_2391,c_53]) ).
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(f206,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| n2 = X1 ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_146,plain,
! [X0: $i,X1: $i] :
( ( X1 = n2 )
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f206]) ).
tcf(c_237,plain,
! [X0: $i,X1: $i] :
( ~ sP9(X0,X1)
| ( X0 = push )
| ( X1 = n1 )
| ( X1 = n2 ) ),
inference(global_subsumption_just,[status(thm)],[c_139,c_146,c_139]) ).
tcf(c_238,plain,
! [X0: $i,X1: $i] :
( ( X1 = n2 )
| ( X1 = n1 )
| ( X0 = push )
| ~ sP9(X0,X1) ),
inference(renaming,[status(thm)],[c_237]) ).
tcf(c_2338,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X3 = n2 )
| ( X3 = n1 )
| ( X1 = push )
| ~ happens(X0,X2)
| ( X2 != X3 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_264,c_238]) ).
tcf(c_2339,plain,
! [X0: $i,X1: $i] :
( ( X1 = n2 )
| ( X1 = n1 )
| ( X0 = push )
| ~ happens(X0,X1) ),
inference(unflattening,[status(thm)],[c_2338]) ).
tcf(c_7445,plain,
( ( push = pull )
| ( n0 = n2 )
| ( n0 = n1 ) ),
inference(superposition,[status(thm)],[c_7043,c_2339]) ).
tcf(c_7451,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_7445,c_131,c_3666,c_1525]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR017+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.37 % Computer : n014.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:07:19 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 4.57/1.20 % SZS status Started for theBenchmark.p
% 4.57/1.20 % SZS status Theorem for theBenchmark.p
% 4.57/1.20
% 4.57/1.20 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.57/1.20
% 4.57/1.20 % ------ iProver source info
% 4.57/1.20
% 4.57/1.20 % git: date: 2026-07-19 20:42:38 +0200
% 4.57/1.20 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.57/1.20 % git: non_committed_changes: false
% 4.57/1.20
% 4.57/1.20 % ------ Parsing...
% 4.57/1.20 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 4.57/1.20
% 4.57/1.20 % ------ 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 %
% 4.57/1.20
% 4.57/1.20 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 4.57/1.20
% 4.57/1.20 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.57/1.20 % ------ Proving...
% 4.57/1.20 % ------ Problem Properties
% 4.57/1.20
% 4.57/1.20 %
% 4.57/1.20 % clauses 72
% 4.57/1.20 % conjectures 1
% 4.57/1.20 % EPR 59
% 4.57/1.20 % Horn 46
% 4.57/1.20 % unary 27
% 4.57/1.20 % binary 20
% 4.57/1.20 % lits 158
% 4.57/1.20 % lits eq 54
% 4.57/1.20 % fd_pure 0
% 4.57/1.20 % fd_pseudo 0
% 4.57/1.20 % fd_cond 21
% 4.57/1.20 % fd_pseudo_cond 1
% 4.57/1.20 % AC symbols 0
% 4.57/1.20
% 4.57/1.20 % ------ Schedule dynamic 5 is on
% 4.57/1.20
% 4.57/1.20 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.57/1.20
% 4.57/1.20
% 4.57/1.20 % ------
% 4.57/1.20 % Current options:
% 4.57/1.20 % ------
% 4.57/1.20
% 4.57/1.20
% 4.57/1.20 %
% 4.57/1.20
% 4.57/1.20 % ------ Proving...
% 4.57/1.20 %
% 4.57/1.20
% 4.57/1.20 % SZS status Theorem for theBenchmark.p
% 4.57/1.20
% 4.57/1.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.57/1.20
% 4.57/1.20
%------------------------------------------------------------------------------