TSTP Solution File: SYN937+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN937+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 : n022.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:08 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 3 unt; 0 def)
% Number of atoms : 97 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 110 ( 43 ~; 37 |; 14 &)
% ( 7 <=>; 8 =>; 0 <=; 1 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 30 ( 19 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f42,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f35,f36,f39,f41]) ).
fof(f41,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f40]) ).
fof(f40,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(subsumption_resolution,[],[f29,f20]) ).
fof(f20,plain,
( ! [X3] : ~ p(X3)
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f19]) ).
fof(f19,plain,
( spl2_1
<=> ! [X3] : ~ p(X3) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
fof(f29,plain,
( p(sK0)
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f27]) ).
fof(f27,plain,
( spl2_3
<=> p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
fof(f39,plain,
( ~ spl2_1
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f38]) ).
fof(f38,plain,
( $false
| ~ spl2_1
| ~ spl2_4 ),
inference(subsumption_resolution,[],[f34,f20]) ).
fof(f34,plain,
( p(sK1)
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f32]) ).
fof(f32,plain,
( spl2_4
<=> p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
fof(f36,plain,
~ spl2_2,
inference(avatar_split_clause,[],[f16,f22]) ).
fof(f22,plain,
( spl2_2
<=> c ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
fof(f16,plain,
~ c,
inference(duplicate_literal_removal,[],[f13]) ).
fof(f13,plain,
( ~ c
| ~ c ),
inference(cnf_transformation,[],[f10]) ).
fof(f10,plain,
( ( ( p(sK0)
& ~ c )
| ( ~ c
& p(sK1) ) )
& ( ! [X2] :
( ~ p(X2)
| c )
| c
| ! [X3] : ~ p(X3) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).
fof(f8,plain,
( ? [X0] :
( p(X0)
& ~ c )
=> ( p(sK0)
& ~ c ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X1] : p(X1)
=> p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f7,plain,
( ( ? [X0] :
( p(X0)
& ~ c )
| ( ~ c
& ? [X1] : p(X1) ) )
& ( ! [X2] :
( ~ p(X2)
| c )
| c
| ! [X3] : ~ p(X3) ) ),
inference(rectify,[],[f6]) ).
fof(f6,plain,
( ( ? [X0] :
( p(X0)
& ~ c )
| ( ~ c
& ? [X1] : p(X1) ) )
& ( ! [X0] :
( ~ p(X0)
| c )
| c
| ! [X1] : ~ p(X1) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
( ( ? [X0] :
( p(X0)
& ~ c )
| ( ~ c
& ? [X1] : p(X1) ) )
& ( ! [X0] :
( ~ p(X0)
| c )
| c
| ! [X1] : ~ p(X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ( c
| ! [X1] : ~ p(X1) )
<~> ! [X0] :
( ~ p(X0)
| c ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X0] :
( p(X0)
=> c )
<=> ( ? [X1] : p(X1)
=> c ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( p(X0)
=> c )
<=> ( ? [X0] : p(X0)
=> c ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( p(X0)
=> c )
<=> ( ? [X0] : p(X0)
=> c ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(f35,plain,
( spl2_4
| spl2_3 ),
inference(avatar_split_clause,[],[f14,f27,f32]) ).
fof(f14,plain,
( p(sK0)
| p(sK1) ),
inference(cnf_transformation,[],[f10]) ).
fof(f25,plain,
( spl2_1
| spl2_2
| spl2_1 ),
inference(avatar_split_clause,[],[f17,f19,f22,f19]) ).
fof(f17,plain,
! [X2,X3] :
( ~ p(X2)
| c
| ~ p(X3) ),
inference(duplicate_literal_removal,[],[f11]) ).
fof(f11,plain,
! [X2,X3] :
( ~ p(X2)
| c
| c
| ~ p(X3) ),
inference(cnf_transformation,[],[f10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN937+1 : TPTP v8.1.0. Released v3.1.0.
% 0.13/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 : n022.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:38:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50 % (29808)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.50 % (29808)First to succeed.
% 0.19/0.51 % (29807)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.51 % (29807)Also succeeded, but the first one will report.
% 0.19/0.51 % (29808)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 % (29808)------------------------------
% 0.19/0.51 % (29808)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (29808)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (29808)Termination reason: Refutation
% 0.19/0.51
% 0.19/0.51 % (29808)Memory used [KB]: 5884
% 0.19/0.51 % (29808)Time elapsed: 0.005 s
% 0.19/0.51 % (29808)Instructions burned: 2 (million)
% 0.19/0.51 % (29808)------------------------------
% 0.19/0.51 % (29808)------------------------------
% 0.19/0.51 % (29792)Success in time 0.16 s
%------------------------------------------------------------------------------