TSTP Solution File: SYN375+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN375+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 : n010.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:37:43 EDT 2022
% Result : Theorem 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 5 unt; 0 def)
% Number of atoms : 125 ( 0 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 146 ( 52 ~; 58 |; 17 &)
% ( 11 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 85 ( 54 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f48,plain,
$false,
inference(subsumption_resolution,[],[f47,f36]) ).
fof(f36,plain,
! [X1] : big_p(X1),
inference(resolution,[],[f34,f29]) ).
fof(f29,plain,
big_p(sK4),
inference(resolution,[],[f28,f26]) ).
fof(f26,plain,
big_p(sK3),
inference(subsumption_resolution,[],[f25,f18]) ).
fof(f18,plain,
! [X10,X11,X8,X7] :
( ~ big_p(X8)
| ~ big_p(X11)
| big_p(X7)
| big_p(X10) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ( ( ( ! [X1] : ~ big_p(X1)
| ~ big_p(sK0) )
& ( big_p(sK1)
| big_p(sK0) ) )
| ( ( ! [X3] : ~ big_p(X3)
| ~ big_p(sK2) )
& ( big_p(sK3)
| ! [X6] : big_p(X6) ) ) )
& ( ! [X7] :
( ( big_p(X7)
| ! [X8] : ~ big_p(X8) )
& ( big_p(sK4)
| ~ big_p(X7) ) )
| ( ( ! [X10] : big_p(X10)
| ! [X11] : ~ big_p(X11) )
& ( big_p(sK5)
| ~ big_p(sK6) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f6,f13,f12,f11,f10,f9,f8,f7]) ).
fof(f7,plain,
( ? [X0] :
( ( ! [X1] : ~ big_p(X1)
| ~ big_p(X0) )
& ( ? [X2] : big_p(X2)
| big_p(X0) ) )
=> ( ( ! [X1] : ~ big_p(X1)
| ~ big_p(sK0) )
& ( ? [X2] : big_p(X2)
| big_p(sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X2] : big_p(X2)
=> big_p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] : ~ big_p(X4)
=> ~ big_p(sK2) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X5] : big_p(X5)
=> big_p(sK3) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ? [X9] : big_p(X9)
=> big_p(sK4) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X12] : big_p(X12)
=> big_p(sK5) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ? [X13] : ~ big_p(X13)
=> ~ big_p(sK6) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ? [X0] :
( ( ! [X1] : ~ big_p(X1)
| ~ big_p(X0) )
& ( ? [X2] : big_p(X2)
| big_p(X0) ) )
| ( ( ! [X3] : ~ big_p(X3)
| ? [X4] : ~ big_p(X4) )
& ( ? [X5] : big_p(X5)
| ! [X6] : big_p(X6) ) ) )
& ( ! [X7] :
( ( big_p(X7)
| ! [X8] : ~ big_p(X8) )
& ( ? [X9] : big_p(X9)
| ~ big_p(X7) ) )
| ( ( ! [X10] : big_p(X10)
| ! [X11] : ~ big_p(X11) )
& ( ? [X12] : big_p(X12)
| ? [X13] : ~ big_p(X13) ) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ? [X2] :
( ( ! [X3] : ~ big_p(X3)
| ~ big_p(X2) )
& ( ? [X3] : big_p(X3)
| big_p(X2) ) )
| ( ( ! [X0] : ~ big_p(X0)
| ? [X1] : ~ big_p(X1) )
& ( ? [X0] : big_p(X0)
| ! [X1] : big_p(X1) ) ) )
& ( ! [X2] :
( ( big_p(X2)
| ! [X3] : ~ big_p(X3) )
& ( ? [X3] : big_p(X3)
| ~ big_p(X2) ) )
| ( ( ! [X1] : big_p(X1)
| ! [X0] : ~ big_p(X0) )
& ( ? [X0] : big_p(X0)
| ? [X1] : ~ big_p(X1) ) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ( ! [X1] : big_p(X1)
<=> ? [X0] : big_p(X0) )
<~> ! [X2] :
( big_p(X2)
<=> ? [X3] : big_p(X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ( ! [X1] : big_p(X1)
<=> ? [X0] : big_p(X0) )
<=> ! [X2] :
( big_p(X2)
<=> ? [X3] : big_p(X3) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ( ? [X1] : big_p(X1)
<=> ! [X0] : big_p(X0) )
<=> ! [X0] :
( ? [X1] : big_p(X1)
<=> big_p(X0) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ( ? [X1] : big_p(X1)
<=> ! [X0] : big_p(X0) )
<=> ! [X0] :
( ? [X1] : big_p(X1)
<=> big_p(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2126) ).
fof(f25,plain,
( big_p(sK1)
| big_p(sK3) ),
inference(subsumption_resolution,[],[f24,f18]) ).
fof(f24,plain,
! [X6] :
( big_p(X6)
| big_p(sK1)
| big_p(sK3) ),
inference(subsumption_resolution,[],[f19,f18]) ).
fof(f19,plain,
! [X6] :
( big_p(sK0)
| big_p(sK1)
| big_p(sK3)
| big_p(X6) ),
inference(cnf_transformation,[],[f14]) ).
fof(f28,plain,
! [X1] :
( ~ big_p(X1)
| big_p(sK4) ),
inference(subsumption_resolution,[],[f27,f16]) ).
fof(f16,plain,
! [X10,X11,X7] :
( ~ big_p(X11)
| big_p(X10)
| ~ big_p(X7)
| big_p(sK4) ),
inference(cnf_transformation,[],[f14]) ).
fof(f27,plain,
! [X0,X1] :
( ~ big_p(X1)
| big_p(X0)
| big_p(sK4) ),
inference(resolution,[],[f16,f26]) ).
fof(f34,plain,
! [X3,X4] :
( ~ big_p(X3)
| big_p(X4) ),
inference(subsumption_resolution,[],[f33,f18]) ).
fof(f33,plain,
! [X3,X4,X5] :
( big_p(X5)
| big_p(X4)
| ~ big_p(X3) ),
inference(resolution,[],[f18,f29]) ).
fof(f47,plain,
~ big_p(sK0),
inference(subsumption_resolution,[],[f46,f36]) ).
fof(f46,plain,
! [X0] :
( ~ big_p(X0)
| ~ big_p(sK0) ),
inference(subsumption_resolution,[],[f45,f36]) ).
fof(f45,plain,
! [X0,X1] :
( ~ big_p(X1)
| ~ big_p(sK0)
| ~ big_p(X0) ),
inference(resolution,[],[f22,f36]) ).
fof(f22,plain,
! [X3,X1] :
( ~ big_p(sK2)
| ~ big_p(sK0)
| ~ big_p(X1)
| ~ big_p(X3) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN375+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % 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.32 % Computer : n010.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Aug 30 21:41:58 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.47 % (10651)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/75Mi)
% 0.18/0.47 % (10646)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.18/0.47 % (10651)First to succeed.
% 0.18/0.48 % (10659)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/467Mi)
% 0.18/0.48 % (10651)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 % (10651)------------------------------
% 0.18/0.48 % (10651)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.48 % (10651)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.48 % (10651)Termination reason: Refutation
% 0.18/0.48
% 0.18/0.48 % (10651)Memory used [KB]: 895
% 0.18/0.48 % (10651)Time elapsed: 0.100 s
% 0.18/0.48 % (10651)Instructions burned: 2 (million)
% 0.18/0.48 % (10651)------------------------------
% 0.18/0.48 % (10651)------------------------------
% 0.18/0.48 % (10635)Success in time 0.15 s
%------------------------------------------------------------------------------