TSTP Solution File: SWV165+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWV165+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n002.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 18:44:23 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 44 ( 17 unt; 0 def)
% Number of atoms : 89 ( 21 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 30 ~; 20 |; 16 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 36 ( 33 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f443,plain,
$false,
inference(avatar_sat_refutation,[],[f400,f440]) ).
fof(f440,plain,
~ spl1_19,
inference(avatar_contradiction_clause,[],[f439]) ).
fof(f439,plain,
( $false
| ~ spl1_19 ),
inference(subsumption_resolution,[],[f434,f164]) ).
fof(f164,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_gt) ).
fof(f434,plain,
( gt(n0,n0)
| ~ spl1_19 ),
inference(backward_demodulation,[],[f232,f392]) ).
fof(f392,plain,
( n0 = sK0
| ~ spl1_19 ),
inference(avatar_component_clause,[],[f390]) ).
fof(f390,plain,
( spl1_19
<=> n0 = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl1_19])]) ).
fof(f232,plain,
gt(n0,sK0),
inference(forward_demodulation,[],[f212,f188]) ).
fof(f188,plain,
n0 = plus(tptp_minus_1,n1),
inference(definition_unfolding,[],[f128,f179]) ).
fof(f179,plain,
! [X0] : succ(X0) = plus(X0,n1),
inference(cnf_transformation,[],[f29]) ).
fof(f29,axiom,
! [X0] : succ(X0) = plus(X0,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_plus_1_r) ).
fof(f128,plain,
n0 = succ(tptp_minus_1),
inference(cnf_transformation,[],[f28]) ).
fof(f28,axiom,
n0 = succ(tptp_minus_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',succ_tptp_minus_1) ).
fof(f212,plain,
gt(plus(tptp_minus_1,n1),sK0),
inference(unit_resulting_resolution,[],[f141,f205]) ).
fof(f205,plain,
! [X0,X1] :
( gt(plus(X1,n1),X0)
| ~ leq(X0,X1) ),
inference(definition_unfolding,[],[f173,f179]) ).
fof(f173,plain,
! [X0,X1] :
( gt(succ(X1),X0)
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0,X1] :
( ( gt(succ(X1),X0)
| ~ leq(X0,X1) )
& ( leq(X0,X1)
| ~ gt(succ(X1),X0) ) ),
inference(rectify,[],[f125]) ).
fof(f125,plain,
! [X1,X0] :
( ( gt(succ(X0),X1)
| ~ leq(X1,X0) )
& ( leq(X1,X0)
| ~ gt(succ(X0),X1) ) ),
inference(nnf_transformation,[],[f93]) ).
fof(f93,plain,
! [X1,X0] :
( gt(succ(X0),X1)
<=> leq(X1,X0) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X1,X0] :
( leq(X0,X1)
<=> gt(succ(X1),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_succ_gt_equiv) ).
fof(f141,plain,
leq(sK0,tptp_minus_1),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
( leq(n0,sK0)
& leq(sK0,tptp_minus_1)
& uninit != init ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f98,f117]) ).
fof(f117,plain,
( ? [X0] :
( leq(n0,X0)
& leq(X0,tptp_minus_1)
& uninit != init )
=> ( leq(n0,sK0)
& leq(sK0,tptp_minus_1)
& uninit != init ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
? [X0] :
( leq(n0,X0)
& leq(X0,tptp_minus_1)
& uninit != init ),
inference(flattening,[],[f97]) ).
fof(f97,plain,
? [X0] :
( uninit != init
& leq(n0,X0)
& leq(X0,tptp_minus_1) ),
inference(ennf_transformation,[],[f87]) ).
fof(f87,plain,
~ ! [X0] :
( ( leq(n0,X0)
& leq(X0,tptp_minus_1) )
=> uninit = init ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ! [X13] :
( ( leq(n0,X13)
& leq(X13,tptp_minus_1) )
=> uninit = init ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
! [X13] :
( ( leq(n0,X13)
& leq(X13,tptp_minus_1) )
=> uninit = init ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0001) ).
fof(f400,plain,
spl1_19,
inference(avatar_split_clause,[],[f399,f390]) ).
fof(f399,plain,
n0 = sK0,
inference(subsumption_resolution,[],[f351,f234]) ).
fof(f234,plain,
leq(sK0,n0),
inference(forward_demodulation,[],[f213,f188]) ).
fof(f213,plain,
leq(sK0,plus(tptp_minus_1,n1)),
inference(unit_resulting_resolution,[],[f141,f195]) ).
fof(f195,plain,
! [X0,X1] :
( ~ leq(X1,X0)
| leq(X1,plus(X0,n1)) ),
inference(definition_unfolding,[],[f151,f179]) ).
fof(f151,plain,
! [X0,X1] :
( leq(X1,succ(X0))
| ~ leq(X1,X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0,X1] :
( leq(X1,succ(X0))
| ~ leq(X1,X0) ),
inference(rectify,[],[f96]) ).
fof(f96,plain,
! [X1,X0] :
( leq(X0,succ(X1))
| ~ leq(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,axiom,
! [X1,X0] :
( leq(X0,X1)
=> leq(X0,succ(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leq_succ) ).
fof(f351,plain,
( ~ leq(sK0,n0)
| n0 = sK0 ),
inference(resolution,[],[f142,f186]) ).
fof(f186,plain,
! [X0] :
( ~ leq(n0,X0)
| n0 = X0
| ~ leq(X0,n0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( n0 = X0
| ~ leq(X0,n0)
| ~ leq(n0,X0) ),
inference(flattening,[],[f106]) ).
fof(f106,plain,
! [X0] :
( n0 = X0
| ~ leq(n0,X0)
| ~ leq(X0,n0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f78,axiom,
! [X0] :
( ( leq(n0,X0)
& leq(X0,n0) )
=> n0 = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',finite_domain_0) ).
fof(f142,plain,
leq(n0,sK0),
inference(cnf_transformation,[],[f118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV165+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 19:17:14 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.51 % (11405)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.52 % (11389)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.52 % (11397)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (11389)First to succeed.
% 0.20/0.52 % (11386)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.20/0.52 % (11393)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.52 % (11389)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (11389)------------------------------
% 0.20/0.52 % (11389)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (11389)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (11389)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (11389)Memory used [KB]: 6140
% 0.20/0.52 % (11389)Time elapsed: 0.098 s
% 0.20/0.52 % (11389)Instructions burned: 8 (million)
% 0.20/0.52 % (11389)------------------------------
% 0.20/0.52 % (11389)------------------------------
% 0.20/0.52 % (11381)Success in time 0.168 s
%------------------------------------------------------------------------------