TSTP Solution File: SYN063+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SYN063+1 : TPTP v8.1.0. Released v2.0.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 : n016.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:25:23 EDT 2022
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 62 ( 1 unt; 0 def)
% Number of atoms : 263 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 319 ( 118 ~; 132 |; 51 &)
% ( 9 <=>; 6 =>; 0 <=; 3 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 7 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 36 ( 30 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f110,plain,
$false,
inference(avatar_sat_refutation,[],[f46,f56,f57,f61,f65,f71,f93,f109]) ).
fof(f109,plain,
( spl4_3
| ~ spl4_6 ),
inference(avatar_contradiction_clause,[],[f99]) ).
fof(f99,plain,
( $false
| spl4_3
| ~ spl4_6 ),
inference(unit_resulting_resolution,[],[f45,f60]) ).
fof(f60,plain,
( ! [X1] : big_p(X1)
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f59,plain,
( spl4_6
<=> ! [X1] : big_p(X1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
fof(f45,plain,
( ~ big_p(b)
| spl4_3 ),
inference(avatar_component_clause,[],[f43]) ).
fof(f43,plain,
( spl4_3
<=> big_p(b) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f93,plain,
( ~ spl4_1
| spl4_4 ),
inference(avatar_contradiction_clause,[],[f92]) ).
fof(f92,plain,
( $false
| ~ spl4_1
| spl4_4 ),
inference(subsumption_resolution,[],[f81,f50]) ).
fof(f50,plain,
( ~ sP1
| spl4_4 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f48,plain,
( spl4_4
<=> sP1 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f81,plain,
( sP1
| ~ spl4_1 ),
inference(unit_resulting_resolution,[],[f37,f72,f22]) ).
fof(f22,plain,
( ~ sP0(sK2)
| sP1
| ~ big_p(c) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( sP1
| ( big_p(b)
& ~ big_p(c)
& big_p(a) )
| ~ sP0(sK2) )
& ( ! [X1] :
( ( ~ big_p(b)
| big_p(c)
| ~ big_p(a) )
& sP0(X1) )
| ~ sP1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f9,f10]) ).
fof(f10,plain,
( ? [X0] :
( ( big_p(b)
& ~ big_p(c)
& big_p(a) )
| ~ sP0(X0) )
=> ( ( big_p(b)
& ~ big_p(c)
& big_p(a) )
| ~ sP0(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ( sP1
| ? [X0] :
( ( big_p(b)
& ~ big_p(c)
& big_p(a) )
| ~ sP0(X0) ) )
& ( ! [X1] :
( ( ~ big_p(b)
| big_p(c)
| ~ big_p(a) )
& sP0(X1) )
| ~ sP1 ) ),
inference(rectify,[],[f8]) ).
fof(f8,plain,
( ( sP1
| ? [X1] :
( ( big_p(b)
& ~ big_p(c)
& big_p(a) )
| ~ sP0(X1) ) )
& ( ! [X1] :
( ( ~ big_p(b)
| big_p(c)
| ~ big_p(a) )
& sP0(X1) )
| ~ sP1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,plain,
( sP1
<=> ! [X1] :
( ( ~ big_p(b)
| big_p(c)
| ~ big_p(a) )
& sP0(X1) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f72,plain,
( ! [X0] : sP0(X0)
| ~ spl4_1 ),
inference(unit_resulting_resolution,[],[f37,f27]) ).
fof(f27,plain,
! [X0] :
( ~ big_p(c)
| sP0(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0] :
( ( sP0(X0)
| ( ~ big_p(c)
& big_p(a)
& ~ big_p(X0) ) )
& ( big_p(c)
| ~ big_p(a)
| big_p(X0)
| ~ sP0(X0) ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X1] :
( ( sP0(X1)
| ( ~ big_p(c)
& big_p(a)
& ~ big_p(X1) ) )
& ( big_p(c)
| ~ big_p(a)
| big_p(X1)
| ~ sP0(X1) ) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X1] :
( ( sP0(X1)
| ( ~ big_p(c)
& big_p(a)
& ~ big_p(X1) ) )
& ( big_p(c)
| ~ big_p(a)
| big_p(X1)
| ~ sP0(X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,plain,
! [X1] :
( sP0(X1)
<=> ( big_p(c)
| ~ big_p(a)
| big_p(X1) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f37,plain,
( big_p(c)
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f35,plain,
( spl4_1
<=> big_p(c) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f71,plain,
( spl4_1
| ~ spl4_2
| ~ spl4_4 ),
inference(avatar_contradiction_clause,[],[f70]) ).
fof(f70,plain,
( $false
| spl4_1
| ~ spl4_2
| ~ spl4_4 ),
inference(subsumption_resolution,[],[f68,f66]) ).
fof(f66,plain,
( ! [X0] : sP0(X0)
| ~ spl4_4 ),
inference(unit_resulting_resolution,[],[f49,f19]) ).
fof(f19,plain,
! [X1] :
( sP0(X1)
| ~ sP1 ),
inference(cnf_transformation,[],[f11]) ).
fof(f49,plain,
( sP1
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f68,plain,
( ~ sP0(c)
| spl4_1
| ~ spl4_2 ),
inference(unit_resulting_resolution,[],[f36,f36,f40,f24]) ).
fof(f24,plain,
! [X0] :
( ~ sP0(X0)
| ~ big_p(a)
| big_p(c)
| big_p(X0) ),
inference(cnf_transformation,[],[f14]) ).
fof(f40,plain,
( big_p(a)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f39,plain,
( spl4_2
<=> big_p(a) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f36,plain,
( ~ big_p(c)
| spl4_1 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f65,plain,
( spl4_2
| spl4_4 ),
inference(avatar_contradiction_clause,[],[f64]) ).
fof(f64,plain,
( $false
| spl4_2
| spl4_4 ),
inference(subsumption_resolution,[],[f62,f63]) ).
fof(f63,plain,
( ! [X0] : sP0(X0)
| spl4_2 ),
inference(unit_resulting_resolution,[],[f41,f26]) ).
fof(f26,plain,
! [X0] :
( sP0(X0)
| big_p(a) ),
inference(cnf_transformation,[],[f14]) ).
fof(f41,plain,
( ~ big_p(a)
| spl4_2 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f62,plain,
( ~ sP0(sK2)
| spl4_2
| spl4_4 ),
inference(unit_resulting_resolution,[],[f50,f41,f21]) ).
fof(f21,plain,
( ~ sP0(sK2)
| big_p(a)
| sP1 ),
inference(cnf_transformation,[],[f11]) ).
fof(f61,plain,
( spl4_1
| spl4_6
| spl4_4
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f29,f39,f48,f59,f35]) ).
fof(f29,plain,
! [X1] :
( ~ big_p(a)
| sP1
| big_p(X1)
| big_p(c) ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ( ( ~ big_p(c)
& ( ~ big_p(sK3)
| big_p(b) )
& big_p(a) )
| ~ sP1 )
& ( ! [X1] :
( big_p(c)
| ( big_p(X1)
& ~ big_p(b) )
| ~ big_p(a) )
| sP1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f16,f17]) ).
fof(f17,plain,
( ? [X0] :
( ~ big_p(c)
& ( ~ big_p(X0)
| big_p(b) )
& big_p(a) )
=> ( ~ big_p(c)
& ( ~ big_p(sK3)
| big_p(b) )
& big_p(a) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ( ? [X0] :
( ~ big_p(c)
& ( ~ big_p(X0)
| big_p(b) )
& big_p(a) )
| ~ sP1 )
& ( ! [X1] :
( big_p(c)
| ( big_p(X1)
& ~ big_p(b) )
| ~ big_p(a) )
| sP1 ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
( ( ? [X0] :
( ~ big_p(c)
& ( ~ big_p(X0)
| big_p(b) )
& big_p(a) )
| ~ sP1 )
& ( ! [X0] :
( big_p(c)
| ( big_p(X0)
& ~ big_p(b) )
| ~ big_p(a) )
| sP1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,plain,
( sP1
<~> ! [X0] :
( big_p(c)
| ( big_p(X0)
& ~ big_p(b) )
| ~ big_p(a) ) ),
inference(definition_folding,[],[f4,f6,f5]) ).
fof(f4,plain,
( ! [X1] :
( ( ~ big_p(b)
| big_p(c)
| ~ big_p(a) )
& ( big_p(c)
| ~ big_p(a)
| big_p(X1) ) )
<~> ! [X0] :
( big_p(c)
| ( big_p(X0)
& ~ big_p(b) )
| ~ big_p(a) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
( ! [X1] :
( ( ~ big_p(b)
| big_p(c)
| ~ big_p(a) )
& ( big_p(c)
| ~ big_p(a)
| big_p(X1) ) )
<~> ! [X0] :
( big_p(c)
| ( big_p(X0)
& ~ big_p(b) )
| ~ big_p(a) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X1] :
( ( ~ big_p(b)
| big_p(c)
| ~ big_p(a) )
& ( big_p(c)
| ~ big_p(a)
| big_p(X1) ) )
<=> ! [X0] :
( ( ( big_p(X0)
=> big_p(b) )
& big_p(a) )
=> big_p(c) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X1] :
( ( ~ big_p(b)
| big_p(c)
| ~ big_p(a) )
& ( big_p(c)
| ~ big_p(a)
| big_p(X1) ) )
<=> ! [X0] :
( ( ( big_p(X0)
=> big_p(b) )
& big_p(a) )
=> big_p(c) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel33) ).
fof(f57,plain,
( ~ spl4_1
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f32,f48,f35]) ).
fof(f32,plain,
( ~ sP1
| ~ big_p(c) ),
inference(cnf_transformation,[],[f18]) ).
fof(f56,plain,
( spl4_2
| ~ spl4_4 ),
inference(avatar_split_clause,[],[f30,f48,f39]) ).
fof(f30,plain,
( ~ sP1
| big_p(a) ),
inference(cnf_transformation,[],[f18]) ).
fof(f46,plain,
( spl4_1
| ~ spl4_2
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f33,f43,f39,f35]) ).
fof(f33,plain,
( ~ big_p(b)
| ~ big_p(a)
| big_p(c) ),
inference(subsumption_resolution,[],[f28,f20]) ).
fof(f20,plain,
( ~ big_p(b)
| ~ sP1
| big_p(c)
| ~ big_p(a) ),
inference(cnf_transformation,[],[f11]) ).
fof(f28,plain,
( ~ big_p(a)
| sP1
| big_p(c)
| ~ big_p(b) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN063+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % 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.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 21:48:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 % (25165)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.46 % (25165)First to succeed.
% 0.18/0.48 % (25185)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.18/0.48 % (25174)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.18/0.48 % (25185)Refutation not found, incomplete strategy% (25185)------------------------------
% 0.18/0.48 % (25185)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48 % (25165)Refutation found. Thanks to Tanya!
% 0.18/0.48 % SZS status Theorem for theBenchmark
% 0.18/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.48 % (25165)------------------------------
% 0.18/0.48 % (25165)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48 % (25165)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.48 % (25165)Termination reason: Refutation
% 0.18/0.48
% 0.18/0.48 % (25165)Memory used [KB]: 6012
% 0.18/0.48 % (25165)Time elapsed: 0.093 s
% 0.18/0.48 % (25165)Instructions burned: 3 (million)
% 0.18/0.48 % (25165)------------------------------
% 0.18/0.48 % (25165)------------------------------
% 0.18/0.48 % (25161)Success in time 0.142 s
%------------------------------------------------------------------------------