%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : CSR018+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 : n017.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 1.48s 1.40s
% Output : CNFRefutation 1.48s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f75ERROR: Could not build tree for root c_17854ERROR: MakeTreeStats fails)
% 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(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(f17,axiom,
push != pull,
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
fof(f25,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_1) ).
fof(f32,axiom,
! [X0,X1] :
( less_or_equal(X0,X1)
<=> ( X0 = X1
| less(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).
fof(f34,axiom,
! [X0] :
( less(X0,n1)
<=> less_or_equal(X0,n0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).
fof(f35,axiom,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).
fof(f43,axiom,
! [X0,X1] :
( less(X0,X1)
<=> ( X1 != X0
& ~ less(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).
fof(f48,conjecture,
holdsAt(backwards,n2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',backwards_2) ).
fof(f49,negated_conjecture,
~ holdsAt(backwards,n2),
inference(negated_conjecture,[status(cth)],[f48]) ).
fof(f50,plain,
~ holdsAt(backwards,n2),
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(f91,plain,
! [X0,X1,X2] :
( ( ~ sP1(X0,X1,X2)
| ( ~ happens(push,X2)
& X1 = backwards
& X0 = pull ) )
& ( happens(push,X2)
| backwards != X1
| pull != X0
| sP1(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f75]) ).
fof(f92,plain,
! [X0,X1,X2] :
( ( ~ sP1(X0,X1,X2)
| ( ~ happens(push,X2)
& X1 = backwards
& X0 = pull ) )
& ( happens(push,X2)
| backwards != X1
| pull != X0
| sP1(X0,X1,X2) ) ),
inference(flattening,[],[f91]) ).
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(f115,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(f116,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,[],[f115]) ).
fof(f117,plain,
! [X0] :
( ( ~ less(X0,n1)
| less_or_equal(X0,n0) )
& ( ~ less_or_equal(X0,n0)
| less(X0,n1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f118,plain,
! [X0] :
( ( ~ less(X0,n2)
| less_or_equal(X0,n1) )
& ( ~ less_or_equal(X0,n1)
| less(X0,n2) ) ),
inference(nnf_transformation,[],[f35]) ).
fof(f126,plain,
! [X0,X1] :
( ( ~ less(X0,X1)
| ( X1 != X0
& ~ less(X1,X0) ) )
& ( X0 = X1
| less(X1,X0)
| less(X0,X1) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f127,plain,
! [X0,X1] :
( ( ~ less(X0,X1)
| ( X1 != X0
& ~ less(X1,X0) ) )
& ( X0 = X1
| less(X1,X0)
| less(X0,X1) ) ),
inference(flattening,[],[f126]) ).
fof(f136,plain,
! [X2,X0,X1] :
( ~ initiates(X0,X2,X1)
| ~ happens(X0,X1)
| holdsAt(X2,plus(X1,n1)) ),
inference(cnf_transformation,[],[f66]) ).
fof(f144,plain,
! [X2,X0,X1] :
( happens(push,X2)
| backwards != X1
| pull != X0
| sP1(X0,X1,X2) ),
inference(cnf_transformation,[],[f92]) ).
fof(f153,plain,
! [X2,X0,X1] :
( ~ sP1(X0,X1,X2)
| initiates(X0,X1,X2) ),
inference(cnf_transformation,[],[f96]) ).
fof(f189,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| sP8(X0,X1)
| n2 = X1
| pull = X0
| n0 = X1 ),
inference(cnf_transformation,[],[f111]) ).
fof(f193,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| sP8(X0,X1)
| n2 = X1
| pull = X0
| push = X0 ),
inference(cnf_transformation,[],[f111]) ).
fof(f197,plain,
! [X0,X1] :
( n1 != X1
| pull != X0
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
fof(f202,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f203,plain,
! [X0,X1] :
( ~ sP9(X0,X1)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f114]) ).
fof(f204,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f212,plain,
n2 = plus(n1,n1),
inference(cnf_transformation,[],[f25]) ).
fof(f220,plain,
! [X0,X1] :
( X0 != X1
| less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f116]) ).
fof(f224,plain,
! [X0] :
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(cnf_transformation,[],[f117]) ).
fof(f225,plain,
! [X0] :
( ~ less(X0,n2)
| less_or_equal(X0,n1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f226,plain,
! [X0] :
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f118]) ).
fof(f241,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f127]) ).
fof(f248,plain,
~ holdsAt(backwards,n2),
inference(cnf_transformation,[],[f50]) ).
fof(f249,plain,
! [X2,X1] :
( happens(push,X2)
| backwards != X1
| sP1(pull,X1,X2) ),
inference(equality_resolution,[],[f144]) ).
fof(f250,plain,
! [X2] :
( happens(push,X2)
| sP1(pull,backwards,X2) ),
inference(equality_resolution,[],[f249]) ).
fof(f269,plain,
! [X1] :
( n1 != X1
| sP9(pull,X1) ),
inference(equality_resolution,[],[f197]) ).
fof(f270,plain,
sP9(pull,n1),
inference(equality_resolution,[],[f269]) ).
fof(f275,plain,
! [X1] : less_or_equal(X1,X1),
inference(equality_resolution,[],[f220]) ).
fof(f276,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f241]) ).
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_62,plain,
! [X0: $i] :
( happens(push,X0)
| sP1(pull,backwards,X0) ),
inference(cnf_transformation,[],[f250]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i,X2: $i] :
( initiates(X0,X1,X2)
| ~ sP1(X0,X1,X2) ),
inference(cnf_transformation,[],[f153]) ).
tcf(c_109,plain,
sP9(pull,n1),
inference(cnf_transformation,[],[f270]) ).
tcf(c_112,plain,
! [X0: $i,X1: $i] :
( sP8(X0,X1)
| ( X0 = push )
| ( X0 = pull )
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f277]) ).
tcf(c_113,plain,
! [X0: $i,X1: $i] :
( sP8(X0,X1)
| ( X1 = n2 )
| ( X0 = push )
| ( X0 = pull )
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f193]) ).
tcf(c_116,plain,
! [X0: $i,X1: $i] :
( sP8(X0,X1)
| ( X1 = n0 )
| ( X0 = pull )
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f278]) ).
tcf(c_117,plain,
! [X0: $i,X1: $i] :
( sP8(X0,X1)
| ( X1 = n2 )
| ( X1 = n0 )
| ( X0 = pull )
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f189]) ).
tcf(c_123,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f203]) ).
tcf(c_124,plain,
! [X0: $i,X1: $i] :
( sP9(X0,X1)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f202]) ).
tcf(c_125,plain,
pull != push,
inference(cnf_transformation,[],[f204]) ).
tcf(c_133,plain,
plus(n1,n1) = n2,
inference(cnf_transformation,[],[f212]) ).
tcf(c_141,plain,
! [X0: $i] : less_or_equal(X0,X0),
inference(cnf_transformation,[],[f275]) ).
tcf(c_144,plain,
! [X0: $i] :
( less(X0,n1)
| ~ less_or_equal(X0,n0) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_146,plain,
! [X0: $i] :
( less(X0,n2)
| ~ less_or_equal(X0,n1) ),
inference(cnf_transformation,[],[f226]) ).
tcf(c_147,plain,
! [X0: $i] :
( less_or_equal(X0,n1)
| ~ less(X0,n2) ),
inference(cnf_transformation,[],[f225]) ).
tcf(c_164,plain,
! [X0: $i] : ~ less(X0,X0),
inference(cnf_transformation,[],[f276]) ).
tcf(c_169,negated_conjecture,
~ holdsAt(backwards,n2),
inference(cnf_transformation,[],[f248]) ).
tcf(c_170,plain,
less_or_equal(n1,n1),
inference(instantiation,[status(thm)],[c_141]) ).
tcf(c_172,plain,
~ less(n1,n1),
inference(instantiation,[status(thm)],[c_164]) ).
tcf(c_189,plain,
( less(n1,n2)
| ~ less_or_equal(n1,n1) ),
inference(instantiation,[status(thm)],[c_146]) ).
tcf(c_278,plain,
! [X0: $i,X1: $i] :
( sP8(X0,X1)
| ~ sP9(X0,X1)
| ( X0 = pull )
| ( X1 = n0 ) ),
inference(global_subsumption_just,[status(thm)],[c_117,c_116]) ).
tcf(c_279,plain,
! [X0: $i,X1: $i] :
( sP8(X0,X1)
| ( X1 = n0 )
| ( X0 = pull )
| ~ sP9(X0,X1) ),
inference(renaming,[status(thm)],[c_278]) ).
tcf(c_298,plain,
! [X0: $i,X1: $i] :
( ~ happens(X0,X1)
| sP9(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_124]) ).
tcf(c_299,plain,
! [X0: $i,X1: $i] :
( sP9(X0,X1)
| ~ happens(X0,X1) ),
inference(renaming,[status(thm)],[c_298]) ).
tcf(c_300,plain,
! [X0: $i,X1: $i] :
( happens(X0,X1)
| ~ sP9(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
tcf(c_306,plain,
! [X0: $i] :
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(prop_impl_just,[status(thm)],[c_144]) ).
tcf(c_307,plain,
! [X0: $i] :
( less(X0,n1)
| ~ less_or_equal(X0,n0) ),
inference(renaming,[status(thm)],[c_306]) ).
tcf(c_312,plain,
! [X0: $i] :
( less_or_equal(X0,n1)
| ~ less(X0,n2) ),
inference(prop_impl_just,[status(thm)],[c_147]) ).
tcf(c_2466,plain,
! [X0: $i,X1: $i] :
( happens(X1,X0)
| ( X1 != pull )
| ( X0 != n1 ) ),
inference(resolution_lifted,[status(thm)],[c_109,c_300]) ).
tcf(c_2467,plain,
happens(pull,n1),
inference(unflattening,[status(thm)],[c_2466]) ).
tcf(c_3637,plain,
! [X0: $i,X1: $i] :
( less(X0,n1)
| ~ less(X1,n2)
| ( n1 != n0 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_307,c_312]) ).
tcf(c_3638,plain,
! [X0: $i] :
( less(X0,n1)
| ~ less(X0,n2)
| ( n1 != n0 ) ),
inference(unflattening,[status(thm)],[c_3637]) ).
tcf(c_3639,plain,
( less(n1,n1)
| ~ less(n1,n2)
| ( n1 != n0 ) ),
inference(instantiation,[status(thm)],[c_3638]) ).
tcf(c_7715,negated_conjecture,
~ holdsAt(backwards,n2),
inference(demodulation,[status(thm)],[c_169]) ).
tcf(c_7718,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X2 = X0 )
| ( X2 != X1 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_7727,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X2,X0)
| ~ less(X2,X1)
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_9501,plain,
! [X0: $i] :
( happens(push,X0)
| initiates(pull,backwards,X0) ),
inference(superposition,[status(thm)],[c_62,c_71]) ).
tcf(c_9959,plain,
! [X0: $i] :
( happens(push,X0)
| holdsAt(backwards,plus(X0,n1))
| ~ happens(pull,X0) ),
inference(superposition,[status(thm)],[c_9501,c_57]) ).
tcf(c_10061,plain,
! [X0: $i] :
( ( pull = push )
| ( push != X0 )
| ( pull != X0 ) ),
inference(instantiation,[status(thm)],[c_7718]) ).
tcf(c_10087,plain,
! [X0: $i,X1: $i] :
( less(X1,X0)
| ~ less(X1,n2)
| ( X0 != n2 ) ),
inference(instantiation,[status(thm)],[c_7727]) ).
tcf(c_10088,plain,
( less(n1,n1)
| ~ less(n1,n2)
| ( n1 != n2 ) ),
inference(instantiation,[status(thm)],[c_10087]) ).
tcf(c_13538,plain,
( ( pull = push )
| ( push != pull )
| ( pull != pull ) ),
inference(instantiation,[status(thm)],[c_10061]) ).
tcf(c_17822,plain,
( happens(push,n1)
| holdsAt(backwards,n2)
| ~ happens(pull,n1) ),
inference(superposition,[status(thm)],[c_133,c_9959]) ).
tcf(c_17832,plain,
happens(push,n1),
inference(forward_subsumption_resolution,[status(thm)],[c_17822,c_7715,c_2467]) ).
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(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(f199,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| n2 = X1 ),
inference(cnf_transformation,[],[f113]) ).
fof(f200,plain,
! [X0,X1] :
( ~ sP8(X0,X1)
| push = X0 ),
inference(cnf_transformation,[],[f113]) ).
tcf(c_121,plain,
! [X0: $i,X1: $i] :
( ( X0 = push )
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
tcf(c_122,plain,
! [X0: $i,X1: $i] :
( ( X1 = n2 )
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f199]) ).
tcf(c_267,plain,
! [X0: $i,X1: $i] :
( ~ sP9(X0,X1)
| ( X0 = pull )
| ( X0 = push ) ),
inference(global_subsumption_just,[status(thm)],[c_112,c_121,c_112]) ).
tcf(c_268,plain,
! [X0: $i,X1: $i] :
( ( X0 = push )
| ( X0 = pull )
| ~ sP9(X0,X1) ),
inference(renaming,[status(thm)],[c_267]) ).
tcf(c_285,plain,
! [X0: $i,X1: $i] :
( ( X0 = push )
| ( X0 = pull )
| ~ sP9(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_113,c_268]) ).
tcf(c_446,plain,
! [X0: $i,X1: $i] :
( ( X1 = n2 )
| ~ sP8(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_122]) ).
tcf(c_1583,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X3 = n2 )
| ( X2 = n0 )
| ( X0 = pull )
| ~ sP9(X0,X2)
| ( X2 != X3 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_279,c_446]) ).
tcf(c_1584,plain,
! [X0: $i,X1: $i] :
( ( X1 = n2 )
| ( X1 = n0 )
| ( X0 = pull )
| ~ sP9(X0,X1) ),
inference(unflattening,[status(thm)],[c_1583]) ).
tcf(c_2386,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X3 = n2 )
| ( X3 = n0 )
| ( X1 = pull )
| ~ happens(X0,X2)
| ( X2 != X3 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_299,c_1584]) ).
tcf(c_2387,plain,
! [X0: $i,X1: $i] :
( ( X1 = n2 )
| ( X1 = n0 )
| ( X0 = pull )
| ~ happens(X0,X1) ),
inference(unflattening,[status(thm)],[c_2386]) ).
tcf(c_2431,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X1 = push )
| ( X1 = pull )
| ~ happens(X0,X2)
| ( X2 != X3 )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_299,c_285]) ).
tcf(c_2432,plain,
! [X0: $i,X1: $i] :
( ( X0 = push )
| ( X0 = pull )
| ~ happens(X0,X1) ),
inference(unflattening,[status(thm)],[c_2431]) ).
tcf(c_9355,plain,
! [X0: $i] :
( ( push = pull )
| ( X0 = n2 )
| ( X0 = n0 )
| ~ happens(push,X0) ),
inference(instantiation,[status(thm)],[c_2387]) ).
tcf(c_9356,plain,
( ( push = pull )
| ( n1 = n2 )
| ( n1 = n0 )
| ~ happens(push,n1) ),
inference(instantiation,[status(thm)],[c_9355]) ).
tcf(c_9742,plain,
! [X0: $i] :
( ( pull = push )
| ( pull = pull )
| ~ happens(pull,X0) ),
inference(instantiation,[status(thm)],[c_2432]) ).
tcf(c_9743,plain,
( ( pull = push )
| ( pull = pull )
| ~ happens(pull,n1) ),
inference(instantiation,[status(thm)],[c_9742]) ).
tcf(c_17854,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_17832,c_13538,c_10088,c_9743,c_9356,c_3639,c_2467,c_189,c_125,c_172,c_170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : CSR018+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.12/0.58 % Computer : n017.cluster.edu
% 0.12/0.58 % Model : x86_64 x86_64
% 0.12/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58 % Memory : 8046.5625MB
% 0.12/0.58 % OS : Linux 6.8.0-71-generic
% 0.12/0.58 % CPULimit : 300
% 0.12/0.58 % WCLimit : 300
% 0.12/0.58 % DateTime : Fri Sep 25 08:02:47 UTC 2026
% 0.12/0.58 % CPUTime :
% 0.12/0.58 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.62 Running first-order theorem proving
% 0.12/0.62 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.15/0.64
% 0.15/0.64 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.64
% 0.15/0.64 % Detected problem language: tptp
% 0.15/0.65 % Proving...
% 1.48/1.40 % SZS status Started for theBenchmark.p
% 1.48/1.40 % SZS status Theorem for theBenchmark.p
% 1.48/1.40
% 1.48/1.40 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.48/1.40
% 1.48/1.40 % ------ iProver source info
% 1.48/1.40
% 1.48/1.40 % git: date: 2026-07-19 20:42:38 +0200
% 1.48/1.40 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.48/1.40 % git: non_committed_changes: false
% 1.48/1.40
% 1.48/1.40 % ------ Parsing...
% 1.48/1.40 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.48/1.40
% 1.48/1.40 % ------ 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 %
% 1.48/1.40
% 1.48/1.40 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.48/1.40
% 1.48/1.40 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.48/1.40 % ------ Proving...
% 1.48/1.40 % ------ Problem Properties
% 1.48/1.40
% 1.48/1.40 %
% 1.48/1.40 % clauses 85
% 1.48/1.40 % conjectures 1
% 1.48/1.40 % EPR 68
% 1.48/1.40 % Horn 60
% 1.48/1.40 % unary 27
% 1.48/1.40 % binary 35
% 1.48/1.40 % lits 182
% 1.48/1.40 % lits eq 53
% 1.48/1.40 % fd_pure 0
% 1.48/1.40 % fd_pseudo 0
% 1.48/1.40 % fd_cond 18
% 1.48/1.40 % fd_pseudo_cond 2
% 1.48/1.40 % AC symbols 0
% 1.48/1.40
% 1.48/1.40 % ------ Schedule dynamic 5 is on
% 1.48/1.40
% 1.48/1.40 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.48/1.40
% 1.48/1.40
% 1.48/1.40 % ------
% 1.48/1.40 % Current options:
% 1.48/1.40 % ------
% 1.48/1.40
% 1.48/1.40
% 1.48/1.40 %
% 1.48/1.40
% 1.48/1.40 % ------ Proving...
% 1.48/1.40 %
% 1.48/1.40
% 1.48/1.40 % SZS status Theorem for theBenchmark.p
% 1.48/1.40
% 1.48/1.40 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.48/1.40
%------------------------------------------------------------------------------