TSTP Solution File: SYN924+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN924+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 : n025.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:06 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 1 unt; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 127 ( 48 ~; 54 |; 12 &)
% ( 9 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 7 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 44 ( 20 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f52,plain,
$false,
inference(avatar_sat_refutation,[],[f20,f41,f42,f45,f47,f49,f51]) ).
fof(f51,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f50]) ).
fof(f50,plain,
( $false
| ~ spl3_1
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f28,f19]) ).
fof(f19,plain,
( ! [X0] : ~ p(X0)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f18]) ).
fof(f18,plain,
( spl3_1
<=> ! [X0] : ~ p(X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f28,plain,
( p(sK0)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f26]) ).
fof(f26,plain,
( spl3_3
<=> p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f49,plain,
( ~ spl3_2
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f48]) ).
fof(f48,plain,
( $false
| ~ spl3_2
| ~ spl3_6 ),
inference(subsumption_resolution,[],[f40,f23]) ).
fof(f23,plain,
( ! [X0] : ~ q(X0)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f22]) ).
fof(f22,plain,
( spl3_2
<=> ! [X0] : ~ q(X0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f40,plain,
( q(sK1)
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f38,plain,
( spl3_6
<=> q(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f47,plain,
( ~ spl3_2
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f46]) ).
fof(f46,plain,
( $false
| ~ spl3_2
| ~ spl3_5 ),
inference(subsumption_resolution,[],[f36,f23]) ).
fof(f36,plain,
( q(sK0)
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f34]) ).
fof(f34,plain,
( spl3_5
<=> q(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f45,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f44]) ).
fof(f44,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(unit_resulting_resolution,[],[f19,f32]) ).
fof(f32,plain,
( p(sK2)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f30]) ).
fof(f30,plain,
( spl3_4
<=> p(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f42,plain,
( spl3_2
| spl3_2 ),
inference(avatar_split_clause,[],[f16,f22,f22]) ).
fof(f16,plain,
! [X0,X1] :
( ~ q(X0)
| ~ q(X1) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( ! [X0] :
( ~ q(X0)
& ~ p(X0) )
| ( ! [X1] : ~ q(X1)
& ! [X2] : ~ p(X2) ) )
& ( q(sK0)
| p(sK0)
| q(sK1)
| p(sK2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f10,f9,f8]) ).
fof(f8,plain,
( ? [X3] :
( q(X3)
| p(X3) )
=> ( q(sK0)
| p(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] : q(X4)
=> q(sK1) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X5] : p(X5)
=> p(sK2) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ( ! [X0] :
( ~ q(X0)
& ~ p(X0) )
| ( ! [X1] : ~ q(X1)
& ! [X2] : ~ p(X2) ) )
& ( ? [X3] :
( q(X3)
| p(X3) )
| ? [X4] : q(X4)
| ? [X5] : p(X5) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
( ( ! [X0] :
( ~ q(X0)
& ~ p(X0) )
| ( ! [X2] : ~ q(X2)
& ! [X1] : ~ p(X1) ) )
& ( ? [X0] :
( q(X0)
| p(X0) )
| ? [X2] : q(X2)
| ? [X1] : p(X1) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
( ( ! [X0] :
( ~ q(X0)
& ~ p(X0) )
| ( ! [X2] : ~ q(X2)
& ! [X1] : ~ p(X1) ) )
& ( ? [X0] :
( q(X0)
| p(X0) )
| ? [X2] : q(X2)
| ? [X1] : p(X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ( ? [X2] : q(X2)
| ? [X1] : p(X1) )
<~> ? [X0] :
( q(X0)
| p(X0) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
( q(X0)
| p(X0) )
<=> ( ? [X2] : q(X2)
| ? [X1] : p(X1) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( q(X0)
| p(X0) )
<=> ( ? [X0] : p(X0)
| ? [X0] : q(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
( q(X0)
| p(X0) )
<=> ( ? [X0] : p(X0)
| ? [X0] : q(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
fof(f41,plain,
( spl3_3
| spl3_4
| spl3_5
| spl3_6 ),
inference(avatar_split_clause,[],[f12,f38,f34,f30,f26]) ).
fof(f12,plain,
( q(sK1)
| q(sK0)
| p(sK2)
| p(sK0) ),
inference(cnf_transformation,[],[f11]) ).
fof(f20,plain,
( spl3_1
| spl3_1 ),
inference(avatar_split_clause,[],[f13,f18,f18]) ).
fof(f13,plain,
! [X2,X0] :
( ~ p(X2)
| ~ p(X0) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN924+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/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.34 % Computer : n025.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 22:40:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (6067)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.19/0.49 % (6051)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.19/0.49 % (6051)First to succeed.
% 0.19/0.49 % (6051)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 % (6051)------------------------------
% 0.19/0.49 % (6051)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (6051)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (6051)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (6051)Memory used [KB]: 5884
% 0.19/0.49 % (6051)Time elapsed: 0.088 s
% 0.19/0.49 % (6051)Instructions burned: 2 (million)
% 0.19/0.49 % (6051)------------------------------
% 0.19/0.49 % (6051)------------------------------
% 0.19/0.49 % (6041)Success in time 0.144 s
%------------------------------------------------------------------------------