TSTP Solution File: SYN930+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN930+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 : n005.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.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 2 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 104 ( 38 ~; 43 |; 14 &)
% ( 6 <=>; 2 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 5 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 32 ( 24 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f34,plain,
$false,
inference(avatar_sat_refutation,[],[f24,f29,f31,f33]) ).
fof(f33,plain,
( spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f32]) ).
fof(f32,plain,
( $false
| spl2_2
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f23,f28]) ).
fof(f28,plain,
( ! [X2] : p(X2)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f27,plain,
( spl2_3
<=> ! [X2] : p(X2) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f23,plain,
( ~ p(sK1)
| spl2_2 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f22,plain,
( spl2_2
<=> p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f31,plain,
( spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f30]) ).
fof(f30,plain,
( $false
| spl2_1
| ~ spl2_3 ),
inference(resolution,[],[f28,f20]) ).
fof(f20,plain,
( ~ p(sK0)
| spl2_1 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f19,plain,
( spl2_1
<=> p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f29,plain,
( spl2_3
| spl2_3 ),
inference(avatar_split_clause,[],[f25,f27,f27]) ).
fof(f25,plain,
! [X2,X3] :
( p(X3)
| p(X2) ),
inference(subsumption_resolution,[],[f16,f17]) ).
fof(f17,plain,
~ c,
inference(duplicate_literal_removal,[],[f15]) ).
fof(f15,plain,
( ~ c
| ~ c ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
( ( ( ~ c
& ~ p(sK0) )
| ( ~ c
& ~ p(sK1) ) )
& ( ! [X2] :
( c
| p(X2) )
| c
| ! [X3] : p(X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
fof(f8,plain,
( ? [X0] :
( ~ c
& ~ p(X0) )
=> ( ~ c
& ~ p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X1] : ~ p(X1)
=> ~ p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ( ? [X0] :
( ~ c
& ~ p(X0) )
| ( ~ c
& ? [X1] : ~ p(X1) ) )
& ( ! [X2] :
( c
| p(X2) )
| c
| ! [X3] : p(X3) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
( ( ? [X0] :
( ~ c
& ~ p(X0) )
| ( ~ c
& ? [X1] : ~ p(X1) ) )
& ( ! [X0] :
( c
| p(X0) )
| c
| ! [X1] : p(X1) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
( ( ? [X0] :
( ~ c
& ~ p(X0) )
| ( ~ c
& ? [X1] : ~ p(X1) ) )
& ( ! [X0] :
( c
| p(X0) )
| c
| ! [X1] : p(X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ( c
| ! [X1] : p(X1) )
<~> ! [X0] :
( c
| p(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X0] :
( c
| p(X0) )
<=> ( c
| ! [X1] : p(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( c
| p(X0) )
<=> ( c
| ! [X0] : p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( c
| p(X0) )
<=> ( c
| ! [X0] : p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f16,plain,
! [X2,X3] :
( c
| p(X2)
| p(X3) ),
inference(duplicate_literal_removal,[],[f11]) ).
fof(f11,plain,
! [X2,X3] :
( c
| c
| p(X2)
| p(X3) ),
inference(cnf_transformation,[],[f10]) ).
fof(f24,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f12,f22,f19]) ).
fof(f12,plain,
( ~ p(sK1)
| ~ p(sK0) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN930+1 : TPTP v8.1.0. Released v3.1.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.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 22:31:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.50 % (22595)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.50 % (22595)First to succeed.
% 0.19/0.51 % (22595)Refutation found. Thanks to Tanya!
% 0.19/0.51 % SZS status Theorem for theBenchmark
% 0.19/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.51 % (22595)------------------------------
% 0.19/0.51 % (22595)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (22595)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (22595)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (22595)Memory used [KB]: 5884
% 0.19/0.51 % (22595)Time elapsed: 0.104 s
% 0.19/0.51 % (22595)Instructions burned: 1 (million)
% 0.19/0.51 % (22595)------------------------------
% 0.19/0.51 % (22595)------------------------------
% 0.19/0.51 % (22592)Success in time 0.163 s
%------------------------------------------------------------------------------