TSTP Solution File: CSR016+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CSR016+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n009.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 : Fri May 3 02:11:05 EDT 2024
% Result : Theorem 4.01s 1.18s
% Output : CNFRefutation 4.01s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f320)
% Comments :
%------------------------------------------------------------------------------
fof(f9,axiom,
! [X3,X4,X1] :
( ( initiates(X3,X1,X4)
& happens(X3,X4) )
=> holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_holds) ).
fof(f10,axiom,
! [X3,X4,X1] :
( ( terminates(X3,X1,X4)
& happens(X3,X4) )
=> ~ holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_terminates_not_holds) ).
fof(f13,axiom,
! [X3,X1,X4] :
( initiates(X3,X1,X4)
<=> ( ( happens(push,X4)
& spinning = X1
& pull = X3 )
| ( ~ happens(push,X4)
& backwards = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& forwards = X1
& push = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initiates_all_defn) ).
fof(f14,axiom,
! [X3,X1,X4] :
( terminates(X3,X1,X4)
<=> ( ( ~ happens(push,X4)
& spinning = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& spinning = X1
& push = X3 )
| ( happens(push,X4)
& backwards = X1
& pull = X3 )
| ( happens(push,X4)
& forwards = X1
& pull = X3 )
| ( ~ happens(push,X4)
& forwards = X1
& pull = X3 )
| ( ~ happens(pull,X4)
& backwards = X1
& push = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',terminates_all_defn) ).
fof(f16,axiom,
! [X3,X4] :
( happens(X3,X4)
<=> ( ( n2 = X4
& push = X3 )
| ( n2 = X4
& pull = X3 )
| ( n1 = X4
& pull = X3 )
| ( n0 = X4
& push = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',push_not_pull) ).
fof(f22,axiom,
n1 = plus(n0,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
fof(f31,axiom,
! [X8,X9] : plus(X8,X9) = plus(X9,X8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f32,axiom,
! [X8,X9] :
( less_or_equal(X8,X9)
<=> ( X8 = X9
| less(X8,X9) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
fof(f34,axiom,
! [X8] :
( less(X8,n1)
<=> less_or_equal(X8,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
fof(f35,axiom,
! [X8] :
( less(X8,n2)
<=> less_or_equal(X8,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(f36,axiom,
! [X8] :
( less(X8,n3)
<=> less_or_equal(X8,n2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less3) ).
fof(f43,axiom,
! [X8,X9] :
( less(X8,X9)
<=> ( X8 != X9
& ~ less(X9,X8) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
fof(f48,conjecture,
holdsAt(forwards,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',forwards_1) ).
fof(f49,negated_conjecture,
~ holdsAt(forwards,n1),
inference(negated_conjecture,[],[f48]) ).
fof(f57,plain,
! [X0,X1,X2] :
( ( initiates(X0,X2,X1)
& happens(X0,X1) )
=> holdsAt(X2,plus(X1,n1)) ),
inference(rectify,[],[f9]) ).
fof(f58,plain,
! [X0,X1,X2] :
( ( terminates(X0,X2,X1)
& happens(X0,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
inference(rectify,[],[f10]) ).
fof(f61,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| ( ~ happens(push,X2)
& backwards = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& forwards = X1
& push = X0 ) ) ),
inference(rectify,[],[f13]) ).
fof(f62,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& spinning = X1
& push = X0 )
| ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ( happens(push,X2)
& forwards = X1
& pull = X0 )
| ( ~ happens(push,X2)
& forwards = X1
& pull = X0 )
| ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ) ),
inference(rectify,[],[f14]) ).
fof(f64,plain,
! [X0,X1] :
( happens(X0,X1)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| ( n0 = X1
& push = X0 ) ) ),
inference(rectify,[],[f16]) ).
fof(f65,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(rectify,[],[f31]) ).
fof(f66,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
<=> ( X0 = X1
| less(X0,X1) ) ),
inference(rectify,[],[f32]) ).
fof(f68,plain,
! [X0] :
( less(X0,n1)
<=> less_or_equal(X0,n0) ),
inference(rectify,[],[f34]) ).
fof(f69,plain,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
inference(rectify,[],[f35]) ).
fof(f70,plain,
! [X0] :
( less(X0,n3)
<=> less_or_equal(X0,n2) ),
inference(rectify,[],[f36]) ).
fof(f77,plain,
! [X0,X1] :
( less(X0,X1)
<=> ( X0 != X1
& ~ less(X1,X0) ) ),
inference(rectify,[],[f43]) ).
fof(f79,plain,
~ holdsAt(forwards,n1),
inference(flattening,[],[f49]) ).
fof(f94,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ initiates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(ennf_transformation,[],[f57]) ).
fof(f95,plain,
! [X0,X1,X2] :
( holdsAt(X2,plus(X1,n1))
| ~ initiates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(flattening,[],[f94]) ).
fof(f96,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(ennf_transformation,[],[f58]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(flattening,[],[f96]) ).
fof(f103,plain,
! [X2,X1,X0] :
( sP0(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& forwards = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f104,plain,
! [X2,X1,X0] :
( sP1(X2,X1,X0)
<=> ( ~ happens(push,X2)
& backwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f105,plain,
! [X0,X1,X2] :
( initiates(X0,X1,X2)
<=> ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| sP1(X2,X1,X0)
| sP0(X2,X1,X0) ) ),
inference(definition_folding,[],[f61,f104,f103]) ).
fof(f106,plain,
! [X2,X1,X0] :
( sP2(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f107,plain,
! [X2,X1,X0] :
( sP3(X2,X1,X0)
<=> ( ~ happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f108,plain,
! [X2,X1,X0] :
( sP4(X2,X1,X0)
<=> ( happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f109,plain,
! [X2,X1,X0] :
( sP5(X2,X1,X0)
<=> ( happens(push,X2)
& backwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).
fof(f110,plain,
! [X2,X1,X0] :
( sP6(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& spinning = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f111,plain,
! [X2,X1,X0] :
( sP7(X2,X1,X0)
<=> ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP7])]) ).
fof(f112,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> sP7(X2,X1,X0) ),
inference(definition_folding,[],[f62,f111,f110,f109,f108,f107,f106]) ).
fof(f113,plain,
! [X1,X0] :
( sP8(X1,X0)
<=> ( n0 = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP8])]) ).
fof(f114,plain,
! [X1,X0] :
( sP9(X1,X0)
<=> ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])]) ).
fof(f115,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP9(X1,X0) ),
inference(definition_folding,[],[f64,f114,f113]) ).
fof(f127,plain,
! [X2,X1,X0] :
( ( sP0(X2,X1,X0)
| happens(pull,X2)
| forwards != X1
| push != X0 )
& ( ( ~ happens(pull,X2)
& forwards = X1
& push = X0 )
| ~ sP0(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f103]) ).
fof(f128,plain,
! [X2,X1,X0] :
( ( sP0(X2,X1,X0)
| happens(pull,X2)
| forwards != X1
| push != X0 )
& ( ( ~ happens(pull,X2)
& forwards = X1
& push = X0 )
| ~ sP0(X2,X1,X0) ) ),
inference(flattening,[],[f127]) ).
fof(f129,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| happens(pull,X0)
| forwards != X1
| push != X2 )
& ( ( ~ happens(pull,X0)
& forwards = X1
& push = X2 )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f128]) ).
fof(f130,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( ~ happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP1(X2,X1,X0)
& ~ sP0(X2,X1,X0) ) )
& ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| sP1(X2,X1,X0)
| sP0(X2,X1,X0)
| ~ initiates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f105]) ).
fof(f131,plain,
! [X0,X1,X2] :
( ( initiates(X0,X1,X2)
| ( ( ~ happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP1(X2,X1,X0)
& ~ sP0(X2,X1,X0) ) )
& ( ( happens(push,X2)
& spinning = X1
& pull = X0 )
| sP1(X2,X1,X0)
| sP0(X2,X1,X0)
| ~ initiates(X0,X1,X2) ) ),
inference(flattening,[],[f130]) ).
fof(f132,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| ( ( happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0)
& ~ sP3(X2,X1,X0)
& ~ sP2(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0)
| ~ sP7(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f111]) ).
fof(f133,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| ( ( happens(push,X2)
| spinning != X1
| pull != X0 )
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0)
& ~ sP3(X2,X1,X0)
& ~ sP2(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& spinning = X1
& pull = X0 )
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| sP3(X2,X1,X0)
| sP2(X2,X1,X0)
| ~ sP7(X2,X1,X0) ) ),
inference(flattening,[],[f132]) ).
fof(f134,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| ( ( happens(push,X0)
| spinning != X1
| pull != X2 )
& ~ sP6(X0,X1,X2)
& ~ sP5(X0,X1,X2)
& ~ sP4(X0,X1,X2)
& ~ sP3(X0,X1,X2)
& ~ sP2(X0,X1,X2) ) )
& ( ( ~ happens(push,X0)
& spinning = X1
& pull = X2 )
| sP6(X0,X1,X2)
| sP5(X0,X1,X2)
| sP4(X0,X1,X2)
| sP3(X0,X1,X2)
| sP2(X0,X1,X2)
| ~ sP7(X0,X1,X2) ) ),
inference(rectify,[],[f133]) ).
fof(f147,plain,
! [X2,X1,X0] :
( ( sP2(X2,X1,X0)
| happens(pull,X2)
| backwards != X1
| push != X0 )
& ( ( ~ happens(pull,X2)
& backwards = X1
& push = X0 )
| ~ sP2(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f106]) ).
fof(f148,plain,
! [X2,X1,X0] :
( ( sP2(X2,X1,X0)
| happens(pull,X2)
| backwards != X1
| push != X0 )
& ( ( ~ happens(pull,X2)
& backwards = X1
& push = X0 )
| ~ sP2(X2,X1,X0) ) ),
inference(flattening,[],[f147]) ).
fof(f149,plain,
! [X0,X1,X2] :
( ( sP2(X0,X1,X2)
| happens(pull,X0)
| backwards != X1
| push != X2 )
& ( ( ~ happens(pull,X0)
& backwards = X1
& push = X2 )
| ~ sP2(X0,X1,X2) ) ),
inference(rectify,[],[f148]) ).
fof(f150,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ~ sP7(X2,X1,X0) )
& ( sP7(X2,X1,X0)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f112]) ).
fof(f151,plain,
! [X1,X0] :
( ( sP9(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP8(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0)
| ~ sP9(X1,X0) ) ),
inference(nnf_transformation,[],[f114]) ).
fof(f152,plain,
! [X1,X0] :
( ( sP9(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ( n2 != X1
| pull != X0 )
& ( n1 != X1
| pull != X0 )
& ~ sP8(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| ( n2 = X1
& pull = X0 )
| ( n1 = X1
& pull = X0 )
| sP8(X1,X0)
| ~ sP9(X1,X0) ) ),
inference(flattening,[],[f151]) ).
fof(f153,plain,
! [X0,X1] :
( ( sP9(X0,X1)
| ( ( n2 != X0
| push != X1 )
& ( n2 != X0
| pull != X1 )
& ( n1 != X0
| pull != X1 )
& ~ sP8(X0,X1) ) )
& ( ( n2 = X0
& push = X1 )
| ( n2 = X0
& pull = X1 )
| ( n1 = X0
& pull = X1 )
| sP8(X0,X1)
| ~ sP9(X0,X1) ) ),
inference(rectify,[],[f152]) ).
fof(f154,plain,
! [X1,X0] :
( ( sP8(X1,X0)
| n0 != X1
| push != X0 )
& ( ( n0 = X1
& push = X0 )
| ~ sP8(X1,X0) ) ),
inference(nnf_transformation,[],[f113]) ).
fof(f155,plain,
! [X1,X0] :
( ( sP8(X1,X0)
| n0 != X1
| push != X0 )
& ( ( n0 = X1
& push = X0 )
| ~ sP8(X1,X0) ) ),
inference(flattening,[],[f154]) ).
fof(f156,plain,
! [X0,X1] :
( ( sP8(X0,X1)
| n0 != X0
| push != X1 )
& ( ( n0 = X0
& push = X1 )
| ~ sP8(X0,X1) ) ),
inference(rectify,[],[f155]) ).
fof(f157,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP9(X1,X0) )
& ( sP9(X1,X0)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f158,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,[],[f66]) ).
fof(f159,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,[],[f158]) ).
fof(f160,plain,
! [X0] :
( ( less(X0,n1)
| ~ less_or_equal(X0,n0) )
& ( less_or_equal(X0,n0)
| ~ less(X0,n1) ) ),
inference(nnf_transformation,[],[f68]) ).
fof(f161,plain,
! [X0] :
( ( less(X0,n2)
| ~ less_or_equal(X0,n1) )
& ( less_or_equal(X0,n1)
| ~ less(X0,n2) ) ),
inference(nnf_transformation,[],[f69]) ).
fof(f162,plain,
! [X0] :
( ( less(X0,n3)
| ~ less_or_equal(X0,n2) )
& ( less_or_equal(X0,n2)
| ~ less(X0,n3) ) ),
inference(nnf_transformation,[],[f70]) ).
fof(f169,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| ~ less(X0,X1) ) ),
inference(nnf_transformation,[],[f77]) ).
fof(f170,plain,
! [X0,X1] :
( ( less(X0,X1)
| X0 = X1
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| ~ less(X0,X1) ) ),
inference(flattening,[],[f169]) ).
fof(f179,plain,
! [X2,X0,X1] :
( holdsAt(X2,plus(X1,n1))
| ~ initiates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f95]) ).
fof(f180,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f191,plain,
! [X2,X0,X1] :
( sP0(X0,X1,X2)
| happens(pull,X0)
| forwards != X1
| push != X2 ),
inference(cnf_transformation,[],[f129]) ).
fof(f195,plain,
! [X2,X0,X1] :
( initiates(X0,X1,X2)
| ~ sP0(X2,X1,X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f201,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| ~ sP2(X0,X1,X2) ),
inference(cnf_transformation,[],[f134]) ).
fof(f226,plain,
! [X2,X0,X1] :
( sP2(X0,X1,X2)
| happens(pull,X0)
| backwards != X1
| push != X2 ),
inference(cnf_transformation,[],[f149]) ).
fof(f228,plain,
! [X2,X0,X1] :
( terminates(X0,X1,X2)
| ~ sP7(X2,X1,X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f233,plain,
! [X0,X1] :
( push = X1
| n2 = X0
| n1 = X0
| sP8(X0,X1)
| ~ sP9(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f238,plain,
! [X0,X1] :
( sP9(X0,X1)
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f242,plain,
! [X0,X1] :
( push = X1
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f156]) ).
fof(f244,plain,
! [X0,X1] :
( sP8(X0,X1)
| n0 != X0
| push != X1 ),
inference(cnf_transformation,[],[f156]) ).
fof(f245,plain,
! [X0,X1] :
( sP9(X1,X0)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f157]) ).
fof(f246,plain,
! [X0,X1] :
( happens(X0,X1)
| ~ sP9(X1,X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f247,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f252,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f261,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f65]) ).
fof(f263,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f159]) ).
fof(f264,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f159]) ).
fof(f267,plain,
! [X0] :
( less(X0,n1)
| ~ less_or_equal(X0,n0) ),
inference(cnf_transformation,[],[f160]) ).
fof(f268,plain,
! [X0] :
( less_or_equal(X0,n1)
| ~ less(X0,n2) ),
inference(cnf_transformation,[],[f161]) ).
fof(f269,plain,
! [X0] :
( less(X0,n2)
| ~ less_or_equal(X0,n1) ),
inference(cnf_transformation,[],[f161]) ).
fof(f270,plain,
! [X0] :
( less_or_equal(X0,n2)
| ~ less(X0,n3) ),
inference(cnf_transformation,[],[f162]) ).
fof(f271,plain,
! [X0] :
( less(X0,n3)
| ~ less_or_equal(X0,n2) ),
inference(cnf_transformation,[],[f162]) ).
fof(f285,plain,
! [X0,X1] :
( X0 != X1
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f170]) ).
fof(f291,plain,
~ holdsAt(forwards,n1),
inference(cnf_transformation,[],[f79]) ).
fof(f294,plain,
! [X2,X0] :
( sP0(X0,forwards,X2)
| happens(pull,X0)
| push != X2 ),
inference(equality_resolution,[],[f191]) ).
fof(f295,plain,
! [X0] :
( sP0(X0,forwards,push)
| happens(pull,X0) ),
inference(equality_resolution,[],[f294]) ).
fof(f308,plain,
! [X2,X0] :
( sP2(X0,backwards,X2)
| happens(pull,X0)
| push != X2 ),
inference(equality_resolution,[],[f226]) ).
fof(f309,plain,
! [X0] :
( sP2(X0,backwards,push)
| happens(pull,X0) ),
inference(equality_resolution,[],[f308]) ).
fof(f316,plain,
! [X1] :
( sP8(n0,X1)
| push != X1 ),
inference(equality_resolution,[],[f244]) ).
fof(f317,plain,
sP8(n0,push),
inference(equality_resolution,[],[f316]) ).
fof(f318,plain,
! [X1] : less_or_equal(X1,X1),
inference(equality_resolution,[],[f264]) ).
fof(f319,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f285]) ).
cnf(c_57,plain,
( ~ initiates(X0,X1,X2)
| ~ happens(X0,X2)
| holdsAt(X1,plus(X2,n1)) ),
inference(cnf_transformation,[],[f179]) ).
cnf(c_58,plain,
( ~ holdsAt(X0,plus(X1,n1))
| ~ terminates(X2,X0,X1)
| ~ happens(X2,X1) ),
inference(cnf_transformation,[],[f180]) ).
cnf(c_66,plain,
( sP0(X0,forwards,push)
| happens(pull,X0) ),
inference(cnf_transformation,[],[f295]) ).
cnf(c_72,plain,
( ~ sP0(X0,X1,X2)
| initiates(X2,X1,X0) ),
inference(cnf_transformation,[],[f195]) ).
cnf(c_81,plain,
( ~ sP2(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(cnf_transformation,[],[f201]) ).
cnf(c_101,plain,
( sP2(X0,backwards,push)
| happens(pull,X0) ),
inference(cnf_transformation,[],[f309]) ).
cnf(c_105,plain,
( ~ sP7(X0,X1,X2)
| terminates(X2,X1,X0) ),
inference(cnf_transformation,[],[f228]) ).
cnf(c_111,plain,
( ~ sP8(X0,X1)
| sP9(X0,X1) ),
inference(cnf_transformation,[],[f238]) ).
cnf(c_112,plain,
( ~ sP9(X0,X1)
| X0 = n1
| X0 = n2
| sP8(X0,X1) ),
inference(cnf_transformation,[],[f320]) ).
cnf(c_116,plain,
( ~ sP9(X0,X1)
| X0 = n1
| X0 = n2
| X1 = push
| sP8(X0,X1) ),
inference(cnf_transformation,[],[f233]) ).
cnf(c_120,plain,
sP8(n0,push),
inference(cnf_transformation,[],[f317]) ).
cnf(c_122,plain,
( ~ sP8(X0,X1)
| X1 = push ),
inference(cnf_transformation,[],[f242]) ).
cnf(c_123,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(cnf_transformation,[],[f246]) ).
cnf(c_124,plain,
( ~ happens(X0,X1)
| sP9(X1,X0) ),
inference(cnf_transformation,[],[f245]) ).
cnf(c_125,plain,
pull != push,
inference(cnf_transformation,[],[f247]) ).
cnf(c_130,plain,
plus(n0,n1) = n1,
inference(cnf_transformation,[],[f252]) ).
cnf(c_139,plain,
plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f261]) ).
cnf(c_140,plain,
less_or_equal(X0,X0),
inference(cnf_transformation,[],[f318]) ).
cnf(c_141,plain,
( ~ less(X0,X1)
| less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f263]) ).
cnf(c_144,plain,
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(cnf_transformation,[],[f267]) ).
cnf(c_146,plain,
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f269]) ).
cnf(c_147,plain,
( ~ less(X0,n2)
| less_or_equal(X0,n1) ),
inference(cnf_transformation,[],[f268]) ).
cnf(c_148,plain,
( ~ less_or_equal(X0,n2)
| less(X0,n3) ),
inference(cnf_transformation,[],[f271]) ).
cnf(c_149,plain,
( ~ less(X0,n3)
| less_or_equal(X0,n2) ),
inference(cnf_transformation,[],[f270]) ).
cnf(c_163,plain,
~ less(X0,X0),
inference(cnf_transformation,[],[f319]) ).
cnf(c_169,negated_conjecture,
~ holdsAt(forwards,n1),
inference(cnf_transformation,[],[f291]) ).
cnf(c_170,plain,
less_or_equal(n1,n1),
inference(instantiation,[status(thm)],[c_140]) ).
cnf(c_172,plain,
~ less(n1,n1),
inference(instantiation,[status(thm)],[c_163]) ).
cnf(c_189,plain,
( ~ less_or_equal(n1,n1)
| less(n1,n2) ),
inference(instantiation,[status(thm)],[c_146]) ).
cnf(c_275,plain,
( X0 = n2
| X0 = n1
| ~ sP9(X0,X1)
| sP8(X0,X1) ),
inference(global_subsumption_just,[status(thm)],[c_116,c_112]) ).
cnf(c_276,plain,
( ~ sP9(X0,X1)
| X0 = n1
| X0 = n2
| sP8(X0,X1) ),
inference(renaming,[status(thm)],[c_275]) ).
cnf(c_290,plain,
( less(X0,n1)
| ~ less_or_equal(X0,n0) ),
inference(prop_impl_just,[status(thm)],[c_144]) ).
cnf(c_291,plain,
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(renaming,[status(thm)],[c_290]) ).
cnf(c_296,plain,
( ~ less(X0,n2)
| less_or_equal(X0,n1) ),
inference(prop_impl_just,[status(thm)],[c_147]) ).
cnf(c_298,plain,
( less(X0,n3)
| ~ less_or_equal(X0,n2) ),
inference(prop_impl_just,[status(thm)],[c_148]) ).
cnf(c_299,plain,
( ~ less_or_equal(X0,n2)
| less(X0,n3) ),
inference(renaming,[status(thm)],[c_298]) ).
cnf(c_300,plain,
( ~ less(X0,n3)
| less_or_equal(X0,n2) ),
inference(prop_impl_just,[status(thm)],[c_149]) ).
cnf(c_330,plain,
( ~ happens(X0,X1)
| sP9(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_124]) ).
cnf(c_370,plain,
( happens(pull,X0)
| sP2(X0,backwards,push) ),
inference(prop_impl_just,[status(thm)],[c_101]) ).
cnf(c_371,plain,
( sP2(X0,backwards,push)
| happens(pull,X0) ),
inference(renaming,[status(thm)],[c_370]) ).
cnf(c_380,plain,
( ~ sP7(X0,X1,X2)
| terminates(X2,X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_105]) ).
cnf(c_420,plain,
( ~ sP2(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(prop_impl_just,[status(thm)],[c_81]) ).
cnf(c_436,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_123]) ).
cnf(c_438,plain,
( ~ sP8(X0,X1)
| sP9(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_111]) ).
cnf(c_440,plain,
( ~ sP8(X0,X1)
| X1 = push ),
inference(prop_impl_just,[status(thm)],[c_122]) ).
cnf(c_448,plain,
( ~ less(X0,X1)
| less_or_equal(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_141]) ).
cnf(c_1237,plain,
plus(n1,n0) = n1,
inference(demodulation,[status(thm)],[c_130,c_139]) ).
cnf(c_1537,plain,
( X0 != X1
| X2 != X3
| X4 != X5
| ~ holdsAt(X0,plus(X2,n1))
| ~ sP7(X3,X1,X5)
| ~ happens(X4,X2) ),
inference(resolution_lifted,[status(thm)],[c_58,c_380]) ).
cnf(c_1538,plain,
( ~ holdsAt(X0,plus(X1,n1))
| ~ sP7(X1,X0,X2)
| ~ happens(X2,X1) ),
inference(unflattening,[status(thm)],[c_1537]) ).
cnf(c_1578,plain,
( X0 != X1
| X2 != X3
| ~ sP9(X0,X2)
| X0 = n1
| X0 = n2
| X3 = push ),
inference(resolution_lifted,[status(thm)],[c_276,c_440]) ).
cnf(c_1579,plain,
( ~ sP9(X0,X1)
| X0 = n1
| X0 = n2
| X1 = push ),
inference(unflattening,[status(thm)],[c_1578]) ).
cnf(c_1614,plain,
( X0 != n0
| X1 != push
| sP9(X0,X1) ),
inference(resolution_lifted,[status(thm)],[c_438,c_120]) ).
cnf(c_1615,plain,
sP9(n0,push),
inference(unflattening,[status(thm)],[c_1614]) ).
cnf(c_2302,plain,
( X0 != X1
| X2 != backwards
| X3 != push
| sP7(X0,X2,X3)
| happens(pull,X1) ),
inference(resolution_lifted,[status(thm)],[c_420,c_371]) ).
cnf(c_2303,plain,
( sP7(X0,backwards,push)
| happens(pull,X0) ),
inference(unflattening,[status(thm)],[c_2302]) ).
cnf(c_2555,plain,
( X0 != X1
| X2 != X3
| ~ happens(X3,X1)
| X0 = n1
| X0 = n2
| X2 = push ),
inference(resolution_lifted,[status(thm)],[c_1579,c_330]) ).
cnf(c_2556,plain,
( ~ happens(X0,X1)
| X0 = push
| X1 = n1
| X1 = n2 ),
inference(unflattening,[status(thm)],[c_2555]) ).
cnf(c_2607,plain,
( X0 != n0
| X1 != push
| happens(X1,X0) ),
inference(resolution_lifted,[status(thm)],[c_436,c_1615]) ).
cnf(c_2608,plain,
happens(push,n0),
inference(unflattening,[status(thm)],[c_2607]) ).
cnf(c_3221,plain,
( X0 != X1
| X2 != n2
| ~ less(X0,X2)
| less(X1,n3) ),
inference(resolution_lifted,[status(thm)],[c_448,c_299]) ).
cnf(c_3222,plain,
( ~ less(X0,n2)
| less(X0,n3) ),
inference(unflattening,[status(thm)],[c_3221]) ).
cnf(c_3223,plain,
( ~ less(n1,n2)
| less(n1,n3) ),
inference(instantiation,[status(thm)],[c_3222]) ).
cnf(c_3369,plain,
( X0 != X1
| n1 != n0
| ~ less(X1,n2)
| less(X0,n1) ),
inference(resolution_lifted,[status(thm)],[c_291,c_296]) ).
cnf(c_3370,plain,
( n1 != n0
| ~ less(X0,n2)
| less(X0,n1) ),
inference(unflattening,[status(thm)],[c_3369]) ).
cnf(c_3371,plain,
( n1 != n0
| ~ less(n1,n2)
| less(n1,n1) ),
inference(instantiation,[status(thm)],[c_3370]) ).
cnf(c_3387,plain,
( X0 != X1
| n2 != n0
| ~ less(X1,n3)
| less(X0,n1) ),
inference(resolution_lifted,[status(thm)],[c_291,c_300]) ).
cnf(c_3388,plain,
( n2 != n0
| ~ less(X0,n3)
| less(X0,n1) ),
inference(unflattening,[status(thm)],[c_3387]) ).
cnf(c_3389,plain,
( n2 != n0
| ~ less(n1,n3)
| less(n1,n1) ),
inference(instantiation,[status(thm)],[c_3388]) ).
cnf(c_4686,plain,
( happens(pull,X0)
| sP7(X0,backwards,push) ),
inference(prop_impl_just,[status(thm)],[c_2303]) ).
cnf(c_4687,plain,
( sP7(X0,backwards,push)
| happens(pull,X0) ),
inference(renaming,[status(thm)],[c_4686]) ).
cnf(c_9290,plain,
( initiates(push,forwards,X0)
| happens(pull,X0) ),
inference(superposition,[status(thm)],[c_66,c_72]) ).
cnf(c_9388,plain,
( ~ holdsAt(X0,plus(n1,X1))
| ~ sP7(X1,X0,X2)
| ~ happens(X2,X1) ),
inference(superposition,[status(thm)],[c_139,c_1538]) ).
cnf(c_9556,plain,
( ~ happens(push,X0)
| holdsAt(forwards,plus(X0,n1))
| happens(pull,X0) ),
inference(superposition,[status(thm)],[c_9290,c_57]) ).
cnf(c_9658,plain,
( ~ sP7(n0,X0,X1)
| ~ holdsAt(X0,n1)
| ~ happens(X1,n0) ),
inference(superposition,[status(thm)],[c_1237,c_9388]) ).
cnf(c_9674,plain,
( ~ happens(push,X0)
| holdsAt(forwards,plus(n1,X0))
| happens(pull,X0) ),
inference(superposition,[status(thm)],[c_139,c_9556]) ).
cnf(c_9813,plain,
( ~ holdsAt(backwards,n1)
| ~ happens(push,n0)
| happens(pull,n0) ),
inference(superposition,[status(thm)],[c_4687,c_9658]) ).
cnf(c_9867,plain,
( ~ happens(push,n0)
| holdsAt(forwards,n1)
| happens(pull,n0) ),
inference(superposition,[status(thm)],[c_1237,c_9674]) ).
cnf(c_10022,plain,
happens(pull,n0),
inference(global_subsumption_just,[status(thm)],[c_9813,c_169,c_2608,c_9867]) ).
cnf(c_10025,plain,
( n1 = n0
| pull = push
| n2 = n0 ),
inference(superposition,[status(thm)],[c_10022,c_2556]) ).
cnf(c_10028,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_10025,c_3389,c_3371,c_3223,c_189,c_125,c_172,c_170]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR016+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.03/0.13 % Command : run_iprover %s %d THM
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu May 2 22:56:11 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.01/1.18 % SZS status Started for theBenchmark.p
% 4.01/1.18 % SZS status Theorem for theBenchmark.p
% 4.01/1.18
% 4.01/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 4.01/1.18
% 4.01/1.18 ------ iProver source info
% 4.01/1.18
% 4.01/1.18 git: date: 2024-05-02 19:28:25 +0000
% 4.01/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 4.01/1.18 git: non_committed_changes: false
% 4.01/1.18
% 4.01/1.18 ------ Parsing...
% 4.01/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.01/1.18
% 4.01/1.18 ------ 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: 10 0s sf_e pe_s pe_e
% 4.01/1.18
% 4.01/1.18 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.01/1.18
% 4.01/1.18 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 4.01/1.18 ------ Proving...
% 4.01/1.18 ------ Problem Properties
% 4.01/1.18
% 4.01/1.18
% 4.01/1.18 clauses 82
% 4.01/1.18 conjectures 1
% 4.01/1.18 EPR 65
% 4.01/1.18 Horn 56
% 4.01/1.18 unary 27
% 4.01/1.18 binary 31
% 4.01/1.18 lits 177
% 4.01/1.18 lits eq 54
% 4.01/1.18 fd_pure 0
% 4.01/1.18 fd_pseudo 0
% 4.01/1.18 fd_cond 18
% 4.01/1.18 fd_pseudo_cond 2
% 4.01/1.18 AC symbols 0
% 4.01/1.18
% 4.01/1.18 ------ Input Options Time Limit: Unbounded
% 4.01/1.18
% 4.01/1.18
% 4.01/1.18 ------
% 4.01/1.18 Current options:
% 4.01/1.18 ------
% 4.01/1.18
% 4.01/1.18
% 4.01/1.18
% 4.01/1.18
% 4.01/1.18 ------ Proving...
% 4.01/1.18
% 4.01/1.18
% 4.01/1.18 ------ Proving...
% 4.01/1.18
% 4.01/1.18
% 4.01/1.18 ------ Proving...
% 4.01/1.18
% 4.01/1.18
% 4.01/1.18 ------ Proving...
% 4.01/1.18
% 4.01/1.18
% 4.01/1.18 % SZS status Theorem for theBenchmark.p
% 4.01/1.18
% 4.01/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.01/1.18
% 4.01/1.18
%------------------------------------------------------------------------------