TSTP Solution File: SYN066+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN066+1 : TPTP v8.1.0. Bugfixed v3.0.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 : n013.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:46 EDT 2022
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 87 ( 34 ~; 26 |; 14 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 80 ( 52 !; 28 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f49,plain,
$false,
inference(avatar_sat_refutation,[],[f34,f46,f48]) ).
fof(f48,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f47]) ).
fof(f47,plain,
( $false
| ~ spl5_1 ),
inference(resolution,[],[f30,f26]) ).
fof(f26,plain,
! [X1] : ~ big_r(sK4,X1),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X1] : ~ big_r(sK4,X1),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f11,f19]) ).
fof(f19,plain,
( ? [X0] :
! [X1] : ~ big_r(X0,X1)
=> ! [X1] : ~ big_r(sK4,X1) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0] :
! [X1] : ~ big_r(X0,X1),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
~ ! [X0] :
? [X1] : big_r(X0,X1),
inference(rectify,[],[f5]) ).
fof(f5,negated_conjecture,
~ ! [X2] :
? [X3] : big_r(X2,X3),
inference(negated_conjecture,[],[f4]) ).
fof(f4,conjecture,
! [X2] :
? [X3] : big_r(X2,X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37) ).
fof(f30,plain,
( ! [X0] : big_r(X0,X0)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl5_1
<=> ! [X0] : big_r(X0,X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f46,plain,
~ spl5_2,
inference(avatar_contradiction_clause,[],[f45]) ).
fof(f45,plain,
( $false
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f44,f33]) ).
fof(f33,plain,
( ! [X2,X1] : ~ big_q(X2,X1)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f32,plain,
( spl5_2
<=> ! [X2,X1] : ~ big_q(X2,X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f44,plain,
( ! [X3] : big_q(sK3(X3),sK1(X3))
| ~ spl5_2 ),
inference(subsumption_resolution,[],[f38,f33]) ).
fof(f38,plain,
! [X3] :
( big_q(sK0(sK1(X3)),sK1(X3))
| big_q(sK3(X3),sK1(X3)) ),
inference(resolution,[],[f23,f22]) ).
fof(f22,plain,
! [X0,X1] :
( big_p(X1,X0)
| big_q(sK0(X0),X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( big_p(X1,X0)
| big_q(sK0(X0),X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f13]) ).
fof(f13,plain,
! [X0] :
( ? [X2] : big_q(X2,X0)
=> big_q(sK0(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
! [X0,X1] :
( big_p(X1,X0)
| ? [X2] : big_q(X2,X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
! [X0,X1] :
( ~ big_p(X1,X0)
=> ? [X2] : big_q(X2,X0) ),
inference(rectify,[],[f2]) ).
fof(f2,axiom,
! [X0,X2] :
( ~ big_p(X2,X0)
=> ? [X3] : big_q(X3,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_2) ).
fof(f23,plain,
! [X2,X0] :
( ~ big_p(sK2(X0,X2),sK1(X0))
| big_q(sK3(X0),sK1(X0)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X2] :
( ( ~ big_p(X2,X0)
| big_p(sK2(X0,X2),sK1(X0)) )
& big_p(sK2(X0,X2),X0)
& ( ~ big_p(sK2(X0,X2),sK1(X0))
| big_q(sK3(X0),sK1(X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f12,f17,f16,f15]) ).
fof(f15,plain,
! [X0] :
( ? [X1] :
! [X2] :
? [X3] :
( ( ~ big_p(X2,X0)
| big_p(X3,X1) )
& big_p(X3,X0)
& ( ~ big_p(X3,X1)
| ? [X4] : big_q(X4,X1) ) )
=> ! [X2] :
? [X3] :
( ( ~ big_p(X2,X0)
| big_p(X3,sK1(X0)) )
& big_p(X3,X0)
& ( ~ big_p(X3,sK1(X0))
| ? [X4] : big_q(X4,sK1(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X2] :
( ? [X3] :
( ( ~ big_p(X2,X0)
| big_p(X3,sK1(X0)) )
& big_p(X3,X0)
& ( ~ big_p(X3,sK1(X0))
| ? [X4] : big_q(X4,sK1(X0)) ) )
=> ( ( ~ big_p(X2,X0)
| big_p(sK2(X0,X2),sK1(X0)) )
& big_p(sK2(X0,X2),X0)
& ( ~ big_p(sK2(X0,X2),sK1(X0))
| ? [X4] : big_q(X4,sK1(X0)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0] :
( ? [X4] : big_q(X4,sK1(X0))
=> big_q(sK3(X0),sK1(X0)) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( ~ big_p(X2,X0)
| big_p(X3,X1) )
& big_p(X3,X0)
& ( ~ big_p(X3,X1)
| ? [X4] : big_q(X4,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] :
? [X1] :
! [X2] :
? [X3] :
( ( big_p(X3,X1)
=> ? [X4] : big_q(X4,X1) )
& big_p(X3,X0)
& ( big_p(X2,X0)
=> big_p(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_1) ).
fof(f34,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f27,f32,f29]) ).
fof(f27,plain,
! [X2,X0,X1] :
( ~ big_q(X2,X1)
| big_r(X0,X0) ),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
( ! [X0] : big_r(X0,X0)
| ! [X1,X2] : ~ big_q(X2,X1) ),
inference(rectify,[],[f10]) ).
fof(f10,plain,
( ! [X2] : big_r(X2,X2)
| ! [X1,X0] : ~ big_q(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,plain,
( ? [X0,X1] : big_q(X0,X1)
=> ! [X2] : big_r(X2,X2) ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
( ? [X2,X3] : big_q(X2,X3)
=> ! [X0] : big_r(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel37_3) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN066+1 : TPTP v8.1.0. Bugfixed v3.0.0.
% 0.11/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.11/0.32 % Computer : n013.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 30 21:23:46 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.16/0.46 % (16799)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 (3000ds/68Mi)
% 0.16/0.47 % (16798)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.16/0.47 % (16798)First to succeed.
% 0.16/0.47 % (16791)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.16/0.47 % (16798)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.48 % (16798)------------------------------
% 0.16/0.48 % (16798)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.48 % (16798)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.48 % (16798)Termination reason: Refutation
% 0.16/0.48
% 0.16/0.48 % (16798)Memory used [KB]: 5373
% 0.16/0.48 % (16798)Time elapsed: 0.095 s
% 0.16/0.48 % (16798)Instructions burned: 1 (million)
% 0.16/0.48 % (16798)------------------------------
% 0.16/0.48 % (16798)------------------------------
% 0.16/0.48 % (16784)Success in time 0.151 s
%------------------------------------------------------------------------------