TSTP Solution File: CSR022+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : CSR022+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n012.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 : Sun May 5 04:56:51 EDT 2024
% Result : Theorem 0.21s 0.40s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 63 ( 20 unt; 0 def)
% Number of atoms : 274 ( 110 equ)
% Maximal formula atoms : 19 ( 4 avg)
% Number of connectives : 310 ( 99 ~; 100 |; 93 &)
% ( 16 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-2 aty)
% Number of variables : 110 ( 110 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2012,plain,
$false,
inference(subsumption_resolution,[],[f2011,f184]) ).
fof(f184,plain,
holdsAt(forwards,n3),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
holdsAt(forwards,n3),
inference(flattening,[],[f49]) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(forwards,n3),
inference(negated_conjecture,[],[f48]) ).
fof(f48,conjecture,
~ holdsAt(forwards,n3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_forwards_3) ).
fof(f2011,plain,
~ holdsAt(forwards,n3),
inference(forward_demodulation,[],[f2010,f195]) ).
fof(f195,plain,
n3 = plus(n1,n2),
inference(cnf_transformation,[],[f26]) ).
fof(f26,axiom,
n3 = plus(n1,n2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_2) ).
fof(f2010,plain,
~ holdsAt(forwards,plus(n1,n2)),
inference(forward_demodulation,[],[f1998,f222]) ).
fof(f222,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0,X1] : plus(X0,X1) = plus(X1,X0),
inference(rectify,[],[f31]) ).
fof(f31,axiom,
! [X8,X9] : plus(X8,X9) = plus(X9,X8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).
fof(f1998,plain,
~ holdsAt(forwards,plus(n2,n1)),
inference(unit_resulting_resolution,[],[f903,f1047,f256]) ).
fof(f256,plain,
! [X2,X0,X1] :
( ~ terminates(X0,X2,X1)
| ~ holdsAt(X2,plus(X1,n1))
| ~ happens(X0,X1) ),
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(flattening,[],[f97]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ holdsAt(X2,plus(X1,n1))
| ~ terminates(X0,X2,X1)
| ~ happens(X0,X1) ),
inference(ennf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ( terminates(X0,X2,X1)
& happens(X0,X1) )
=> ~ holdsAt(X2,plus(X1,n1)) ),
inference(rectify,[],[f10]) ).
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(f1047,plain,
terminates(pull,forwards,n2),
inference(unit_resulting_resolution,[],[f985,f287]) ).
fof(f287,plain,
! [X2,X0,X1] :
( ~ sP6(X2,X1,X0)
| terminates(X0,X1,X2) ),
inference(cnf_transformation,[],[f172]) ).
fof(f172,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ( ~ sP9(X2,X1,X0)
& ~ sP8(X2,X1,X0)
& ~ sP7(X2,X1,X0)
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0) ) )
& ( sP9(X2,X1,X0)
| sP8(X2,X1,X0)
| sP7(X2,X1,X0)
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| ~ terminates(X0,X1,X2) ) ),
inference(flattening,[],[f171]) ).
fof(f171,plain,
! [X0,X1,X2] :
( ( terminates(X0,X1,X2)
| ( ~ sP9(X2,X1,X0)
& ~ sP8(X2,X1,X0)
& ~ sP7(X2,X1,X0)
& ~ sP6(X2,X1,X0)
& ~ sP5(X2,X1,X0)
& ~ sP4(X2,X1,X0) ) )
& ( sP9(X2,X1,X0)
| sP8(X2,X1,X0)
| sP7(X2,X1,X0)
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0)
| ~ terminates(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X0,X1,X2] :
( terminates(X0,X1,X2)
<=> ( sP9(X2,X1,X0)
| sP8(X2,X1,X0)
| sP7(X2,X1,X0)
| sP6(X2,X1,X0)
| sP5(X2,X1,X0)
| sP4(X2,X1,X0) ) ),
inference(definition_folding,[],[f76,f113,f112,f111,f110,f109,f108]) ).
fof(f108,plain,
! [X2,X1,X0] :
( sP4(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& backwards = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f109,plain,
! [X2,X1,X0] :
( sP5(X2,X1,X0)
<=> ( ~ happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).
fof(f110,plain,
! [X2,X1,X0] :
( sP6(X2,X1,X0)
<=> ( happens(push,X2)
& forwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f111,plain,
! [X2,X1,X0] :
( sP7(X2,X1,X0)
<=> ( happens(push,X2)
& backwards = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP7])]) ).
fof(f112,plain,
! [X2,X1,X0] :
( sP8(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& spinning = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP8])]) ).
fof(f113,plain,
! [X2,X1,X0] :
( sP9(X2,X1,X0)
<=> ( ~ happens(push,X2)
& spinning = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])]) ).
fof(f76,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(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(f985,plain,
sP6(n2,forwards,pull),
inference(unit_resulting_resolution,[],[f900,f324]) ).
fof(f324,plain,
! [X0] :
( ~ happens(push,X0)
| sP6(X0,forwards,pull) ),
inference(equality_resolution,[],[f323]) ).
fof(f323,plain,
! [X2,X0] :
( sP6(X0,forwards,X2)
| ~ happens(push,X0)
| pull != X2 ),
inference(equality_resolution,[],[f275]) ).
fof(f275,plain,
! [X2,X0,X1] :
( sP6(X0,X1,X2)
| ~ happens(push,X0)
| forwards != X1
| pull != X2 ),
inference(cnf_transformation,[],[f164]) ).
fof(f164,plain,
! [X0,X1,X2] :
( ( sP6(X0,X1,X2)
| ~ happens(push,X0)
| forwards != X1
| pull != X2 )
& ( ( happens(push,X0)
& forwards = X1
& pull = X2 )
| ~ sP6(X0,X1,X2) ) ),
inference(rectify,[],[f163]) ).
fof(f163,plain,
! [X2,X1,X0] :
( ( sP6(X2,X1,X0)
| ~ happens(push,X2)
| forwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& forwards = X1
& pull = X0 )
| ~ sP6(X2,X1,X0) ) ),
inference(flattening,[],[f162]) ).
fof(f162,plain,
! [X2,X1,X0] :
( ( sP6(X2,X1,X0)
| ~ happens(push,X2)
| forwards != X1
| pull != X0 )
& ( ( happens(push,X2)
& forwards = X1
& pull = X0 )
| ~ sP6(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f110]) ).
fof(f900,plain,
happens(push,n2),
inference(unit_resulting_resolution,[],[f310,f253]) ).
fof(f253,plain,
! [X0,X1] :
( ~ sP3(X1,X0)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f152]) ).
fof(f152,plain,
! [X0,X1] :
( ( happens(X0,X1)
| ~ sP3(X1,X0) )
& ( sP3(X1,X0)
| ~ happens(X0,X1) ) ),
inference(nnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0,X1] :
( happens(X0,X1)
<=> sP3(X1,X0) ),
inference(definition_folding,[],[f69,f106,f105,f104,f103]) ).
fof(f103,plain,
! [X1,X0] :
( sP0(X1,X0)
<=> ( n0 = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f104,plain,
! [X1,X0] :
( sP1(X1,X0)
<=> ( n1 = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f105,plain,
! [X1,X0] :
( sP2(X1,X0)
<=> ( n2 = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f106,plain,
! [X1,X0] :
( sP3(X1,X0)
<=> ( ( n2 = X1
& push = X0 )
| sP2(X1,X0)
| sP1(X1,X0)
| sP0(X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f69,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(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(f310,plain,
sP3(n2,push),
inference(equality_resolution,[],[f309]) ).
fof(f309,plain,
! [X1] :
( sP3(n2,X1)
| push != X1 ),
inference(equality_resolution,[],[f242]) ).
fof(f242,plain,
! [X0,X1] :
( sP3(X0,X1)
| n2 != X0
| push != X1 ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0,X1] :
( ( sP3(X0,X1)
| ( ( n2 != X0
| push != X1 )
& ~ sP2(X0,X1)
& ~ sP1(X0,X1)
& ~ sP0(X0,X1) ) )
& ( ( n2 = X0
& push = X1 )
| sP2(X0,X1)
| sP1(X0,X1)
| sP0(X0,X1)
| ~ sP3(X0,X1) ) ),
inference(rectify,[],[f141]) ).
fof(f141,plain,
! [X1,X0] :
( ( sP3(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ~ sP2(X1,X0)
& ~ sP1(X1,X0)
& ~ sP0(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| sP2(X1,X0)
| sP1(X1,X0)
| sP0(X1,X0)
| ~ sP3(X1,X0) ) ),
inference(flattening,[],[f140]) ).
fof(f140,plain,
! [X1,X0] :
( ( sP3(X1,X0)
| ( ( n2 != X1
| push != X0 )
& ~ sP2(X1,X0)
& ~ sP1(X1,X0)
& ~ sP0(X1,X0) ) )
& ( ( n2 = X1
& push = X0 )
| sP2(X1,X0)
| sP1(X1,X0)
| sP0(X1,X0)
| ~ sP3(X1,X0) ) ),
inference(nnf_transformation,[],[f106]) ).
fof(f903,plain,
happens(pull,n2),
inference(unit_resulting_resolution,[],[f883,f253]) ).
fof(f883,plain,
sP3(n2,pull),
inference(unit_resulting_resolution,[],[f312,f241]) ).
fof(f241,plain,
! [X0,X1] :
( ~ sP2(X0,X1)
| sP3(X0,X1) ),
inference(cnf_transformation,[],[f142]) ).
fof(f312,plain,
sP2(n2,pull),
inference(equality_resolution,[],[f311]) ).
fof(f311,plain,
! [X1] :
( sP2(n2,X1)
| pull != X1 ),
inference(equality_resolution,[],[f245]) ).
fof(f245,plain,
! [X0,X1] :
( sP2(X0,X1)
| n2 != X0
| pull != X1 ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
! [X0,X1] :
( ( sP2(X0,X1)
| n2 != X0
| pull != X1 )
& ( ( n2 = X0
& pull = X1 )
| ~ sP2(X0,X1) ) ),
inference(rectify,[],[f144]) ).
fof(f144,plain,
! [X1,X0] :
( ( sP2(X1,X0)
| n2 != X1
| pull != X0 )
& ( ( n2 = X1
& pull = X0 )
| ~ sP2(X1,X0) ) ),
inference(flattening,[],[f143]) ).
fof(f143,plain,
! [X1,X0] :
( ( sP2(X1,X0)
| n2 != X1
| pull != X0 )
& ( ( n2 = X1
& pull = X0 )
| ~ sP2(X1,X0) ) ),
inference(nnf_transformation,[],[f105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CSR022+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.06/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 20:14:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (18297)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (18300)WARNING: value z3 for option sas not known
% 0.14/0.37 % (18299)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37 % (18301)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37 % (18298)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37 % (18300)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.37 % (18303)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.14/0.37 % (18302)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.14/0.37 % (18304)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.14/0.38 Detected minimum model sizes of [3]
% 0.14/0.38 Detected maximum model sizes of [max]
% 0.14/0.38 TRYING [3]
% 0.21/0.39 TRYING [4]
% 0.21/0.40 % (18304)First to succeed.
% 0.21/0.40 % (18304)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-18297"
% 0.21/0.40 % (18304)Refutation found. Thanks to Tanya!
% 0.21/0.40 % SZS status Theorem for theBenchmark
% 0.21/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.40 % (18304)------------------------------
% 0.21/0.40 % (18304)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.40 % (18304)Termination reason: Refutation
% 0.21/0.40
% 0.21/0.40 % (18304)Memory used [KB]: 1196
% 0.21/0.40 % (18304)Time elapsed: 0.030 s
% 0.21/0.40 % (18304)Instructions burned: 55 (million)
% 0.21/0.40 % (18297)Success in time 0.037 s
%------------------------------------------------------------------------------