TSTP Solution File: SYN967+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN967+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 : 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:36:13 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 3 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 86 ( 29 ~; 23 |; 18 &)
% ( 3 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 33 ( 24 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f36,plain,
$false,
inference(avatar_sat_refutation,[],[f21,f27,f33,f35]) ).
fof(f35,plain,
( spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f34]) ).
fof(f34,plain,
( $false
| spl2_1
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f16,f24]) ).
fof(f24,plain,
( ! [X3] : p(X3)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f23]) ).
fof(f23,plain,
( spl2_3
<=> ! [X3] : p(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f16,plain,
( ~ p(sK1)
| spl2_1 ),
inference(avatar_component_clause,[],[f14]) ).
fof(f14,plain,
( spl2_1
<=> p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f33,plain,
( spl2_2
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f32]) ).
fof(f32,plain,
( $false
| spl2_2
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f20,f24]) ).
fof(f20,plain,
( ~ p(sK0)
| spl2_2 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f18,plain,
( spl2_2
<=> p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f27,plain,
spl2_3,
inference(avatar_split_clause,[],[f26,f23]) ).
fof(f26,plain,
! [X2] : p(X2),
inference(subsumption_resolution,[],[f12,f9]) ).
fof(f9,plain,
! [X3] :
( q(X3)
| p(X3) ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,plain,
( ! [X2] :
( ~ q(X2)
| p(X2) )
& ! [X3] :
( ( ~ p(sK1)
& q(X3) )
| ( p(X3)
& ~ p(sK0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f6]) ).
fof(f6,plain,
( ? [X0,X1] :
( ! [X2] :
( ~ q(X2)
| p(X2) )
& ! [X3] :
( ( ~ p(X1)
& q(X3) )
| ( p(X3)
& ~ p(X0) ) ) )
=> ( ! [X2] :
( ~ q(X2)
| p(X2) )
& ! [X3] :
( ( ~ p(sK1)
& q(X3) )
| ( p(X3)
& ~ p(sK0) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f5,plain,
? [X0,X1] :
( ! [X2] :
( ~ q(X2)
| p(X2) )
& ! [X3] :
( ( ~ p(X1)
& q(X3) )
| ( p(X3)
& ~ p(X0) ) ) ),
inference(rectify,[],[f4]) ).
fof(f4,plain,
? [X1,X0] :
( ! [X2] :
( ~ q(X2)
| p(X2) )
& ! [X3] :
( ( ~ p(X0)
& q(X3) )
| ( p(X3)
& ~ p(X1) ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ! [X0,X1] :
( ! [X2] :
( q(X2)
=> p(X2) )
=> ? [X3] :
( ( p(X3)
=> p(X1) )
& ( q(X3)
=> p(X0) ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ! [X1,X0] :
( ! [X2] :
( q(X2)
=> p(X2) )
=> ? [X3] :
( ( p(X3)
=> p(X0) )
& ( q(X3)
=> p(X1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
! [X1,X0] :
( ! [X2] :
( q(X2)
=> p(X2) )
=> ? [X3] :
( ( p(X3)
=> p(X0) )
& ( q(X3)
=> p(X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f12,plain,
! [X2] :
( ~ q(X2)
| p(X2) ),
inference(cnf_transformation,[],[f7]) ).
fof(f21,plain,
( ~ spl2_1
| ~ spl2_2 ),
inference(avatar_split_clause,[],[f10,f18,f14]) ).
fof(f10,plain,
( ~ p(sK0)
| ~ p(sK1) ),
inference(cnf_transformation,[],[f7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN967+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.13/0.33 % Computer : n001.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 22:54:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.47 % (8935)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.19/0.48 % (8943)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.19/0.48 % (8943)First to succeed.
% 0.19/0.49 % (8943)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (8943)------------------------------
% 0.19/0.49 % (8943)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (8943)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (8943)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (8943)Memory used [KB]: 5884
% 0.19/0.49 % (8943)Time elapsed: 0.003 s
% 0.19/0.49 % (8943)Instructions burned: 1 (million)
% 0.19/0.49 % (8943)------------------------------
% 0.19/0.49 % (8943)------------------------------
% 0.19/0.49 % (8924)Success in time 0.144 s
%------------------------------------------------------------------------------