TSTP Solution File: CSR017+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : CSR017+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 : n028.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 1.67s 0.60s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 23
% Syntax : Number of formulae : 111 ( 28 unt; 0 def)
% Number of atoms : 429 ( 170 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 480 ( 162 ~; 172 |; 121 &)
% ( 23 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 18 ( 16 usr; 4 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 151 ( 149 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3615,plain,
$false,
inference(avatar_sat_refutation,[],[f3477,f3548,f3553,f3612]) ).
fof(f3612,plain,
~ spl14_7,
inference(avatar_contradiction_clause,[],[f3611]) ).
fof(f3611,plain,
( $false
| ~ spl14_7 ),
inference(subsumption_resolution,[],[f3565,f284]) ).
fof(f284,plain,
! [X0] : ~ less(X0,n0),
inference(cnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] : ~ less(X0,n0),
inference(ennf_transformation,[],[f74]) ).
fof(f74,plain,
~ ? [X0] : less(X0,n0),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
~ ? [X8] : less(X8,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less0) ).
fof(f3565,plain,
( less(n0,n0)
| ~ spl14_7 ),
inference(superposition,[],[f381,f3476]) ).
fof(f3476,plain,
( n0 = n2
| ~ spl14_7 ),
inference(avatar_component_clause,[],[f3474]) ).
fof(f3474,plain,
( spl14_7
<=> n0 = n2 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_7])]) ).
fof(f381,plain,
less(n0,n2),
inference(resolution,[],[f244,f355]) ).
fof(f355,plain,
less_or_equal(n0,n1),
inference(resolution,[],[f353,f193]) ).
fof(f193,plain,
! [X0,X1] :
( ~ less(X0,X1)
| less_or_equal(X0,X1) ),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0,X1] :
( ( less_or_equal(X0,X1)
| ( ~ less(X0,X1)
& X0 != X1 ) )
& ( less(X0,X1)
| X0 = X1
| ~ less_or_equal(X0,X1) ) ),
inference(rectify,[],[f121]) ).
fof(f121,plain,
! [X1,X0] :
( ( less_or_equal(X1,X0)
| ( ~ less(X1,X0)
& X0 != X1 ) )
& ( less(X1,X0)
| X0 = X1
| ~ less_or_equal(X1,X0) ) ),
inference(flattening,[],[f120]) ).
fof(f120,plain,
! [X1,X0] :
( ( less_or_equal(X1,X0)
| ( ~ less(X1,X0)
& X0 != X1 ) )
& ( less(X1,X0)
| X0 = X1
| ~ less_or_equal(X1,X0) ) ),
inference(nnf_transformation,[],[f70]) ).
fof(f70,plain,
! [X1,X0] :
( less_or_equal(X1,X0)
<=> ( less(X1,X0)
| X0 = X1 ) ),
inference(rectify,[],[f32]) ).
fof(f32,axiom,
! [X9,X8] :
( ( X8 = X9
| less(X8,X9) )
<=> less_or_equal(X8,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
fof(f353,plain,
less(n0,n1),
inference(resolution,[],[f215,f303]) ).
fof(f303,plain,
! [X1] : less_or_equal(X1,X1),
inference(equality_resolution,[],[f192]) ).
fof(f192,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f122]) ).
fof(f215,plain,
! [X0] :
( ~ less_or_equal(X0,n0)
| less(X0,n1) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ( less_or_equal(X0,n0)
| ~ less(X0,n1) )
& ( less(X0,n1)
| ~ less_or_equal(X0,n0) ) ),
inference(nnf_transformation,[],[f66]) ).
fof(f66,plain,
! [X0] :
( less_or_equal(X0,n0)
<=> less(X0,n1) ),
inference(rectify,[],[f34]) ).
fof(f34,axiom,
! [X8] :
( less(X8,n1)
<=> less_or_equal(X8,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
fof(f244,plain,
! [X0] :
( ~ less_or_equal(X0,n1)
| less(X0,n2) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ( less(X0,n2)
| ~ less_or_equal(X0,n1) )
& ( less_or_equal(X0,n1)
| ~ less(X0,n2) ) ),
inference(nnf_transformation,[],[f50]) ).
fof(f50,plain,
! [X0] :
( less(X0,n2)
<=> less_or_equal(X0,n1) ),
inference(rectify,[],[f35]) ).
fof(f35,axiom,
! [X8] :
( less(X8,n2)
<=> less_or_equal(X8,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
fof(f3553,plain,
~ spl14_6,
inference(avatar_contradiction_clause,[],[f3552]) ).
fof(f3552,plain,
( $false
| ~ spl14_6 ),
inference(subsumption_resolution,[],[f3550,f302]) ).
fof(f302,plain,
push != pull,
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',push_not_pull) ).
fof(f3550,plain,
( push = pull
| ~ spl14_6 ),
inference(resolution,[],[f3472,f233]) ).
fof(f233,plain,
! [X0,X1] :
( ~ sP2(X0,X1)
| push = X1 ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
! [X0,X1] :
( ( sP2(X0,X1)
| n0 != X0
| push != X1 )
& ( ( n0 = X0
& push = X1 )
| ~ sP2(X0,X1) ) ),
inference(rectify,[],[f142]) ).
fof(f142,plain,
! [X1,X0] :
( ( sP2(X1,X0)
| n0 != X1
| push != X0 )
& ( ( n0 = X1
& push = X0 )
| ~ sP2(X1,X0) ) ),
inference(flattening,[],[f141]) ).
fof(f141,plain,
! [X1,X0] :
( ( sP2(X1,X0)
| n0 != X1
| push != X0 )
& ( ( n0 = X1
& push = X0 )
| ~ sP2(X1,X0) ) ),
inference(nnf_transformation,[],[f106]) ).
fof(f106,plain,
! [X1,X0] :
( sP2(X1,X0)
<=> ( n0 = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f3472,plain,
( sP2(n0,pull)
| ~ spl14_6 ),
inference(avatar_component_clause,[],[f3470]) ).
fof(f3470,plain,
( spl14_6
<=> sP2(n0,pull) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_6])]) ).
fof(f3548,plain,
( spl14_7
| ~ spl14_5 ),
inference(avatar_split_clause,[],[f3547,f3466,f3474]) ).
fof(f3466,plain,
( spl14_5
<=> n0 = n1 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_5])]) ).
fof(f3547,plain,
( n0 = n2
| ~ spl14_5 ),
inference(forward_demodulation,[],[f3480,f190]) ).
fof(f190,plain,
n0 = plus(n0,n0),
inference(cnf_transformation,[],[f21]) ).
fof(f21,axiom,
n0 = plus(n0,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_0) ).
fof(f3480,plain,
( n2 = plus(n0,n0)
| ~ spl14_5 ),
inference(superposition,[],[f189,f3468]) ).
fof(f3468,plain,
( n0 = n1
| ~ spl14_5 ),
inference(avatar_component_clause,[],[f3466]) ).
fof(f189,plain,
n2 = plus(n1,n1),
inference(cnf_transformation,[],[f25]) ).
fof(f25,axiom,
n2 = plus(n1,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
fof(f3477,plain,
( spl14_5
| spl14_6
| spl14_7 ),
inference(avatar_split_clause,[],[f3462,f3474,f3470,f3466]) ).
fof(f3462,plain,
( n0 = n2
| sP2(n0,pull)
| n0 = n1 ),
inference(resolution,[],[f3458,f333]) ).
fof(f333,plain,
! [X0,X1] :
( ~ sP3(X0,X1)
| n2 = X0
| n1 = X0
| sP2(X0,X1) ),
inference(duplicate_literal_removal,[],[f225]) ).
fof(f225,plain,
! [X0,X1] :
( sP2(X0,X1)
| ~ sP3(X0,X1)
| n2 = X0
| n2 = X0
| n1 = X0 ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0,X1] :
( ( sP3(X0,X1)
| ( ( n2 != X0
| pull != X1 )
& ( push != X1
| n2 != X0 )
& ( pull != X1
| n1 != X0 )
& ~ sP2(X0,X1) ) )
& ( ( n2 = X0
& pull = X1 )
| ( push = X1
& n2 = X0 )
| ( pull = X1
& n1 = X0 )
| sP2(X0,X1)
| ~ sP3(X0,X1) ) ),
inference(rectify,[],[f139]) ).
fof(f139,plain,
! [X1,X0] :
( ( sP3(X1,X0)
| ( ( n2 != X1
| pull != X0 )
& ( push != X0
| n2 != X1 )
& ( pull != X0
| n1 != X1 )
& ~ sP2(X1,X0) ) )
& ( ( n2 = X1
& pull = X0 )
| ( push = X0
& n2 = X1 )
| ( pull = X0
& n1 = X1 )
| sP2(X1,X0)
| ~ sP3(X1,X0) ) ),
inference(flattening,[],[f138]) ).
fof(f138,plain,
! [X1,X0] :
( ( sP3(X1,X0)
| ( ( n2 != X1
| pull != X0 )
& ( push != X0
| n2 != X1 )
& ( pull != X0
| n1 != X1 )
& ~ sP2(X1,X0) ) )
& ( ( n2 = X1
& pull = X0 )
| ( push = X0
& n2 = X1 )
| ( pull = X0
& n1 = X1 )
| sP2(X1,X0)
| ~ sP3(X1,X0) ) ),
inference(nnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X1,X0] :
( sP3(X1,X0)
<=> ( ( n2 = X1
& pull = X0 )
| ( push = X0
& n2 = X1 )
| ( pull = X0
& n1 = X1 )
| sP2(X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f3458,plain,
sP3(n0,pull),
inference(resolution,[],[f3419,f237]) ).
fof(f237,plain,
! [X0,X1] :
( ~ happens(X0,X1)
| sP3(X1,X0) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
! [X0,X1] :
( ( sP3(X1,X0)
| ~ happens(X0,X1) )
& ( happens(X0,X1)
| ~ sP3(X1,X0) ) ),
inference(nnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0,X1] :
( sP3(X1,X0)
<=> happens(X0,X1) ),
inference(definition_folding,[],[f64,f107,f106]) ).
fof(f64,plain,
! [X0,X1] :
( ( ( n2 = X1
& pull = X0 )
| ( push = X0
& n2 = X1 )
| ( pull = X0
& n1 = X1 )
| ( n0 = X1
& push = X0 ) )
<=> happens(X0,X1) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X3,X4] :
( happens(X3,X4)
<=> ( ( n2 = X4
& push = X3 )
| ( pull = X3
& n1 = X4 )
| ( pull = X3
& n2 = X4 )
| ( push = X3
& n0 = X4 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).
fof(f3419,plain,
happens(pull,n0),
inference(subsumption_resolution,[],[f3418,f194]) ).
fof(f194,plain,
holdsAt(spinning,n1),
inference(cnf_transformation,[],[f67]) ).
fof(f67,plain,
holdsAt(spinning,n1),
inference(flattening,[],[f49]) ).
fof(f49,negated_conjecture,
~ ~ holdsAt(spinning,n1),
inference(negated_conjecture,[],[f48]) ).
fof(f48,conjecture,
~ holdsAt(spinning,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_spinning_1) ).
fof(f3418,plain,
( ~ holdsAt(spinning,n1)
| happens(pull,n0) ),
inference(subsumption_resolution,[],[f3416,f375]) ).
fof(f375,plain,
happens(push,n0),
inference(resolution,[],[f236,f365]) ).
fof(f365,plain,
sP3(n0,push),
inference(resolution,[],[f229,f318]) ).
fof(f318,plain,
sP2(n0,push),
inference(equality_resolution,[],[f317]) ).
fof(f317,plain,
! [X1] :
( sP2(n0,X1)
| push != X1 ),
inference(equality_resolution,[],[f235]) ).
fof(f235,plain,
! [X0,X1] :
( sP2(X0,X1)
| n0 != X0
| push != X1 ),
inference(cnf_transformation,[],[f143]) ).
fof(f229,plain,
! [X0,X1] :
( ~ sP2(X0,X1)
| sP3(X0,X1) ),
inference(cnf_transformation,[],[f140]) ).
fof(f236,plain,
! [X0,X1] :
( ~ sP3(X1,X0)
| happens(X0,X1) ),
inference(cnf_transformation,[],[f144]) ).
fof(f3416,plain,
( happens(pull,n0)
| ~ happens(push,n0)
| ~ holdsAt(spinning,n1) ),
inference(resolution,[],[f1048,f566]) ).
fof(f566,plain,
! [X5] :
( terminates(push,spinning,X5)
| happens(pull,X5) ),
inference(resolution,[],[f282,f558]) ).
fof(f558,plain,
! [X0] :
( sP9(X0,push,spinning)
| happens(pull,X0) ),
inference(resolution,[],[f259,f324]) ).
fof(f324,plain,
! [X0] :
( sP7(X0,spinning,push)
| happens(pull,X0) ),
inference(equality_resolution,[],[f323]) ).
fof(f323,plain,
! [X2,X0] :
( sP7(X0,spinning,X2)
| happens(pull,X0)
| push != X2 ),
inference(equality_resolution,[],[f269]) ).
fof(f269,plain,
! [X2,X0,X1] :
( sP7(X0,X1,X2)
| happens(pull,X0)
| spinning != X1
| push != X2 ),
inference(cnf_transformation,[],[f161]) ).
fof(f161,plain,
! [X0,X1,X2] :
( ( sP7(X0,X1,X2)
| happens(pull,X0)
| spinning != X1
| push != X2 )
& ( ( ~ happens(pull,X0)
& spinning = X1
& push = X2 )
| ~ sP7(X0,X1,X2) ) ),
inference(rectify,[],[f160]) ).
fof(f160,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| happens(pull,X2)
| spinning != X1
| push != X0 )
& ( ( ~ happens(pull,X2)
& spinning = X1
& push = X0 )
| ~ sP7(X2,X1,X0) ) ),
inference(flattening,[],[f159]) ).
fof(f159,plain,
! [X2,X1,X0] :
( ( sP7(X2,X1,X0)
| happens(pull,X2)
| spinning != X1
| push != X0 )
& ( ( ~ happens(pull,X2)
& spinning = X1
& push = X0 )
| ~ sP7(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f112]) ).
fof(f112,plain,
! [X2,X1,X0] :
( sP7(X2,X1,X0)
<=> ( ~ happens(pull,X2)
& spinning = X1
& push = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP7])]) ).
fof(f259,plain,
! [X2,X0,X1] :
( ~ sP7(X0,X2,X1)
| sP9(X0,X1,X2) ),
inference(cnf_transformation,[],[f155]) ).
fof(f155,plain,
! [X0,X1,X2] :
( ( sP9(X0,X1,X2)
| ( ( happens(push,X0)
| pull != X1
| forwards != X2 )
& ~ sP8(X2,X0,X1)
& ~ sP7(X0,X2,X1)
& ~ sP6(X0,X1,X2)
& ~ sP5(X2,X1,X0)
& ~ sP4(X0,X2,X1) ) )
& ( ( ~ happens(push,X0)
& pull = X1
& forwards = X2 )
| sP8(X2,X0,X1)
| sP7(X0,X2,X1)
| sP6(X0,X1,X2)
| sP5(X2,X1,X0)
| sP4(X0,X2,X1)
| ~ sP9(X0,X1,X2) ) ),
inference(rectify,[],[f154]) ).
fof(f154,plain,
! [X2,X0,X1] :
( ( sP9(X2,X0,X1)
| ( ( happens(push,X2)
| pull != X0
| forwards != X1 )
& ~ sP8(X1,X2,X0)
& ~ sP7(X2,X1,X0)
& ~ sP6(X2,X0,X1)
& ~ sP5(X1,X0,X2)
& ~ sP4(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& pull = X0
& forwards = X1 )
| sP8(X1,X2,X0)
| sP7(X2,X1,X0)
| sP6(X2,X0,X1)
| sP5(X1,X0,X2)
| sP4(X2,X1,X0)
| ~ sP9(X2,X0,X1) ) ),
inference(flattening,[],[f153]) ).
fof(f153,plain,
! [X2,X0,X1] :
( ( sP9(X2,X0,X1)
| ( ( happens(push,X2)
| pull != X0
| forwards != X1 )
& ~ sP8(X1,X2,X0)
& ~ sP7(X2,X1,X0)
& ~ sP6(X2,X0,X1)
& ~ sP5(X1,X0,X2)
& ~ sP4(X2,X1,X0) ) )
& ( ( ~ happens(push,X2)
& pull = X0
& forwards = X1 )
| sP8(X1,X2,X0)
| sP7(X2,X1,X0)
| sP6(X2,X0,X1)
| sP5(X1,X0,X2)
| sP4(X2,X1,X0)
| ~ sP9(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f114]) ).
fof(f114,plain,
! [X2,X0,X1] :
( sP9(X2,X0,X1)
<=> ( ( ~ happens(push,X2)
& pull = X0
& forwards = X1 )
| sP8(X1,X2,X0)
| sP7(X2,X1,X0)
| sP6(X2,X0,X1)
| sP5(X1,X0,X2)
| sP4(X2,X1,X0) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP9])]) ).
fof(f282,plain,
! [X2,X0,X1] :
( ~ sP9(X0,X2,X1)
| terminates(X2,X1,X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f172,plain,
! [X0,X1,X2] :
( ( sP9(X0,X2,X1)
| ~ terminates(X2,X1,X0) )
& ( terminates(X2,X1,X0)
| ~ sP9(X0,X2,X1) ) ),
inference(rectify,[],[f171]) ).
fof(f171,plain,
! [X2,X1,X0] :
( ( sP9(X2,X0,X1)
| ~ terminates(X0,X1,X2) )
& ( terminates(X0,X1,X2)
| ~ sP9(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X2,X1,X0] :
( sP9(X2,X0,X1)
<=> terminates(X0,X1,X2) ),
inference(definition_folding,[],[f55,f114,f113,f112,f111,f110,f109]) ).
fof(f109,plain,
! [X2,X1,X0] :
( sP4(X2,X1,X0)
<=> ( ~ happens(push,X2)
& spinning = X1
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f110,plain,
! [X1,X0,X2] :
( sP5(X1,X0,X2)
<=> ( backwards = X1
& pull = X0
& happens(push,X2) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).
fof(f111,plain,
! [X2,X0,X1] :
( sP6(X2,X0,X1)
<=> ( ~ happens(pull,X2)
& push = X0
& backwards = X1 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP6])]) ).
fof(f113,plain,
! [X1,X2,X0] :
( sP8(X1,X2,X0)
<=> ( forwards = X1
& happens(push,X2)
& pull = X0 ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP8])]) ).
fof(f55,plain,
! [X2,X1,X0] :
( ( ( ~ happens(push,X2)
& pull = X0
& forwards = X1 )
| ( forwards = X1
& happens(push,X2)
& pull = X0 )
| ( ~ happens(pull,X2)
& spinning = X1
& push = X0 )
| ( ~ happens(pull,X2)
& push = X0
& backwards = X1 )
| ( backwards = X1
& pull = X0
& happens(push,X2) )
| ( ~ happens(push,X2)
& spinning = X1
& pull = X0 ) )
<=> terminates(X0,X1,X2) ),
inference(rectify,[],[f14]) ).
fof(f14,axiom,
! [X3,X1,X4] :
( terminates(X3,X1,X4)
<=> ( ( ~ happens(pull,X4)
& push = X3
& spinning = X1 )
| ( spinning = X1
& pull = X3
& ~ happens(push,X4) )
| ( forwards = X1
& pull = X3
& happens(push,X4) )
| ( happens(push,X4)
& pull = X3
& backwards = X1 )
| ( pull = X3
& forwards = X1
& ~ happens(push,X4) )
| ( backwards = X1
& ~ happens(pull,X4)
& push = X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',terminates_all_defn) ).
fof(f1048,plain,
! [X6,X7] :
( ~ terminates(X7,X6,n0)
| ~ happens(X7,n0)
| ~ holdsAt(X6,n1) ),
inference(superposition,[],[f291,f182]) ).
fof(f182,plain,
n1 = plus(n0,n1),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
n1 = plus(n0,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
fof(f291,plain,
! [X2,X0,X1] :
( ~ holdsAt(X0,plus(X1,n1))
| ~ terminates(X2,X0,X1)
| ~ happens(X2,X1) ),
inference(cnf_transformation,[],[f174]) ).
fof(f174,plain,
! [X0,X1,X2] :
( ~ happens(X2,X1)
| ~ terminates(X2,X0,X1)
| ~ holdsAt(X0,plus(X1,n1)) ),
inference(rectify,[],[f97]) ).
fof(f97,plain,
! [X2,X0,X1] :
( ~ happens(X1,X0)
| ~ terminates(X1,X2,X0)
| ~ holdsAt(X2,plus(X0,n1)) ),
inference(flattening,[],[f96]) ).
fof(f96,plain,
! [X0,X2,X1] :
( ~ holdsAt(X2,plus(X0,n1))
| ~ happens(X1,X0)
| ~ terminates(X1,X2,X0) ),
inference(ennf_transformation,[],[f75]) ).
fof(f75,plain,
! [X0,X2,X1] :
( ( happens(X1,X0)
& terminates(X1,X2,X0) )
=> ~ holdsAt(X2,plus(X0,n1)) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X4,X3,X1] :
( ( terminates(X3,X1,X4)
& happens(X3,X4) )
=> ~ holdsAt(X1,plus(X4,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_terminates_not_holds) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : CSR017+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/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 : n028.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:48:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.49 % (5001)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.49 % (4987)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.49 % (4978)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.18/0.50 TRYING [3]
% 0.18/0.50 % (5003)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.18/0.50 % (4980)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.18/0.50 % (4990)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.18/0.51 TRYING [4]
% 0.18/0.51 % (4997)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.51 % (4989)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.18/0.51 % (4981)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.51 % (5000)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.52 % (4988)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.52 % (4992)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.52 % (5005)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.18/0.52 % (4979)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.18/0.53 % (4986)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.18/0.53 % (4986)Instruction limit reached!
% 0.18/0.53 % (4986)------------------------------
% 0.18/0.53 % (4986)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53 % (4986)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53 % (4986)Termination reason: Unknown
% 0.18/0.53 % (4986)Termination phase: Preprocessing 3
% 0.18/0.53
% 0.18/0.53 % (4986)Memory used [KB]: 1023
% 0.18/0.53 % (4986)Time elapsed: 0.003 s
% 0.18/0.53 % (4986)Instructions burned: 2 (million)
% 0.18/0.53 % (4986)------------------------------
% 0.18/0.53 % (4986)------------------------------
% 0.18/0.53 % (4982)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.53 % (4985)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.53 % (4985)Instruction limit reached!
% 0.18/0.53 % (4985)------------------------------
% 0.18/0.53 % (4985)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.53 % (4985)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.53 % (4985)Termination reason: Unknown
% 0.18/0.53 % (4985)Termination phase: Saturation
% 0.18/0.53
% 0.18/0.53 % (4985)Memory used [KB]: 5628
% 0.18/0.53 % (4985)Time elapsed: 0.147 s
% 0.18/0.53 % (4985)Instructions burned: 8 (million)
% 0.18/0.53 % (4985)------------------------------
% 0.18/0.53 % (4985)------------------------------
% 0.18/0.53 % (4984)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.53 % (5004)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.53 % (4994)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.50/0.54 TRYING [3]
% 1.50/0.54 % (4998)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.50/0.54 % (4983)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.50/0.54 % (4993)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)
% 1.50/0.54 % (4979)Refutation not found, incomplete strategy% (4979)------------------------------
% 1.50/0.54 % (4979)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.50/0.54 % (4979)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.50/0.54 % (4979)Termination reason: Refutation not found, incomplete strategy
% 1.50/0.54
% 1.50/0.54 % (4979)Memory used [KB]: 5756
% 1.50/0.54 % (4979)Time elapsed: 0.151 s
% 1.50/0.54 % (4979)Instructions burned: 12 (million)
% 1.50/0.54 % (4979)------------------------------
% 1.50/0.54 % (4979)------------------------------
% 1.50/0.54 % (4995)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.50/0.55 % (4999)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 1.50/0.55 % (5007)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 1.50/0.55 % (4991)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.67/0.55 % (5006)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.67/0.55 % (5002)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 1.67/0.56 % (4996)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 1.67/0.56 TRYING [4]
% 1.67/0.56 % (4980)Instruction limit reached!
% 1.67/0.56 % (4980)------------------------------
% 1.67/0.56 % (4980)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.67/0.56 % (4980)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.67/0.56 % (4980)Termination reason: Unknown
% 1.67/0.56 % (4980)Termination phase: Saturation
% 1.67/0.56
% 1.67/0.56 % (4980)Memory used [KB]: 1407
% 1.67/0.56 % (4980)Time elapsed: 0.175 s
% 1.67/0.56 % (4980)Instructions burned: 39 (million)
% 1.67/0.56 % (4980)------------------------------
% 1.67/0.56 % (4980)------------------------------
% 1.67/0.56 % (4987)Instruction limit reached!
% 1.67/0.56 % (4987)------------------------------
% 1.67/0.56 % (4987)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.67/0.56 % (4987)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.67/0.56 % (4987)Termination reason: Unknown
% 1.67/0.56 % (4987)Termination phase: Saturation
% 1.67/0.56
% 1.67/0.56 % (4987)Memory used [KB]: 1407
% 1.67/0.56 % (4987)Time elapsed: 0.175 s
% 1.67/0.56 % (4987)Instructions burned: 52 (million)
% 1.67/0.56 % (4987)------------------------------
% 1.67/0.56 % (4987)------------------------------
% 1.67/0.57 TRYING [3]
% 1.67/0.58 % (4984)Instruction limit reached!
% 1.67/0.58 % (4984)------------------------------
% 1.67/0.58 % (4984)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.67/0.58 % (4984)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.67/0.58 % (4984)Termination reason: Unknown
% 1.67/0.58 % (4984)Termination phase: Finite model building constraint generation
% 1.67/0.58
% 1.67/0.58 % (4984)Memory used [KB]: 8059
% 1.67/0.58 % (4984)Time elapsed: 0.145 s
% 1.67/0.58 % (4984)Instructions burned: 51 (million)
% 1.67/0.58 % (4984)------------------------------
% 1.67/0.58 % (4984)------------------------------
% 1.67/0.58 TRYING [5]
% 1.67/0.60 % (5003)First to succeed.
% 1.67/0.60 TRYING [4]
% 1.67/0.60 % (5003)Refutation found. Thanks to Tanya!
% 1.67/0.60 % SZS status Theorem for theBenchmark
% 1.67/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.67/0.60 % (5003)------------------------------
% 1.67/0.60 % (5003)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.67/0.60 % (5003)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.67/0.60 % (5003)Termination reason: Refutation
% 1.67/0.60
% 1.67/0.60 % (5003)Memory used [KB]: 5884
% 1.67/0.60 % (5003)Time elapsed: 0.206 s
% 1.67/0.60 % (5003)Instructions burned: 67 (million)
% 1.67/0.60 % (5003)------------------------------
% 1.67/0.60 % (5003)------------------------------
% 1.67/0.60 % (4977)Success in time 0.261 s
%------------------------------------------------------------------------------