TSTP Solution File: SYN375+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---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_uns --cores 0 -t %d %s
% Computer : n006.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:26:25 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 46 ( 1 unt; 0 def)
% Number of atoms : 165 ( 0 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 190 ( 71 ~; 77 |; 17 &)
% ( 17 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 7 prp; 0-1 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 73 ( 42 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f79,plain,
$false,
inference(avatar_sat_refutation,[],[f34,f62,f63,f66,f68,f70,f74,f76,f78]) ).
fof(f78,plain,
( ~ spl7_2
| ~ spl7_8 ),
inference(avatar_contradiction_clause,[],[f77]) ).
fof(f77,plain,
( $false
| ~ spl7_2
| ~ spl7_8 ),
inference(subsumption_resolution,[],[f55,f29]) ).
fof(f29,plain,
( ! [X5] : ~ big_p(X5)
| ~ spl7_2 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f28,plain,
( spl7_2
<=> ! [X5] : ~ big_p(X5) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f55,plain,
( big_p(sK1)
| ~ spl7_8 ),
inference(avatar_component_clause,[],[f53]) ).
fof(f53,plain,
( spl7_8
<=> big_p(sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_8])]) ).
fof(f76,plain,
( ~ spl7_2
| ~ spl7_9 ),
inference(avatar_contradiction_clause,[],[f75]) ).
fof(f75,plain,
( $false
| ~ spl7_2
| ~ spl7_9 ),
inference(resolution,[],[f61,f29]) ).
fof(f61,plain,
( big_p(sK3)
| ~ spl7_9 ),
inference(avatar_component_clause,[],[f59]) ).
fof(f59,plain,
( spl7_9
<=> big_p(sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_9])]) ).
fof(f74,plain,
( ~ spl7_1
| ~ spl7_2 ),
inference(avatar_contradiction_clause,[],[f73]) ).
fof(f73,plain,
( $false
| ~ spl7_1
| ~ spl7_2 ),
inference(resolution,[],[f29,f25]) ).
fof(f25,plain,
( big_p(sK2)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl7_1
<=> big_p(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f70,plain,
( ~ spl7_2
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f69]) ).
fof(f69,plain,
( $false
| ~ spl7_2
| ~ spl7_5 ),
inference(subsumption_resolution,[],[f29,f41]) ).
fof(f41,plain,
( ! [X7] : big_p(X7)
| ~ spl7_5 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f40,plain,
( spl7_5
<=> ! [X7] : big_p(X7) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
fof(f68,plain,
( spl7_1
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f67]) ).
fof(f67,plain,
( $false
| spl7_1
| ~ spl7_5 ),
inference(subsumption_resolution,[],[f26,f41]) ).
fof(f26,plain,
( ~ big_p(sK2)
| spl7_1 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f66,plain,
( spl7_3
| ~ spl7_5 ),
inference(avatar_contradiction_clause,[],[f65]) ).
fof(f65,plain,
( $false
| spl7_3
| ~ spl7_5 ),
inference(subsumption_resolution,[],[f33,f41]) ).
fof(f33,plain,
( ~ big_p(sK0)
| spl7_3 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f31,plain,
( spl7_3
<=> big_p(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f63,plain,
( spl7_2
| spl7_2
| spl7_5
| spl7_5 ),
inference(avatar_split_clause,[],[f18,f40,f40,f28,f28]) ).
fof(f18,plain,
! [X11,X8,X7,X12] :
( big_p(X11)
| big_p(X7)
| ~ big_p(X8)
| ~ big_p(X12) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
( ( ( ( ! [X0] : ~ big_p(X0)
| ~ big_p(sK0) )
& ( big_p(sK1)
| ! [X3] : big_p(X3) ) )
| ( ( ! [X5] : ~ big_p(X5)
| ~ big_p(sK2) )
& ( big_p(sK3)
| big_p(sK2) ) ) )
& ( ( ( ! [X7] : big_p(X7)
| ! [X8] : ~ big_p(X8) )
& ( big_p(sK4)
| ~ big_p(sK5) ) )
| ! [X11] :
( ( big_p(X11)
| ! [X12] : ~ big_p(X12) )
& ( big_p(sK6)
| ~ big_p(X11) ) ) ) ),
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,
( ? [X1] : ~ big_p(X1)
=> ~ big_p(sK0) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
( ? [X2] : big_p(X2)
=> big_p(sK1) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] :
( ( ! [X5] : ~ big_p(X5)
| ~ big_p(X4) )
& ( ? [X6] : big_p(X6)
| big_p(X4) ) )
=> ( ( ! [X5] : ~ big_p(X5)
| ~ big_p(sK2) )
& ( ? [X6] : big_p(X6)
| big_p(sK2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X6] : big_p(X6)
=> big_p(sK3) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
( ? [X9] : big_p(X9)
=> big_p(sK4) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
( ? [X10] : ~ big_p(X10)
=> ~ big_p(sK5) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
( ? [X13] : big_p(X13)
=> big_p(sK6) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ( ( ! [X0] : ~ big_p(X0)
| ? [X1] : ~ big_p(X1) )
& ( ? [X2] : big_p(X2)
| ! [X3] : big_p(X3) ) )
| ? [X4] :
( ( ! [X5] : ~ big_p(X5)
| ~ big_p(X4) )
& ( ? [X6] : big_p(X6)
| big_p(X4) ) ) )
& ( ( ( ! [X7] : big_p(X7)
| ! [X8] : ~ big_p(X8) )
& ( ? [X9] : big_p(X9)
| ? [X10] : ~ big_p(X10) ) )
| ! [X11] :
( ( big_p(X11)
| ! [X12] : ~ big_p(X12) )
& ( ? [X13] : big_p(X13)
| ~ big_p(X11) ) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ( ( ! [X3] : ~ big_p(X3)
| ? [X2] : ~ big_p(X2) )
& ( ? [X3] : big_p(X3)
| ! [X2] : big_p(X2) ) )
| ? [X0] :
( ( ! [X1] : ~ big_p(X1)
| ~ big_p(X0) )
& ( ? [X1] : big_p(X1)
| big_p(X0) ) ) )
& ( ( ( ! [X2] : big_p(X2)
| ! [X3] : ~ big_p(X3) )
& ( ? [X3] : big_p(X3)
| ? [X2] : ~ big_p(X2) ) )
| ! [X0] :
( ( big_p(X0)
| ! [X1] : ~ big_p(X1) )
& ( ? [X1] : big_p(X1)
| ~ big_p(X0) ) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<~> ( ! [X2] : big_p(X2)
<=> ? [X3] : big_p(X3) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<=> ( ! [X2] : big_p(X2)
<=> ? [X3] : big_p(X3) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<=> ( ! [X0] : big_p(X0)
<=> ? [X1] : big_p(X1) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ! [X0] :
( big_p(X0)
<=> ? [X1] : big_p(X1) )
<=> ( ! [X0] : big_p(X0)
<=> ? [X1] : big_p(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2126) ).
fof(f62,plain,
( spl7_5
| spl7_9
| spl7_1
| spl7_8 ),
inference(avatar_split_clause,[],[f19,f53,f24,f59,f40]) ).
fof(f19,plain,
! [X3] :
( big_p(sK1)
| big_p(sK2)
| big_p(sK3)
| big_p(X3) ),
inference(cnf_transformation,[],[f14]) ).
fof(f34,plain,
( ~ spl7_1
| spl7_2
| ~ spl7_3
| spl7_2 ),
inference(avatar_split_clause,[],[f22,f28,f31,f28,f24]) ).
fof(f22,plain,
! [X0,X5] :
( ~ big_p(X0)
| ~ big_p(sK0)
| ~ big_p(X5)
| ~ big_p(sK2) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN375+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/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 : n006.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:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.49 % (19212)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.49 % (19216)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.19/0.49 % (19204)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.49 % (19208)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.49 % (19212)Instruction limit reached!
% 0.19/0.49 % (19212)------------------------------
% 0.19/0.49 % (19212)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (19212)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (19212)Termination reason: Unknown
% 0.19/0.49 % (19212)Termination phase: Saturation
% 0.19/0.49
% 0.19/0.49 % (19212)Memory used [KB]: 5884
% 0.19/0.49 % (19212)Time elapsed: 0.095 s
% 0.19/0.49 % (19212)Instructions burned: 2 (million)
% 0.19/0.49 % (19212)------------------------------
% 0.19/0.49 % (19212)------------------------------
% 0.19/0.49 % (19208)First to succeed.
% 0.19/0.49 % (19208)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (19208)------------------------------
% 0.19/0.49 % (19208)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (19208)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (19208)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (19208)Memory used [KB]: 5884
% 0.19/0.49 % (19208)Time elapsed: 0.053 s
% 0.19/0.49 % (19208)Instructions burned: 1 (million)
% 0.19/0.49 % (19208)------------------------------
% 0.19/0.49 % (19208)------------------------------
% 0.19/0.49 % (19193)Success in time 0.15 s
%------------------------------------------------------------------------------