TSTP Solution File: CSR015+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : CSR015+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n017.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 : Mon Jun 24 05:12:00 EDT 2024
% Result : Theorem 3.75s 1.19s
% Output : CNFRefutation 3.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 25
% Syntax : Number of formulae : 157 ( 35 unt; 0 def)
% Number of atoms : 650 ( 243 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 749 ( 256 ~; 288 |; 178 &)
% ( 19 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 302 ( 12 sgn 199 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6,axiom,
! [X1,X4] :
( ( ~ ? [X3] :
( initiates(X3,X1,X4)
& happens(X3,X4) )
& ~ releasedAt(X1,plus(X4,n1))
& ~ holdsAt(X1,X4) )
=> ~ holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',keep_not_holding) ).
fof(f7,axiom,
! [X1,X4] :
( ( ~ ? [X3] :
( ( terminates(X3,X1,X4)
| initiates(X3,X1,X4) )
& happens(X3,X4) )
& releasedAt(X1,X4) )
=> releasedAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',keep_released) ).
fof(f10,axiom,
! [X3,X4,X1] :
( ( terminates(X3,X1,X4)
& happens(X3,X4) )
=> ~ holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',push_not_pull) ).
fof(f18,axiom,
forwards != backwards,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',forwards_not_backwards) ).
fof(f22,axiom,
n1 = plus(n0,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).
fof(f31,axiom,
! [X8,X9] : plus(X8,X9) = plus(X9,X8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f45,axiom,
~ holdsAt(backwards,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_0) ).
fof(f47,axiom,
! [X1,X4] : ~ releasedAt(X1,X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_releasedAt) ).
fof(f48,conjecture,
~ holdsAt(backwards,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_1) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(backwards,n1),
inference(negated_conjecture,[],[f48]) ).
fof(f54,plain,
! [X0,X1] :
( ( ~ ? [X2] :
( initiates(X2,X0,X1)
& happens(X2,X1) )
& ~ releasedAt(X0,plus(X1,n1))
& ~ holdsAt(X0,X1) )
=> ~ holdsAt(X0,plus(X1,n1)) ),
inference(rectify,[],[f6]) ).
fof(f55,plain,
! [X0,X1] :
( ( ~ ? [X2] :
( ( terminates(X2,X0,X1)
| initiates(X2,X0,X1) )
& happens(X2,X1) )
& releasedAt(X0,X1) )
=> releasedAt(X0,plus(X1,n1)) ),
inference(rectify,[],[f7]) ).
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(f78,plain,
! [X0,X1] : ~ releasedAt(X0,X1),
inference(rectify,[],[f47]) ).
fof(f79,plain,
holdsAt(backwards,n1),
inference(flattening,[],[f49]) ).
fof(f88,plain,
! [X0,X1] :
( ~ holdsAt(X0,plus(X1,n1))
| ? [X2] :
( initiates(X2,X0,X1)
& happens(X2,X1) )
| releasedAt(X0,plus(X1,n1))
| holdsAt(X0,X1) ),
inference(ennf_transformation,[],[f54]) ).
fof(f89,plain,
! [X0,X1] :
( ~ holdsAt(X0,plus(X1,n1))
| ? [X2] :
( initiates(X2,X0,X1)
& happens(X2,X1) )
| releasedAt(X0,plus(X1,n1))
| holdsAt(X0,X1) ),
inference(flattening,[],[f88]) ).
fof(f90,plain,
! [X0,X1] :
( releasedAt(X0,plus(X1,n1))
| ? [X2] :
( ( terminates(X2,X0,X1)
| initiates(X2,X0,X1) )
& happens(X2,X1) )
| ~ releasedAt(X0,X1) ),
inference(ennf_transformation,[],[f55]) ).
fof(f91,plain,
! [X0,X1] :
( releasedAt(X0,plus(X1,n1))
| ? [X2] :
( ( terminates(X2,X0,X1)
| initiates(X2,X0,X1) )
& happens(X2,X1) )
| ~ releasedAt(X0,X1) ),
inference(flattening,[],[f90]) ).
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(f118,plain,
! [X0,X1] :
( ? [X2] :
( initiates(X2,X0,X1)
& happens(X2,X1) )
=> ( initiates(sK11(X0,X1),X0,X1)
& happens(sK11(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
! [X0,X1] :
( ~ holdsAt(X0,plus(X1,n1))
| ( initiates(sK11(X0,X1),X0,X1)
& happens(sK11(X0,X1),X1) )
| releasedAt(X0,plus(X1,n1))
| holdsAt(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11])],[f89,f118]) ).
fof(f120,plain,
! [X0,X1] :
( ? [X2] :
( ( terminates(X2,X0,X1)
| initiates(X2,X0,X1) )
& happens(X2,X1) )
=> ( ( terminates(sK12(X0,X1),X0,X1)
| initiates(sK12(X0,X1),X0,X1) )
& happens(sK12(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
! [X0,X1] :
( releasedAt(X0,plus(X1,n1))
| ( ( terminates(sK12(X0,X1),X0,X1)
| initiates(sK12(X0,X1),X0,X1) )
& happens(sK12(X0,X1),X1) )
| ~ releasedAt(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f91,f120]) ).
fof(f124,plain,
! [X2,X1,X0] :
( ( sP1(X2,X1,X0)
| happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( ~ happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP1(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f104]) ).
fof(f125,plain,
! [X2,X1,X0] :
( ( sP1(X2,X1,X0)
| happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( ~ happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP1(X2,X1,X0) ) ),
inference(flattening,[],[f124]) ).
fof(f126,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| happens(push,X0)
| backwards != X1
| pull != X2 )
& ( ( ~ happens(push,X0)
& backwards = X1
& pull = X2 )
| ~ sP1(X0,X1,X2) ) ),
inference(rectify,[],[f125]) ).
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(f138,plain,
! [X2,X1,X0] :
( ( sP5(X2,X1,X0)
| ~ happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP5(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f109]) ).
fof(f139,plain,
! [X2,X1,X0] :
( ( sP5(X2,X1,X0)
| ~ happens(push,X2)
| backwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& backwards = X1
& pull = X0 )
| ~ sP5(X2,X1,X0) ) ),
inference(flattening,[],[f138]) ).
fof(f140,plain,
! [X0,X1,X2] :
( ( sP5(X0,X1,X2)
| ~ happens(push,X0)
| backwards != X1
| pull != X2 )
& ( ( happens(push,X0)
& backwards = X1
& pull = X2 )
| ~ sP5(X0,X1,X2) ) ),
inference(rectify,[],[f139]) ).
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(f173,plain,
! [X0,X1] :
( ~ holdsAt(X0,plus(X1,n1))
| happens(sK11(X0,X1),X1)
| releasedAt(X0,plus(X1,n1))
| holdsAt(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f174,plain,
! [X0,X1] :
( ~ holdsAt(X0,plus(X1,n1))
| initiates(sK11(X0,X1),X0,X1)
| releasedAt(X0,plus(X1,n1))
| holdsAt(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f176,plain,
! [X0,X1] :
( releasedAt(X0,plus(X1,n1))
| terminates(sK12(X0,X1),X0,X1)
| initiates(sK12(X0,X1),X0,X1)
| ~ releasedAt(X0,X1) ),
inference(cnf_transformation,[],[f121]) ).
fof(f180,plain,
! [X2,X0,X1] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
fof(f184,plain,
! [X2,X0,X1] :
( pull = X2
| ~ sP1(X0,X1,X2) ),
inference(cnf_transformation,[],[f126]) ).
fof(f188,plain,
! [X2,X0,X1] :
( push = X2
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f129]) ).
fof(f189,plain,
! [X2,X0,X1] :
( forwards = X1
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f129]) ).
fof(f192,plain,
! [X2,X0,X1] :
( pull = X0
| sP1(X2,X1,X0)
| sP0(X2,X1,X0)
| ~ initiates(X0,X1,X2) ),
inference(cnf_transformation,[],[f131]) ).
fof(f204,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| ~ sP5(X0,X1,X2) ),
inference(cnf_transformation,[],[f134]) ).
fof(f214,plain,
! [X2,X0,X1] :
( sP5(X0,X1,X2)
| ~ happens(push,X0)
| backwards != X1
| pull != X2 ),
inference(cnf_transformation,[],[f140]) ).
fof(f228,plain,
! [X2,X0,X1] :
( terminates(X0,X1,X2)
| ~ sP7(X2,X1,X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f238,plain,
! [X0,X1] :
( sP9(X0,X1)
| ~ sP8(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f244,plain,
! [X0,X1] :
( sP8(X0,X1)
| n0 != X0
| push != X1 ),
inference(cnf_transformation,[],[f156]) ).
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(f248,plain,
forwards != backwards,
inference(cnf_transformation,[],[f18]) ).
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(f288,plain,
~ holdsAt(backwards,n0),
inference(cnf_transformation,[],[f45]) ).
fof(f290,plain,
! [X0,X1] : ~ releasedAt(X0,X1),
inference(cnf_transformation,[],[f78]) ).
fof(f291,plain,
holdsAt(backwards,n1),
inference(cnf_transformation,[],[f79]) ).
fof(f302,plain,
! [X2,X0] :
( sP5(X0,backwards,X2)
| ~ happens(push,X0)
| pull != X2 ),
inference(equality_resolution,[],[f214]) ).
fof(f303,plain,
! [X0] :
( sP5(X0,backwards,pull)
| ~ happens(push,X0) ),
inference(equality_resolution,[],[f302]) ).
fof(f316,plain,
! [X1] :
( sP8(n0,X1)
| push != X1 ),
inference(equality_resolution,[],[f244]) ).
fof(f317,plain,
sP8(n0,push),
inference(equality_resolution,[],[f316]) ).
cnf(c_51,plain,
( ~ holdsAt(X0,plus(X1,n1))
| initiates(sK11(X0,X1),X0,X1)
| releasedAt(X0,plus(X1,n1))
| holdsAt(X0,X1) ),
inference(cnf_transformation,[],[f174]) ).
cnf(c_52,plain,
( ~ holdsAt(X0,plus(X1,n1))
| happens(sK11(X0,X1),X1)
| releasedAt(X0,plus(X1,n1))
| holdsAt(X0,X1) ),
inference(cnf_transformation,[],[f173]) ).
cnf(c_53,plain,
( ~ releasedAt(X0,X1)
| terminates(sK12(X0,X1),X0,X1)
| initiates(sK12(X0,X1),X0,X1)
| releasedAt(X0,plus(X1,n1)) ),
inference(cnf_transformation,[],[f176]) ).
cnf(c_58,plain,
( ~ holdsAt(X0,plus(X1,n1))
| ~ terminates(X2,X0,X1)
| ~ happens(X2,X1) ),
inference(cnf_transformation,[],[f180]) ).
cnf(c_65,plain,
( ~ sP1(X0,X1,X2)
| X2 = pull ),
inference(cnf_transformation,[],[f184]) ).
cnf(c_68,plain,
( ~ sP0(X0,X1,X2)
| X1 = forwards ),
inference(cnf_transformation,[],[f189]) ).
cnf(c_69,plain,
( ~ sP0(X0,X1,X2)
| X2 = push ),
inference(cnf_transformation,[],[f188]) ).
cnf(c_75,plain,
( ~ initiates(X0,X1,X2)
| X0 = pull
| sP1(X2,X1,X0)
| sP0(X2,X1,X0) ),
inference(cnf_transformation,[],[f192]) ).
cnf(c_78,plain,
( ~ sP5(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(cnf_transformation,[],[f204]) ).
cnf(c_89,plain,
( ~ happens(push,X0)
| sP5(X0,backwards,pull) ),
inference(cnf_transformation,[],[f303]) ).
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_120,plain,
sP8(n0,push),
inference(cnf_transformation,[],[f317]) ).
cnf(c_123,plain,
( ~ sP9(X0,X1)
| happens(X1,X0) ),
inference(cnf_transformation,[],[f246]) ).
cnf(c_125,plain,
pull != push,
inference(cnf_transformation,[],[f247]) ).
cnf(c_126,plain,
backwards != forwards,
inference(cnf_transformation,[],[f248]) ).
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_166,plain,
~ holdsAt(backwards,n0),
inference(cnf_transformation,[],[f288]) ).
cnf(c_168,plain,
~ releasedAt(X0,X1),
inference(cnf_transformation,[],[f290]) ).
cnf(c_169,negated_conjecture,
holdsAt(backwards,n1),
inference(cnf_transformation,[],[f291]) ).
cnf(c_279,plain,
~ releasedAt(X0,X1),
inference(global_subsumption_just,[status(thm)],[c_53,c_168]) ).
cnf(c_338,plain,
( ~ happens(push,X0)
| sP5(X0,backwards,pull) ),
inference(prop_impl_just,[status(thm)],[c_89]) ).
cnf(c_356,plain,
( ~ sP1(X0,X1,X2)
| X2 = pull ),
inference(prop_impl_just,[status(thm)],[c_65]) ).
cnf(c_380,plain,
( ~ sP7(X0,X1,X2)
| terminates(X2,X1,X0) ),
inference(prop_impl_just,[status(thm)],[c_105]) ).
cnf(c_396,plain,
( ~ sP5(X0,X1,X2)
| sP7(X0,X1,X2) ),
inference(prop_impl_just,[status(thm)],[c_78]) ).
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_701,plain,
( ~ holdsAt(X0,plus(X1,n1))
| initiates(sK11(X0,X1),X0,X1)
| holdsAt(X0,X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_51,c_279]) ).
cnf(c_702,plain,
( ~ holdsAt(X0,plus(X1,n1))
| happens(sK11(X0,X1),X1)
| holdsAt(X0,X1) ),
inference(backward_subsumption_resolution,[status(thm)],[c_52,c_279]) ).
cnf(c_900,plain,
( ~ initiates(X0,X1,X2)
| X0 = pull
| sP0(X2,X1,X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_75,c_356]) ).
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_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_2062,plain,
( X0 != X1
| X2 != backwards
| X3 != pull
| ~ happens(push,X1)
| sP7(X0,X2,X3) ),
inference(resolution_lifted,[status(thm)],[c_396,c_338]) ).
cnf(c_2063,plain,
( ~ happens(push,X0)
| sP7(X0,backwards,pull) ),
inference(unflattening,[status(thm)],[c_2062]) ).
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_4674,plain,
( ~ happens(push,X0)
| sP7(X0,backwards,pull) ),
inference(prop_impl_just,[status(thm)],[c_2063]) ).
cnf(c_7304,negated_conjecture,
holdsAt(backwards,n1),
inference(demodulation,[status(thm)],[c_169]) ).
cnf(c_8815,plain,
( ~ holdsAt(X0,plus(n1,X1))
| happens(sK11(X0,X1),X1)
| holdsAt(X0,X1) ),
inference(superposition,[status(thm)],[c_139,c_702]) ).
cnf(c_9008,plain,
( ~ holdsAt(X0,plus(n1,X1))
| ~ sP7(X1,X0,X2)
| ~ happens(X2,X1) ),
inference(superposition,[status(thm)],[c_139,c_1538]) ).
cnf(c_9147,plain,
( ~ holdsAt(X0,plus(X1,n1))
| sK11(X0,X1) = pull
| sP0(X1,X0,sK11(X0,X1))
| holdsAt(X0,X1) ),
inference(superposition,[status(thm)],[c_701,c_900]) ).
cnf(c_9207,plain,
( ~ holdsAt(X0,plus(X1,n1))
| sK11(X0,X1) = pull
| sK11(X0,X1) = push
| holdsAt(X0,X1) ),
inference(superposition,[status(thm)],[c_9147,c_69]) ).
cnf(c_9335,plain,
( ~ holdsAt(X0,plus(n1,X1))
| sK11(X0,X1) = pull
| sK11(X0,X1) = push
| holdsAt(X0,X1) ),
inference(superposition,[status(thm)],[c_139,c_9207]) ).
cnf(c_10122,plain,
( ~ holdsAt(X0,n1)
| sK11(X0,n0) = pull
| sK11(X0,n0) = push
| holdsAt(X0,n0) ),
inference(superposition,[status(thm)],[c_1237,c_9335]) ).
cnf(c_11989,plain,
( sK11(backwards,n0) = pull
| sK11(backwards,n0) = push
| holdsAt(backwards,n0) ),
inference(superposition,[status(thm)],[c_7304,c_10122]) ).
cnf(c_11990,plain,
( sK11(backwards,n0) = pull
| sK11(backwards,n0) = push ),
inference(forward_subsumption_resolution,[status(thm)],[c_11989,c_166]) ).
cnf(c_12232,plain,
( ~ holdsAt(backwards,plus(n0,n1))
| sK11(backwards,n0) = pull
| initiates(push,backwards,n0)
| holdsAt(backwards,n0) ),
inference(superposition,[status(thm)],[c_11990,c_701]) ).
cnf(c_12233,plain,
( ~ holdsAt(backwards,plus(n0,n1))
| sK11(backwards,n0) = pull
| initiates(push,backwards,n0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12232,c_166]) ).
cnf(c_12243,plain,
( ~ holdsAt(backwards,n1)
| sK11(backwards,n0) = pull
| initiates(push,backwards,n0) ),
inference(demodulation,[status(thm)],[c_12233,c_139,c_1237]) ).
cnf(c_12244,plain,
( sK11(backwards,n0) = pull
| initiates(push,backwards,n0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12243,c_7304]) ).
cnf(c_12251,plain,
( sK11(backwards,n0) = pull
| pull = push
| sP0(n0,backwards,push) ),
inference(superposition,[status(thm)],[c_12244,c_900]) ).
cnf(c_12253,plain,
( sK11(backwards,n0) = pull
| sP0(n0,backwards,push) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12251,c_125]) ).
cnf(c_12265,plain,
( sK11(backwards,n0) = pull
| backwards = forwards ),
inference(superposition,[status(thm)],[c_12253,c_68]) ).
cnf(c_12269,plain,
sK11(backwards,n0) = pull,
inference(forward_subsumption_resolution,[status(thm)],[c_12265,c_126]) ).
cnf(c_17626,plain,
( ~ holdsAt(X0,n1)
| happens(sK11(X0,n0),n0)
| holdsAt(X0,n0) ),
inference(superposition,[status(thm)],[c_1237,c_8815]) ).
cnf(c_17668,plain,
( ~ holdsAt(backwards,n1)
| holdsAt(backwards,n0)
| happens(pull,n0) ),
inference(superposition,[status(thm)],[c_12269,c_17626]) ).
cnf(c_17671,plain,
happens(pull,n0),
inference(forward_subsumption_resolution,[status(thm)],[c_17668,c_166,c_7304]) ).
cnf(c_19903,plain,
( ~ sP7(n0,X0,X1)
| ~ holdsAt(X0,n1)
| ~ happens(X1,n0) ),
inference(superposition,[status(thm)],[c_1237,c_9008]) ).
cnf(c_20054,plain,
( ~ holdsAt(backwards,n1)
| ~ happens(pull,n0)
| ~ happens(push,n0) ),
inference(superposition,[status(thm)],[c_4674,c_19903]) ).
cnf(c_20057,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_20054,c_2608,c_17671,c_7304]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR015+1 : TPTP v8.2.0. Bugfixed v3.1.0.
% 0.00/0.12 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jun 19 18:50:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.75/1.19 % SZS status Started for theBenchmark.p
% 3.75/1.19 % SZS status Theorem for theBenchmark.p
% 3.75/1.19
% 3.75/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.75/1.19
% 3.75/1.19 ------ iProver source info
% 3.75/1.19
% 3.75/1.19 git: date: 2024-06-12 09:56:46 +0000
% 3.75/1.19 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 3.75/1.19 git: non_committed_changes: false
% 3.75/1.19
% 3.75/1.19 ------ Parsing...
% 3.75/1.19 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.75/1.19
% 3.75/1.19 ------ 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
% 3.75/1.19
% 3.75/1.19 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.75/1.19
% 3.75/1.19 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.75/1.19 ------ Proving...
% 3.75/1.19 ------ Problem Properties
% 3.75/1.19
% 3.75/1.19
% 3.75/1.19 clauses 82
% 3.75/1.19 conjectures 1
% 3.75/1.19 EPR 65
% 3.75/1.19 Horn 56
% 3.75/1.19 unary 27
% 3.75/1.19 binary 31
% 3.75/1.19 lits 177
% 3.75/1.19 lits eq 54
% 3.75/1.19 fd_pure 0
% 3.75/1.19 fd_pseudo 0
% 3.75/1.19 fd_cond 18
% 3.75/1.19 fd_pseudo_cond 2
% 3.75/1.19 AC symbols 0
% 3.75/1.19
% 3.75/1.19 ------ Schedule dynamic 5 is on
% 3.75/1.19
% 3.75/1.19 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.75/1.19
% 3.75/1.19
% 3.75/1.19 ------
% 3.75/1.19 Current options:
% 3.75/1.19 ------
% 3.75/1.19
% 3.75/1.19
% 3.75/1.19
% 3.75/1.19
% 3.75/1.19 ------ Proving...
% 3.75/1.19
% 3.75/1.19
% 3.75/1.19 % SZS status Theorem for theBenchmark.p
% 3.75/1.19
% 3.75/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.75/1.19
% 3.75/1.19
%------------------------------------------------------------------------------