TSTP Solution File: SYN926+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN926+1 : TPTP v8.1.0. Released v3.1.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 : 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 19:36:07 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 5 unt; 0 def)
% Number of atoms : 49 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 20 ~; 9 |; 14 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 24 ( 12 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,plain,
$false,
inference(avatar_sat_refutation,[],[f17,f19,f21]) ).
fof(f21,plain,
~ spl1_1,
inference(avatar_contradiction_clause,[],[f20]) ).
fof(f20,plain,
( $false
| ~ spl1_1 ),
inference(resolution,[],[f13,f9]) ).
fof(f9,plain,
p(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
( q(sK0)
& p(sK0)
& ( ! [X1] : ~ p(X1)
| ! [X2] : ~ q(X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f5,f6]) ).
fof(f6,plain,
( ? [X0] :
( q(X0)
& p(X0) )
=> ( q(sK0)
& p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
( ? [X0] :
( q(X0)
& p(X0) )
& ( ! [X1] : ~ p(X1)
| ! [X2] : ~ q(X2) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
( ? [X0] :
( q(X0)
& p(X0) )
& ( ! [X2] : ~ p(X2)
| ! [X1] : ~ q(X1) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
( q(X0)
& p(X0) )
=> ( ? [X1] : q(X1)
& ? [X2] : p(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( q(X0)
& p(X0) )
=> ( ? [X0] : q(X0)
& ? [X0] : p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
( q(X0)
& p(X0) )
=> ( ? [X0] : q(X0)
& ? [X0] : p(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f13,plain,
( ! [X1] : ~ p(X1)
| ~ spl1_1 ),
inference(avatar_component_clause,[],[f12]) ).
fof(f12,plain,
( spl1_1
<=> ! [X1] : ~ p(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f19,plain,
~ spl1_2,
inference(avatar_contradiction_clause,[],[f18]) ).
fof(f18,plain,
( $false
| ~ spl1_2 ),
inference(resolution,[],[f16,f10]) ).
fof(f10,plain,
q(sK0),
inference(cnf_transformation,[],[f7]) ).
fof(f16,plain,
( ! [X2] : ~ q(X2)
| ~ spl1_2 ),
inference(avatar_component_clause,[],[f15]) ).
fof(f15,plain,
( spl1_2
<=> ! [X2] : ~ q(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f17,plain,
( spl1_1
| spl1_2 ),
inference(avatar_split_clause,[],[f8,f15,f12]) ).
fof(f8,plain,
! [X2,X1] :
( ~ q(X2)
| ~ p(X1) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN926+1 : TPTP v8.1.0. Released v3.1.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.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 22:40:49 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.49 % (14099)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.20/0.50 % (14115)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.50 % (14107)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.50 % (14092)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50 % (14099)First to succeed.
% 0.20/0.51 % (14099)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (14099)------------------------------
% 0.20/0.51 % (14099)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (14099)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (14099)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (14099)Memory used [KB]: 5884
% 0.20/0.51 % (14099)Time elapsed: 0.102 s
% 0.20/0.51 % (14099)Instructions burned: 1 (million)
% 0.20/0.51 % (14099)------------------------------
% 0.20/0.51 % (14099)------------------------------
% 0.20/0.51 % (14088)Success in time 0.155 s
%------------------------------------------------------------------------------