TSTP Solution File: SYN722+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN722+1 : TPTP v8.1.0. Released v2.5.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:28:12 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 4 unt; 0 def)
% Number of atoms : 133 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 180 ( 81 ~; 75 |; 18 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 6 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 28 ( 21 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f43,plain,
$false,
inference(avatar_sat_refutation,[],[f23,f32,f34,f36,f40,f42]) ).
fof(f42,plain,
( ~ spl1_3
| spl1_4 ),
inference(avatar_contradiction_clause,[],[f41]) ).
fof(f41,plain,
( $false
| ~ spl1_3
| spl1_4 ),
inference(subsumption_resolution,[],[f27,f38]) ).
fof(f38,plain,
( ! [X1] : p(X1)
| ~ spl1_3 ),
inference(subsumption_resolution,[],[f37,f11]) ).
fof(f11,plain,
! [X0] : q(X0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
( ! [X0] : q(X0)
& ( ~ p(b)
| ~ p(a) )
& ! [X1] :
( ~ q(X1)
| ~ q(c)
| ~ q(sK0(X1))
| p(X1)
| ~ q(d) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7]) ).
fof(f7,plain,
! [X1] :
( ? [X2] :
( ~ q(X1)
| ~ q(c)
| ~ q(X2)
| p(X1)
| ~ q(d) )
=> ( ~ q(X1)
| ~ q(c)
| ~ q(sK0(X1))
| p(X1)
| ~ q(d) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ! [X0] : q(X0)
& ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(X1)
| ~ q(c)
| ~ q(X2)
| p(X1)
| ~ q(d) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ! [X2] : q(X2)
& ( ~ p(b)
| ~ p(a) )
& ! [X0] :
? [X1] :
( ~ q(X0)
| ~ q(c)
| ~ q(X1)
| p(X0)
| ~ q(d) ) ),
inference(pure_predicate_removal,[],[f4]) ).
fof(f4,plain,
( ! [X0] :
? [X1] :
( ~ q(X0)
| ~ q(c)
| ~ q(X1)
| p(X0)
| ~ q(d) )
& ! [X2] :
( ( p(X2)
| r(X2) )
& q(X2) )
& ( ~ p(b)
| ~ p(a) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
~ ~ ( ! [X0] :
? [X1] :
( ~ q(X0)
| ~ q(c)
| ~ q(X1)
| p(X0)
| ~ q(d) )
& ! [X2] :
( ( p(X2)
| r(X2) )
& q(X2) )
& ( ~ p(b)
| ~ p(a) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ~ ( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(X2)
| ~ q(X1)
| p(X1)
| ~ q(d)
| ~ q(c) )
& ! [X0] :
( ( p(X0)
| r(X0) )
& q(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
~ ( ( ~ p(b)
| ~ p(a) )
& ! [X1] :
? [X2] :
( ~ q(X2)
| ~ q(X1)
| p(X1)
| ~ q(d)
| ~ q(c) )
& ! [X0] :
( ( p(X0)
| r(X0) )
& q(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm119) ).
fof(f37,plain,
( ! [X1] :
( ~ q(X1)
| p(X1) )
| ~ spl1_3 ),
inference(subsumption_resolution,[],[f22,f11]) ).
fof(f22,plain,
( ! [X1] :
( ~ q(sK0(X1))
| ~ q(X1)
| p(X1) )
| ~ spl1_3 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f21,plain,
( spl1_3
<=> ! [X1] :
( p(X1)
| ~ q(sK0(X1))
| ~ q(X1) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_3])]) ).
fof(f27,plain,
( ~ p(a)
| spl1_4 ),
inference(avatar_component_clause,[],[f25]) ).
fof(f25,plain,
( spl1_4
<=> p(a) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_4])]) ).
fof(f40,plain,
( ~ spl1_3
| spl1_5 ),
inference(avatar_contradiction_clause,[],[f39]) ).
fof(f39,plain,
( $false
| ~ spl1_3
| spl1_5 ),
inference(unit_resulting_resolution,[],[f31,f38]) ).
fof(f31,plain,
( ~ p(b)
| spl1_5 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl1_5
<=> p(b) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_5])]) ).
fof(f36,plain,
spl1_2,
inference(avatar_contradiction_clause,[],[f35]) ).
fof(f35,plain,
( $false
| spl1_2 ),
inference(subsumption_resolution,[],[f19,f11]) ).
fof(f19,plain,
( ~ q(d)
| spl1_2 ),
inference(avatar_component_clause,[],[f17]) ).
fof(f17,plain,
( spl1_2
<=> q(d) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_2])]) ).
fof(f34,plain,
spl1_1,
inference(avatar_contradiction_clause,[],[f33]) ).
fof(f33,plain,
( $false
| spl1_1 ),
inference(subsumption_resolution,[],[f15,f11]) ).
fof(f15,plain,
( ~ q(c)
| spl1_1 ),
inference(avatar_component_clause,[],[f13]) ).
fof(f13,plain,
( spl1_1
<=> q(c) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_1])]) ).
fof(f32,plain,
( ~ spl1_4
| ~ spl1_5 ),
inference(avatar_split_clause,[],[f10,f29,f25]) ).
fof(f10,plain,
( ~ p(b)
| ~ p(a) ),
inference(cnf_transformation,[],[f8]) ).
fof(f23,plain,
( ~ spl1_1
| ~ spl1_2
| spl1_3 ),
inference(avatar_split_clause,[],[f9,f21,f17,f13]) ).
fof(f9,plain,
! [X1] :
( p(X1)
| ~ q(d)
| ~ q(X1)
| ~ q(sK0(X1))
| ~ q(c) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYN722+1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/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:27:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % (16716)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.48 % (16716)First to succeed.
% 0.20/0.48 % (16716)Refutation found. Thanks to Tanya!
% 0.20/0.48 % SZS status Theorem for theBenchmark
% 0.20/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.48 % (16716)------------------------------
% 0.20/0.48 % (16716)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48 % (16716)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48 % (16716)Termination reason: Refutation
% 0.20/0.48
% 0.20/0.48 % (16716)Memory used [KB]: 5884
% 0.20/0.48 % (16716)Time elapsed: 0.091 s
% 0.20/0.48 % (16716)Instructions burned: 1 (million)
% 0.20/0.48 % (16716)------------------------------
% 0.20/0.48 % (16716)------------------------------
% 0.20/0.48 % (16704)Success in time 0.136 s
%------------------------------------------------------------------------------