TSTP Solution File: CSR015+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : CSR015+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 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 : Wed Aug 31 15:58:31 EDT 2022
% Result : Theorem 0.18s 0.52s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of formulae : 72 ( 22 unt; 0 def)
% Number of atoms : 308 ( 134 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 349 ( 113 ~; 126 |; 97 &)
% ( 10 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 109 ( 104 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f899,plain,
$false,
inference(subsumption_resolution,[],[f897,f290]) ).
fof(f290,plain,
backwards != spinning,
inference(cnf_transformation,[],[f20]) ).
fof(f20,axiom,
backwards != spinning,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',spinning_not_backwards) ).
fof(f897,plain,
backwards = spinning,
inference(resolution,[],[f882,f202]) ).
fof(f202,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| spinning = X1 ),
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
! [X0,X1,X2] :
( ( sP0(X0,X1,X2)
| ~ happens(push,X0)
| spinning != X1
| pull != X2 )
& ( ( happens(push,X0)
& spinning = X1
& pull = X2 )
| ~ sP0(X0,X1,X2) ) ),
inference(rectify,[],[f129]) ).
fof(f129,plain,
! [X0,X2,X1] :
( ( sP0(X0,X2,X1)
| ~ happens(push,X0)
| spinning != X2
| pull != X1 )
& ( ( happens(push,X0)
& spinning = X2
& pull = X1 )
| ~ sP0(X0,X2,X1) ) ),
inference(flattening,[],[f128]) ).
fof(f128,plain,
! [X0,X2,X1] :
( ( sP0(X0,X2,X1)
| ~ happens(push,X0)
| spinning != X2
| pull != X1 )
& ( ( happens(push,X0)
& spinning = X2
& pull = X1 )
| ~ sP0(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f104]) ).
fof(f104,plain,
! [X0,X2,X1] :
( sP0(X0,X2,X1)
<=> ( happens(push,X0)
& spinning = X2
& pull = X1 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f882,plain,
sP0(n0,backwards,pull),
inference(subsumption_resolution,[],[f879,f285]) ).
fof(f285,plain,
forwards != backwards,
inference(cnf_transformation,[],[f18]) ).
fof(f18,axiom,
forwards != backwards,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',forwards_not_backwards) ).
fof(f879,plain,
( forwards = backwards
| sP0(n0,backwards,pull) ),
inference(resolution,[],[f855,f199]) ).
fof(f199,plain,
! [X2,X0,X1] :
( ~ sP1(X0,X1,X2)
| forwards = X0 ),
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
! [X0,X1,X2] :
( ( sP1(X0,X1,X2)
| forwards != X0
| happens(pull,X1)
| push != X2 )
& ( ( forwards = X0
& ~ happens(pull,X1)
& push = X2 )
| ~ sP1(X0,X1,X2) ) ),
inference(rectify,[],[f126]) ).
fof(f126,plain,
! [X2,X0,X1] :
( ( sP1(X2,X0,X1)
| forwards != X2
| happens(pull,X0)
| push != X1 )
& ( ( forwards = X2
& ~ happens(pull,X0)
& push = X1 )
| ~ sP1(X2,X0,X1) ) ),
inference(flattening,[],[f125]) ).
fof(f125,plain,
! [X2,X0,X1] :
( ( sP1(X2,X0,X1)
| forwards != X2
| happens(pull,X0)
| push != X1 )
& ( ( forwards = X2
& ~ happens(pull,X0)
& push = X1 )
| ~ sP1(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f105]) ).
fof(f105,plain,
! [X2,X0,X1] :
( sP1(X2,X0,X1)
<=> ( forwards = X2
& ~ happens(pull,X0)
& push = X1 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f855,plain,
( sP1(backwards,n0,pull)
| sP0(n0,backwards,pull) ),
inference(forward_demodulation,[],[f852,f851]) ).
fof(f851,plain,
pull = sK13(backwards,n0),
inference(subsumption_resolution,[],[f848,f285]) ).
fof(f848,plain,
( forwards = backwards
| pull = sK13(backwards,n0) ),
inference(resolution,[],[f844,f199]) ).
fof(f844,plain,
( sP1(backwards,n0,sK13(backwards,n0))
| pull = sK13(backwards,n0) ),
inference(subsumption_resolution,[],[f841,f201]) ).
fof(f201,plain,
! [X2,X0,X1] :
( ~ sP0(X0,X1,X2)
| pull = X2 ),
inference(cnf_transformation,[],[f130]) ).
fof(f841,plain,
( pull = sK13(backwards,n0)
| sP0(n0,backwards,sK13(backwards,n0))
| sP1(backwards,n0,sK13(backwards,n0)) ),
inference(resolution,[],[f838,f205]) ).
fof(f205,plain,
! [X2,X0,X1] :
( ~ initiates(X2,X1,X0)
| pull = X2
| sP1(X1,X0,X2)
| sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,plain,
! [X0,X1,X2] :
( ( initiates(X2,X1,X0)
| ( ( happens(push,X0)
| backwards != X1
| pull != X2 )
& ~ sP1(X1,X0,X2)
& ~ sP0(X0,X1,X2) ) )
& ( ( ~ happens(push,X0)
& backwards = X1
& pull = X2 )
| sP1(X1,X0,X2)
| sP0(X0,X1,X2)
| ~ initiates(X2,X1,X0) ) ),
inference(rectify,[],[f132]) ).
fof(f132,plain,
! [X0,X2,X1] :
( ( initiates(X1,X2,X0)
| ( ( happens(push,X0)
| backwards != X2
| pull != X1 )
& ~ sP1(X2,X0,X1)
& ~ sP0(X0,X2,X1) ) )
& ( ( ~ happens(push,X0)
& backwards = X2
& pull = X1 )
| sP1(X2,X0,X1)
| sP0(X0,X2,X1)
| ~ initiates(X1,X2,X0) ) ),
inference(flattening,[],[f131]) ).
fof(f131,plain,
! [X0,X2,X1] :
( ( initiates(X1,X2,X0)
| ( ( happens(push,X0)
| backwards != X2
| pull != X1 )
& ~ sP1(X2,X0,X1)
& ~ sP0(X0,X2,X1) ) )
& ( ( ~ happens(push,X0)
& backwards = X2
& pull = X1 )
| sP1(X2,X0,X1)
| sP0(X0,X2,X1)
| ~ initiates(X1,X2,X0) ) ),
inference(nnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X0,X2,X1] :
( initiates(X1,X2,X0)
<=> ( ( ~ happens(push,X0)
& backwards = X2
& pull = X1 )
| sP1(X2,X0,X1)
| sP0(X0,X2,X1) ) ),
inference(definition_folding,[],[f74,f105,f104]) ).
fof(f74,plain,
! [X0,X2,X1] :
( initiates(X1,X2,X0)
<=> ( ( ~ happens(push,X0)
& backwards = X2
& pull = X1 )
| ( forwards = X2
& ~ happens(pull,X0)
& push = X1 )
| ( happens(push,X0)
& spinning = X2
& pull = X1 ) ) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X4,X3,X1] :
( ( ( forwards = X1
& ~ happens(pull,X4)
& push = X3 )
| ( spinning = X1
& happens(push,X4)
& pull = X3 )
| ( pull = X3
& backwards = X1
& ~ happens(push,X4) ) )
<=> initiates(X3,X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initiates_all_defn) ).
fof(f838,plain,
initiates(sK13(backwards,n0),backwards,n0),
inference(subsumption_resolution,[],[f837,f298]) ).
fof(f298,plain,
~ holdsAt(backwards,n0),
inference(cnf_transformation,[],[f45]) ).
fof(f45,axiom,
~ holdsAt(backwards,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_0) ).
fof(f837,plain,
( holdsAt(backwards,n0)
| initiates(sK13(backwards,n0),backwards,n0) ),
inference(resolution,[],[f656,f288]) ).
fof(f288,plain,
holdsAt(backwards,n1),
inference(cnf_transformation,[],[f72]) ).
fof(f72,plain,
holdsAt(backwards,n1),
inference(flattening,[],[f49]) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(backwards,n1),
inference(negated_conjecture,[],[f48]) ).
fof(f48,conjecture,
~ holdsAt(backwards,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_1) ).
fof(f656,plain,
! [X4] :
( ~ holdsAt(X4,n1)
| holdsAt(X4,n0)
| initiates(sK13(X4,n0),X4,n0) ),
inference(subsumption_resolution,[],[f654,f291]) ).
fof(f291,plain,
! [X0,X1] : ~ releasedAt(X1,X0),
inference(cnf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X1] : ~ releasedAt(X1,X0),
inference(rectify,[],[f47]) ).
fof(f47,axiom,
! [X4,X1] : ~ releasedAt(X1,X4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_releasedAt) ).
fof(f654,plain,
! [X4] :
( releasedAt(X4,n1)
| holdsAt(X4,n0)
| initiates(sK13(X4,n0),X4,n0)
| ~ holdsAt(X4,n1) ),
inference(superposition,[],[f278,f214]) ).
fof(f214,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
n1 = plus(n0,n1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_1) ).
fof(f278,plain,
! [X0,X1] :
( ~ holdsAt(X0,plus(X1,n1))
| initiates(sK13(X0,X1),X0,X1)
| holdsAt(X0,X1)
| releasedAt(X0,plus(X1,n1)) ),
inference(cnf_transformation,[],[f174]) ).
fof(f174,plain,
! [X0,X1] :
( ~ holdsAt(X0,plus(X1,n1))
| releasedAt(X0,plus(X1,n1))
| ( happens(sK13(X0,X1),X1)
& initiates(sK13(X0,X1),X0,X1) )
| holdsAt(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f90,f173]) ).
fof(f173,plain,
! [X0,X1] :
( ? [X2] :
( happens(X2,X1)
& initiates(X2,X0,X1) )
=> ( happens(sK13(X0,X1),X1)
& initiates(sK13(X0,X1),X0,X1) ) ),
introduced(choice_axiom,[]) ).
fof(f90,plain,
! [X0,X1] :
( ~ holdsAt(X0,plus(X1,n1))
| releasedAt(X0,plus(X1,n1))
| ? [X2] :
( happens(X2,X1)
& initiates(X2,X0,X1) )
| holdsAt(X0,X1) ),
inference(flattening,[],[f89]) ).
fof(f89,plain,
! [X1,X0] :
( ~ holdsAt(X0,plus(X1,n1))
| releasedAt(X0,plus(X1,n1))
| holdsAt(X0,X1)
| ? [X2] :
( happens(X2,X1)
& initiates(X2,X0,X1) ) ),
inference(ennf_transformation,[],[f66]) ).
fof(f66,plain,
! [X1,X0] :
( ( ~ releasedAt(X0,plus(X1,n1))
& ~ holdsAt(X0,X1)
& ~ ? [X2] :
( happens(X2,X1)
& initiates(X2,X0,X1) ) )
=> ~ holdsAt(X0,plus(X1,n1)) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X1,X4] :
( ( ~ releasedAt(X1,plus(X4,n1))
& ~ holdsAt(X1,X4)
& ~ ? [X3] :
( happens(X3,X4)
& initiates(X3,X1,X4) ) )
=> ~ holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',keep_not_holding) ).
fof(f852,plain,
( sP0(n0,backwards,pull)
| sP1(backwards,n0,sK13(backwards,n0)) ),
inference(backward_demodulation,[],[f845,f851]) ).
fof(f845,plain,
( sP1(backwards,n0,sK13(backwards,n0))
| sP0(n0,backwards,sK13(backwards,n0)) ),
inference(subsumption_resolution,[],[f839,f350]) ).
fof(f350,plain,
happens(push,n0),
inference(resolution,[],[f234,f310]) ).
fof(f310,plain,
sP3(n0,push),
inference(equality_resolution,[],[f309]) ).
fof(f309,plain,
! [X1] :
( sP3(n0,X1)
| push != X1 ),
inference(equality_resolution,[],[f229]) ).
fof(f229,plain,
! [X0,X1] :
( sP3(X0,X1)
| n0 != X0
| push != X1 ),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
! [X0,X1] :
( ( sP3(X0,X1)
| ( ( n0 != X0
| push != X1 )
& ( push != X1
| n2 != X0 )
& ( n1 != X0
| pull != X1 )
& ~ sP2(X0,X1) ) )
& ( ( n0 = X0
& push = X1 )
| ( push = X1
& n2 = X0 )
| ( n1 = X0
& pull = X1 )
| sP2(X0,X1)
| ~ sP3(X0,X1) ) ),
inference(rectify,[],[f140]) ).
fof(f140,plain,
! [X1,X0] :
( ( sP3(X1,X0)
| ( ( n0 != X1
| push != X0 )
& ( push != X0
| n2 != X1 )
& ( n1 != X1
| pull != X0 )
& ~ sP2(X1,X0) ) )
& ( ( n0 = X1
& push = X0 )
| ( push = X0
& n2 = X1 )
| ( n1 = X1
& pull = X0 )
| sP2(X1,X0)
| ~ sP3(X1,X0) ) ),
inference(flattening,[],[f139]) ).
fof(f139,plain,
! [X1,X0] :
( ( sP3(X1,X0)
| ( ( n0 != X1
| push != X0 )
& ( push != X0
| n2 != X1 )
& ( n1 != X1
| pull != X0 )
& ~ sP2(X1,X0) ) )
& ( ( n0 = X1
& push = X0 )
| ( push = X0
& n2 = X1 )
| ( n1 = X1
& pull = X0 )
| sP2(X1,X0)
| ~ sP3(X1,X0) ) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X1,X0] :
( sP3(X1,X0)
<=> ( ( n0 = X1
& push = X0 )
| ( push = X0
& n2 = X1 )
| ( n1 = X1
& pull = X0 )
| sP2(X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f234,plain,
! [X0,X1] :
( ~ sP3(X0,X1)
| happens(X1,X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0,X1] :
( ( happens(X1,X0)
| ~ sP3(X0,X1) )
& ( sP3(X0,X1)
| ~ happens(X1,X0) ) ),
inference(rectify,[],[f145]) ).
fof(f145,plain,
! [X1,X0] :
( ( happens(X0,X1)
| ~ sP3(X1,X0) )
& ( sP3(X1,X0)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X1,X0] :
( happens(X0,X1)
<=> sP3(X1,X0) ),
inference(definition_folding,[],[f59,f108,f107]) ).
fof(f107,plain,
! [X1,X0] :
( sP2(X1,X0)
<=> ( n2 = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f59,plain,
! [X1,X0] :
( happens(X0,X1)
<=> ( ( n0 = X1
& push = X0 )
| ( push = X0
& n2 = X1 )
| ( n1 = X1
& pull = X0 )
| ( n2 = X1
& pull = X0 ) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X3,X4] :
( happens(X3,X4)
<=> ( ( n0 = X4
& push = X3 )
| ( n1 = X4
& pull = X3 )
| ( n2 = X4
& push = X3 )
| ( n2 = X4
& pull = X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f839,plain,
( sP1(backwards,n0,sK13(backwards,n0))
| sP0(n0,backwards,sK13(backwards,n0))
| ~ happens(push,n0) ),
inference(resolution,[],[f838,f207]) ).
fof(f207,plain,
! [X2,X0,X1] :
( ~ initiates(X2,X1,X0)
| sP1(X1,X0,X2)
| ~ happens(push,X0)
| sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f133]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : CSR015+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 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 : Mon Aug 29 17:03:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.48 % (14793)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.18/0.48 % (14785)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.18/0.48 % (14776)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.49 % (14784)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.18/0.49 % (14777)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.18/0.49 TRYING [3]
% 0.18/0.49 % (14792)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.18/0.50 % (14777)Instruction limit reached!
% 0.18/0.50 % (14777)------------------------------
% 0.18/0.50 % (14777)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (14777)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (14777)Termination reason: Unknown
% 0.18/0.50 % (14777)Termination phase: Saturation
% 0.18/0.50
% 0.18/0.50 % (14777)Memory used [KB]: 5628
% 0.18/0.50 % (14777)Time elapsed: 0.080 s
% 0.18/0.50 % (14777)Instructions burned: 8 (million)
% 0.18/0.50 % (14777)------------------------------
% 0.18/0.50 % (14777)------------------------------
% 0.18/0.51 TRYING [4]
% 0.18/0.51 % (14774)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.51 % (14785)First to succeed.
% 0.18/0.52 % (14791)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.18/0.52 % (14785)Refutation found. Thanks to Tanya!
% 0.18/0.52 % SZS status Theorem for theBenchmark
% 0.18/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.52 % (14785)------------------------------
% 0.18/0.52 % (14785)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (14785)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (14785)Termination reason: Refutation
% 0.18/0.52
% 0.18/0.52 % (14785)Memory used [KB]: 1407
% 0.18/0.52 % (14785)Time elapsed: 0.087 s
% 0.18/0.52 % (14785)Instructions burned: 23 (million)
% 0.18/0.52 % (14785)------------------------------
% 0.18/0.52 % (14785)------------------------------
% 0.18/0.52 % (14766)Success in time 0.177 s
%------------------------------------------------------------------------------