TSTP Solution File: SYN058+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN058+1 : TPTP v8.1.0. Released v2.0.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 : n001.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:25:22 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 51 ( 6 unt; 0 def)
% Number of atoms : 124 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 118 ( 45 ~; 34 |; 20 &)
% ( 6 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 7 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 41 ( 27 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f65,plain,
$false,
inference(avatar_sat_refutation,[],[f34,f43,f55,f57,f59,f61,f64]) ).
fof(f64,plain,
~ spl3_7,
inference(avatar_contradiction_clause,[],[f63]) ).
fof(f63,plain,
( $false
| ~ spl3_7 ),
inference(resolution,[],[f62,f27]) ).
fof(f27,plain,
~ big_g(sK2),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
( ~ big_g(sK2)
& big_f(sK2)
& big_p(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f13,f19]) ).
fof(f19,plain,
( ? [X0] :
( ~ big_g(X0)
& big_f(X0)
& big_p(X0) )
=> ( ~ big_g(sK2)
& big_f(sK2)
& big_p(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
? [X0] :
( ~ big_g(X0)
& big_f(X0)
& big_p(X0) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
? [X0] :
( ~ big_g(X0)
& big_p(X0)
& big_f(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X0] :
( ( big_p(X0)
& big_f(X0) )
=> big_g(X0) ),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X0] :
( ( big_p(X0)
& big_f(X0) )
=> big_g(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28) ).
fof(f62,plain,
( big_g(sK2)
| ~ spl3_7 ),
inference(resolution,[],[f54,f26]) ).
fof(f26,plain,
big_f(sK2),
inference(cnf_transformation,[],[f20]) ).
fof(f54,plain,
( ! [X0] :
( ~ big_f(X0)
| big_g(X0) )
| ~ spl3_7 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f53,plain,
( spl3_7
<=> ! [X0] :
( ~ big_f(X0)
| big_g(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_7])]) ).
fof(f61,plain,
( ~ spl3_3
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f60]) ).
fof(f60,plain,
( $false
| ~ spl3_3
| ~ spl3_6 ),
inference(resolution,[],[f38,f51]) ).
fof(f51,plain,
( ! [X1] : ~ big_s(X1)
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f50]) ).
fof(f50,plain,
( spl3_6
<=> ! [X1] : ~ big_s(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f38,plain,
( big_s(sK0)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f36,plain,
( spl3_3
<=> big_s(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f59,plain,
( ~ spl3_1
| spl3_4 ),
inference(avatar_contradiction_clause,[],[f58]) ).
fof(f58,plain,
( $false
| ~ spl3_1
| spl3_4 ),
inference(resolution,[],[f42,f30]) ).
fof(f30,plain,
( ! [X1] : big_q(X1)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl3_1
<=> ! [X1] : big_q(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f42,plain,
( ~ big_q(sK1)
| spl3_4 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f40,plain,
( spl3_4
<=> big_q(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f57,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f56]) ).
fof(f56,plain,
( $false
| ~ spl3_2 ),
inference(resolution,[],[f33,f25]) ).
fof(f25,plain,
big_p(sK2),
inference(cnf_transformation,[],[f20]) ).
fof(f33,plain,
( ! [X0] : ~ big_p(X0)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f32,plain,
( spl3_2
<=> ! [X0] : ~ big_p(X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f55,plain,
( spl3_6
| spl3_7 ),
inference(avatar_split_clause,[],[f22,f53,f50]) ).
fof(f22,plain,
! [X0,X1] :
( ~ big_f(X0)
| big_g(X0)
| ~ big_s(X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ! [X0] :
( ~ big_f(X0)
| big_g(X0) )
| ! [X1] : ~ big_s(X1) ),
inference(rectify,[],[f9]) ).
fof(f9,plain,
( ! [X1] :
( ~ big_f(X1)
| big_g(X1) )
| ! [X0] : ~ big_s(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
( ? [X0] : big_s(X0)
=> ! [X1] :
( big_f(X1)
=> big_g(X1) ) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
( ? [X0] : big_s(X0)
=> ! [X2] :
( big_f(X2)
=> big_g(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_3) ).
fof(f43,plain,
( spl3_3
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f23,f40,f36]) ).
fof(f23,plain,
( ~ big_q(sK1)
| big_s(sK0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ( big_q(sK0)
& big_s(sK0) )
| ~ big_q(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f15,f17,f16]) ).
fof(f16,plain,
( ? [X0] :
( big_q(X0)
& big_s(X0) )
=> ( big_q(sK0)
& big_s(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X1] : ~ big_q(X1)
=> ~ big_q(sK1) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X0] :
( big_q(X0)
& big_s(X0) )
| ? [X1] : ~ big_q(X1) ),
inference(rectify,[],[f11]) ).
fof(f11,plain,
( ? [X1] :
( big_q(X1)
& big_s(X1) )
| ? [X0] : ~ big_q(X0) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
( ! [X0] : big_q(X0)
=> ? [X1] :
( big_q(X1)
& big_s(X1) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f6,plain,
( ! [X0] :
( big_q(X0)
| big_r(X0) )
=> ? [X1] :
( big_q(X1)
& big_s(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
( ! [X0] :
( big_q(X0)
| big_r(X0) )
=> ? [X2] :
( big_q(X2)
& big_s(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_2) ).
fof(f34,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f21,f32,f29]) ).
fof(f21,plain,
! [X0,X1] :
( ~ big_p(X0)
| big_q(X1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0] :
( ~ big_p(X0)
| ! [X1] : big_q(X1) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
( big_p(X0)
=> ! [X1] : big_q(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN058+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/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 : n001.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 21:46:47 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.49 % (13595)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.50 % (13595)First to succeed.
% 0.20/0.50 % (13587)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.50 % (13587)Also succeeded, but the first one will report.
% 0.20/0.50 % (13595)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (13595)------------------------------
% 0.20/0.50 % (13595)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (13595)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (13595)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (13595)Memory used [KB]: 5884
% 0.20/0.50 % (13595)Time elapsed: 0.055 s
% 0.20/0.50 % (13595)Instructions burned: 1 (million)
% 0.20/0.50 % (13595)------------------------------
% 0.20/0.50 % (13595)------------------------------
% 0.20/0.50 % (13567)Success in time 0.152 s
%------------------------------------------------------------------------------