TSTP Solution File: SYN376+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN376+1 : TPTP v8.1.0. Bugfixed v2.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 : n006.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:37:43 EDT 2022
% Result : Theorem 0.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 84 ( 34 ~; 21 |; 15 &)
% ( 8 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 4 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 40 ( 22 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f32,plain,
$false,
inference(avatar_sat_refutation,[],[f23,f27,f29,f31]) ).
fof(f31,plain,
~ spl3_3,
inference(avatar_contradiction_clause,[],[f30]) ).
fof(f30,plain,
( $false
| ~ spl3_3 ),
inference(resolution,[],[f26,f12]) ).
fof(f12,plain,
~ big_p(sK2),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( big_p(sK0)
& ! [X2] :
( ( big_p(X2)
| ~ big_p(sK1) )
& ( big_p(sK1)
| ~ big_p(X2) ) )
& ~ big_p(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).
fof(f8,plain,
( ? [X0] : big_p(X0)
=> big_p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X1] :
! [X2] :
( ( big_p(X2)
| ~ big_p(X1) )
& ( big_p(X1)
| ~ big_p(X2) ) )
=> ! [X2] :
( ( big_p(X2)
| ~ big_p(sK1) )
& ( big_p(sK1)
| ~ big_p(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X3] : ~ big_p(X3)
=> ~ big_p(sK2) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ? [X0] : big_p(X0)
& ? [X1] :
! [X2] :
( ( big_p(X2)
| ~ big_p(X1) )
& ( big_p(X1)
| ~ big_p(X2) ) )
& ? [X3] : ~ big_p(X3) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
( ? [X3] : big_p(X3)
& ? [X0] :
! [X1] :
( ( big_p(X1)
| ~ big_p(X0) )
& ( big_p(X0)
| ~ big_p(X1) ) )
& ? [X2] : ~ big_p(X2) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
( ? [X3] : big_p(X3)
& ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
& ? [X2] : ~ big_p(X2) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
( ? [X3] : big_p(X3)
& ? [X2] : ~ big_p(X2)
& ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
=> ( ! [X3] : ~ big_p(X3)
| ! [X2] : big_p(X2) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
=> ( ! [X0] : big_p(X0)
| ! [X0] : ~ big_p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
! [X1] :
( big_p(X1)
<=> big_p(X0) )
=> ( ! [X0] : big_p(X0)
| ! [X0] : ~ big_p(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2127) ).
fof(f26,plain,
( ! [X2] : big_p(X2)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f25,plain,
( spl3_3
<=> ! [X2] : big_p(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f29,plain,
~ spl3_2,
inference(avatar_contradiction_clause,[],[f28]) ).
fof(f28,plain,
( $false
| ~ spl3_2 ),
inference(resolution,[],[f22,f15]) ).
fof(f15,plain,
big_p(sK0),
inference(cnf_transformation,[],[f11]) ).
fof(f22,plain,
( ! [X2] : ~ big_p(X2)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f21,plain,
( spl3_2
<=> ! [X2] : ~ big_p(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f27,plain,
( spl3_3
| ~ spl3_1 ),
inference(avatar_split_clause,[],[f14,f17,f25]) ).
fof(f17,plain,
( spl3_1
<=> big_p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f14,plain,
! [X2] :
( ~ big_p(sK1)
| big_p(X2) ),
inference(cnf_transformation,[],[f11]) ).
fof(f23,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f13,f21,f17]) ).
fof(f13,plain,
! [X2] :
( ~ big_p(X2)
| big_p(sK1) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN376+1 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n006.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 21:48:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.49 % (19824)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.49 % (19824)First to succeed.
% 0.20/0.50 % (19824)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 % (19824)------------------------------
% 0.20/0.50 % (19824)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (19824)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (19824)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (19824)Memory used [KB]: 5373
% 0.20/0.50 % (19824)Time elapsed: 0.097 s
% 0.20/0.50 % (19824)Instructions burned: 1 (million)
% 0.20/0.50 % (19824)------------------------------
% 0.20/0.50 % (19824)------------------------------
% 0.20/0.50 % (19805)Success in time 0.147 s
%------------------------------------------------------------------------------