TSTP Solution File: SYN063+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n024.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:45 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 5
% Syntax : Number of formulae : 44 ( 6 unt; 0 def)
% Number of atoms : 213 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 280 ( 111 ~; 105 |; 51 &)
% ( 4 <=>; 6 =>; 0 <=; 3 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 31 ( 25 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f79,plain,
$false,
inference(resolution,[],[f76,f69]) ).
fof(f69,plain,
~ big_p(a),
inference(resolution,[],[f67,f55]) ).
fof(f55,plain,
~ sP1,
inference(duplicate_literal_removal,[],[f53]) ).
fof(f53,plain,
( ~ sP1
| ~ sP1 ),
inference(resolution,[],[f51,f32]) ).
fof(f32,plain,
( big_p(a)
| ~ sP1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( ( ( big_p(a)
& ( ~ big_p(sK3)
| big_p(b) )
& ~ big_p(c) )
| ~ sP1 )
& ( ! [X1] :
( ~ big_p(a)
| ( big_p(X1)
& ~ big_p(b) )
| big_p(c) )
| sP1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f16,f17]) ).
fof(f17,plain,
( ? [X0] :
( big_p(a)
& ( ~ big_p(X0)
| big_p(b) )
& ~ big_p(c) )
=> ( big_p(a)
& ( ~ big_p(sK3)
| big_p(b) )
& ~ big_p(c) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ( ? [X0] :
( big_p(a)
& ( ~ big_p(X0)
| big_p(b) )
& ~ big_p(c) )
| ~ sP1 )
& ( ! [X1] :
( ~ big_p(a)
| ( big_p(X1)
& ~ big_p(b) )
| big_p(c) )
| sP1 ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
( ( ? [X0] :
( big_p(a)
& ( ~ big_p(X0)
| big_p(b) )
& ~ big_p(c) )
| ~ sP1 )
& ( ! [X0] :
( ~ big_p(a)
| ( big_p(X0)
& ~ big_p(b) )
| big_p(c) )
| sP1 ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,plain,
( sP1
<~> ! [X0] :
( ~ big_p(a)
| ( big_p(X0)
& ~ big_p(b) )
| big_p(c) ) ),
inference(definition_folding,[],[f4,f6,f5]) ).
fof(f5,plain,
! [X1] :
( sP0(X1)
<=> ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f6,plain,
( sP1
<=> ! [X1] :
( ( big_p(c)
| ~ big_p(a)
| ~ big_p(b) )
& sP0(X1) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f4,plain,
( ! [X1] :
( ( big_p(c)
| ~ big_p(a)
| ~ big_p(b) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) )
<~> ! [X0] :
( ~ big_p(a)
| ( big_p(X0)
& ~ big_p(b) )
| big_p(c) ) ),
inference(flattening,[],[f3]) ).
fof(f3,plain,
( ! [X0] :
( big_p(c)
| ~ big_p(a)
| ( big_p(X0)
& ~ big_p(b) ) )
<~> ! [X1] :
( ( big_p(c)
| ~ big_p(a)
| ~ big_p(b) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( ( big_p(a)
& ( big_p(X0)
=> big_p(b) ) )
=> big_p(c) )
<=> ! [X1] :
( ( big_p(c)
| ~ big_p(a)
| ~ big_p(b) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( ( big_p(a)
& ( big_p(X0)
=> big_p(b) ) )
=> big_p(c) )
<=> ! [X1] :
( ( big_p(c)
| ~ big_p(a)
| ~ big_p(b) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel33) ).
fof(f51,plain,
( ~ big_p(a)
| ~ sP1 ),
inference(duplicate_literal_removal,[],[f50]) ).
fof(f50,plain,
( ~ big_p(a)
| ~ sP1
| ~ sP1 ),
inference(resolution,[],[f46,f19]) ).
fof(f19,plain,
! [X1] :
( sP0(X1)
| ~ sP1 ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( sP1
| ( ~ big_p(c)
& big_p(a)
& big_p(b) )
| ~ sP0(sK2) )
& ( ! [X1] :
( ( big_p(c)
| ~ big_p(a)
| ~ big_p(b) )
& sP0(X1) )
| ~ sP1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f9,f10]) ).
fof(f10,plain,
( ? [X0] :
( ( ~ big_p(c)
& big_p(a)
& big_p(b) )
| ~ sP0(X0) )
=> ( ( ~ big_p(c)
& big_p(a)
& big_p(b) )
| ~ sP0(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ( sP1
| ? [X0] :
( ( ~ big_p(c)
& big_p(a)
& big_p(b) )
| ~ sP0(X0) ) )
& ( ! [X1] :
( ( big_p(c)
| ~ big_p(a)
| ~ big_p(b) )
& sP0(X1) )
| ~ sP1 ) ),
inference(rectify,[],[f8]) ).
fof(f8,plain,
( ( sP1
| ? [X1] :
( ( ~ big_p(c)
& big_p(a)
& big_p(b) )
| ~ sP0(X1) ) )
& ( ! [X1] :
( ( big_p(c)
| ~ big_p(a)
| ~ big_p(b) )
& sP0(X1) )
| ~ sP1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f46,plain,
( ~ sP0(c)
| ~ sP1
| ~ big_p(a) ),
inference(duplicate_literal_removal,[],[f45]) ).
fof(f45,plain,
( ~ big_p(a)
| ~ sP0(c)
| ~ sP1
| ~ sP1 ),
inference(resolution,[],[f40,f30]) ).
fof(f30,plain,
( ~ big_p(c)
| ~ sP1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f40,plain,
( big_p(c)
| ~ sP1
| ~ big_p(a)
| ~ sP0(c) ),
inference(resolution,[],[f24,f30]) ).
fof(f24,plain,
! [X0] :
( big_p(X0)
| ~ sP0(X0)
| big_p(c)
| ~ big_p(a) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0] :
( ( sP0(X0)
| ( ~ big_p(c)
& ~ big_p(X0)
& big_p(a) ) )
& ( big_p(c)
| big_p(X0)
| ~ big_p(a)
| ~ sP0(X0) ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X1] :
( ( sP0(X1)
| ( ~ big_p(c)
& ~ big_p(X1)
& big_p(a) ) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a)
| ~ sP0(X1) ) ),
inference(flattening,[],[f12]) ).
fof(f12,plain,
! [X1] :
( ( sP0(X1)
| ( ~ big_p(c)
& ~ big_p(X1)
& big_p(a) ) )
& ( big_p(c)
| big_p(X1)
| ~ big_p(a)
| ~ sP0(X1) ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f67,plain,
( sP1
| ~ big_p(a) ),
inference(resolution,[],[f63,f33]) ).
fof(f33,plain,
( big_p(c)
| sP1
| ~ big_p(a) ),
inference(condensation,[],[f29]) ).
fof(f29,plain,
! [X1] :
( ~ big_p(a)
| sP1
| big_p(c)
| big_p(X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f63,plain,
~ big_p(c),
inference(duplicate_literal_removal,[],[f59]) ).
fof(f59,plain,
( ~ big_p(c)
| ~ big_p(c) ),
inference(resolution,[],[f56,f27]) ).
fof(f27,plain,
! [X0] :
( sP0(X0)
| ~ big_p(c) ),
inference(cnf_transformation,[],[f14]) ).
fof(f56,plain,
( ~ sP0(sK2)
| ~ big_p(c) ),
inference(resolution,[],[f55,f23]) ).
fof(f23,plain,
( sP1
| ~ sP0(sK2)
| ~ big_p(c) ),
inference(cnf_transformation,[],[f11]) ).
fof(f76,plain,
big_p(a),
inference(resolution,[],[f73,f25]) ).
fof(f25,plain,
! [X0] :
( sP0(X0)
| big_p(a) ),
inference(cnf_transformation,[],[f14]) ).
fof(f73,plain,
~ sP0(sK2),
inference(resolution,[],[f70,f55]) ).
fof(f70,plain,
( sP1
| ~ sP0(sK2) ),
inference(resolution,[],[f69,f22]) ).
fof(f22,plain,
( big_p(a)
| ~ sP0(sK2)
| sP1 ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN063+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.35 % Computer : n024.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Tue Aug 30 21:29:19 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.20/0.49 % (10057)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.49 % (10057)First to succeed.
% 0.20/0.50 % (10072)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/482Mi)
% 0.20/0.50 % (10070)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.20/0.50 % (10064)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/99Mi)
% 0.20/0.51 % (10062)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/68Mi)
% 0.20/0.51 % (10057)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (10057)------------------------------
% 0.20/0.51 % (10057)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (10057)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (10057)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (10057)Memory used [KB]: 895
% 0.20/0.51 % (10057)Time elapsed: 0.089 s
% 0.20/0.51 % (10057)Instructions burned: 2 (million)
% 0.20/0.51 % (10057)------------------------------
% 0.20/0.51 % (10057)------------------------------
% 0.20/0.51 % (10047)Success in time 0.151 s
%------------------------------------------------------------------------------