TSTP Solution File: LCL656+1.001 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : LCL656+1.001 : TPTP v8.1.0. Released v4.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 : n012.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 17:44:00 EDT 2022
% Result : Theorem 0.18s 0.49s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 296 ( 0 equ)
% Maximal formula atoms : 37 ( 9 avg)
% Number of connectives : 496 ( 230 ~; 171 |; 93 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 68 ( 57 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f161,plain,
$false,
inference(avatar_sat_refutation,[],[f50,f72,f160]) ).
fof(f160,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f159]) ).
fof(f159,plain,
( $false
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f158,f21]) ).
fof(f21,plain,
~ p101(sK0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,plain,
? [X0] :
( ! [X2] :
( ~ r1(X0,X2)
| ( ( ~ p101(X2)
| ( ( ! [X8] :
( ~ p2(X8)
| ~ r1(X2,X8)
| ~ p101(X8) )
| p2(X2) )
& ( ~ p2(X2)
| ! [X7] :
( ~ p101(X7)
| ~ r1(X2,X7)
| p2(X7) ) ) ) )
& ( ~ p100(X2)
| p101(X2)
| ( ? [X6] :
( ~ p2(X6)
& p101(X6)
& r1(X2,X6) )
& ? [X5] :
( p101(X5)
& p2(X5)
& r1(X2,X5) ) ) )
& ( p100(X2)
| ~ p101(X2) )
& ( ~ p100(X2)
| ( ( ! [X4] :
( ~ p100(X4)
| ~ p1(X4)
| ~ r1(X2,X4) )
| p1(X2) )
& ( ~ p1(X2)
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3)
| ~ p100(X3) ) ) ) ) ) )
& ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
& p100(X0)
& ~ p101(X0) ),
inference(flattening,[],[f7]) ).
fof(f7,plain,
? [X0] :
( ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
& ! [X2] :
( ( ( ( ? [X6] :
( ~ p2(X6)
& p101(X6)
& r1(X2,X6) )
& ? [X5] :
( r1(X2,X5)
& p101(X5)
& p2(X5) ) )
| ~ p100(X2)
| p101(X2) )
& ( ~ p101(X2)
| ( ( ! [X8] :
( ~ p2(X8)
| ~ r1(X2,X8)
| ~ p101(X8) )
| p2(X2) )
& ( ~ p2(X2)
| ! [X7] :
( ~ p101(X7)
| ~ r1(X2,X7)
| p2(X7) ) ) ) )
& ( p100(X2)
| ~ p101(X2) )
& ( ~ p100(X2)
| ( ( ! [X4] :
( ~ p100(X4)
| ~ p1(X4)
| ~ r1(X2,X4) )
| p1(X2) )
& ( ~ p1(X2)
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3)
| ~ p100(X3) ) ) ) ) )
| ~ r1(X0,X2) )
& ~ p101(X0)
& p100(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,plain,
? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ( ! [X2] :
( ( ( ( ~ ! [X6] :
( ~ ( ~ p2(X6)
& p101(X6) )
| ~ r1(X2,X6) )
& ~ ! [X5] :
( ~ r1(X2,X5)
| ~ ( p101(X5)
& p2(X5) ) ) )
| ~ ( p100(X2)
& ~ p101(X2) ) )
& ( ~ p101(X2)
| ( ( ! [X8] :
( ~ p2(X8)
| ~ r1(X2,X8)
| ~ p101(X8) )
| p2(X2) )
& ( ~ p2(X2)
| ! [X7] :
( ~ p101(X7)
| ~ r1(X2,X7)
| p2(X7) ) ) ) )
& ( p100(X2)
| ~ p101(X2) )
& ( ~ p100(X2)
| ( ( ! [X4] :
( ~ p100(X4)
| ~ p1(X4)
| ~ r1(X2,X4) )
| p1(X2) )
& ( ~ p1(X2)
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3)
| ~ p100(X3) ) ) ) ) )
| ~ r1(X0,X2) )
& ~ p101(X0)
& p100(X0) ) ),
inference(pure_predicate_removal,[],[f5]) ).
fof(f5,plain,
? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ( ! [X2] :
( ( ( p101(X2)
| ~ p102(X2) )
& ( ( ~ ! [X6] :
( ~ ( ~ p2(X6)
& ~ p102(X6)
& p101(X6) )
| ~ r1(X2,X6) )
& ~ ! [X5] :
( ~ r1(X2,X5)
| ~ ( ~ p102(X5)
& p101(X5)
& p2(X5) ) ) )
| ~ ( p100(X2)
& ~ p101(X2) ) )
& ( ~ p101(X2)
| ( ( ! [X8] :
( ~ p2(X8)
| ~ r1(X2,X8)
| ~ p101(X8) )
| p2(X2) )
& ( ~ p2(X2)
| ! [X7] :
( ~ p101(X7)
| ~ r1(X2,X7)
| p2(X7) ) ) ) )
& ( p100(X2)
| ~ p101(X2) )
& ( ~ p100(X2)
| ( ( ! [X4] :
( ~ p100(X4)
| ~ p1(X4)
| ~ r1(X2,X4) )
| p1(X2) )
& ( ~ p1(X2)
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3)
| ~ p100(X3) ) ) ) ) )
| ~ r1(X0,X2) )
& ~ p101(X0)
& p100(X0) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ( ! [X2] :
( ( ( p101(X2)
| ~ p102(X2) )
& ( ( ~ ! [X6] :
( ~ ( ~ p2(X6)
& ~ p102(X6)
& p101(X6) )
| ~ r1(X2,X6) )
& ~ ! [X5] :
( ~ r1(X2,X5)
| ~ ( ~ p102(X5)
& p101(X5)
& p2(X5) ) ) )
| ~ ( p100(X2)
& ~ p101(X2) ) )
& ( ~ p101(X2)
| ( ( ! [X8] :
( ~ p2(X8)
| ~ r1(X2,X8)
| ~ p101(X8) )
| p2(X2) )
& ( ~ p2(X2)
| ! [X7] :
( ~ p101(X7)
| ~ r1(X2,X7)
| p2(X7) ) ) ) )
& ( p100(X2)
| ~ p101(X2) )
& ( ~ p100(X2)
| ( ( ! [X4] :
( ~ p100(X4)
| ~ p1(X4)
| ~ r1(X2,X4) )
| p1(X2) )
& ( ~ p1(X2)
| ! [X3] :
( p1(X3)
| ~ r1(X2,X3)
| ~ p100(X3) ) ) ) ) )
| ~ r1(X0,X2) )
& ~ p101(X0)
& p100(X0) ) ),
inference(rectify,[],[f3]) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ( p100(X0)
& ! [X1] :
( ~ r1(X0,X1)
| ( ( p100(X1)
| ~ p101(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ( ( ~ p1(X1)
| ! [X0] :
( ~ p100(X0)
| ~ r1(X1,X0)
| p1(X0) ) )
& ( ! [X0] :
( ~ p100(X0)
| ~ p1(X0)
| ~ r1(X1,X0) )
| p1(X1) ) )
| ~ p100(X1) )
& ( ( ~ ! [X0] :
( ~ ( p2(X0)
& p101(X0)
& ~ p102(X0) )
| ~ r1(X1,X0) )
& ~ ! [X0] :
( ~ ( ~ p2(X0)
& ~ p102(X0)
& p101(X0) )
| ~ r1(X1,X0) ) )
| ~ ( p100(X1)
& ~ p101(X1) ) )
& ( ( ( ~ p2(X1)
| ! [X0] :
( p2(X0)
| ~ r1(X1,X0)
| ~ p101(X0) ) )
& ( ! [X0] :
( ~ p2(X0)
| ~ p101(X0)
| ~ r1(X1,X0) )
| p2(X1) ) )
| ~ p101(X1) ) ) )
& ~ p101(X0) ) ),
inference(negated_conjecture,[],[f2]) ).
fof(f2,conjecture,
~ ? [X0] :
~ ( ~ ! [X1] :
( ~ r1(X0,X1)
| p2(X1) )
| ~ ( p100(X0)
& ! [X1] :
( ~ r1(X0,X1)
| ( ( p100(X1)
| ~ p101(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ( ( ~ p1(X1)
| ! [X0] :
( ~ p100(X0)
| ~ r1(X1,X0)
| p1(X0) ) )
& ( ! [X0] :
( ~ p100(X0)
| ~ p1(X0)
| ~ r1(X1,X0) )
| p1(X1) ) )
| ~ p100(X1) )
& ( ( ~ ! [X0] :
( ~ ( p2(X0)
& p101(X0)
& ~ p102(X0) )
| ~ r1(X1,X0) )
& ~ ! [X0] :
( ~ ( ~ p2(X0)
& ~ p102(X0)
& p101(X0) )
| ~ r1(X1,X0) ) )
| ~ ( p100(X1)
& ~ p101(X1) ) )
& ( ( ( ~ p2(X1)
| ! [X0] :
( p2(X0)
| ~ r1(X1,X0)
| ~ p101(X0) ) )
& ( ! [X0] :
( ~ p2(X0)
| ~ p101(X0)
| ~ r1(X1,X0) )
| p2(X1) ) )
| ~ p101(X1) ) ) )
& ~ p101(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f158,plain,
( p101(sK0)
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f157,f22]) ).
fof(f22,plain,
p100(sK0),
inference(cnf_transformation,[],[f8]) ).
fof(f157,plain,
( ~ p100(sK0)
| p101(sK0)
| ~ spl3_4 ),
inference(subsumption_resolution,[],[f156,f23]) ).
fof(f23,plain,
! [X0] : r1(X0,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0] : r1(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
fof(f156,plain,
( ~ r1(sK0,sK0)
| p101(sK0)
| ~ p100(sK0)
| ~ spl3_4 ),
inference(resolution,[],[f49,f15]) ).
fof(f15,plain,
! [X2] :
( ~ p2(sK2(X2))
| ~ p100(X2)
| ~ r1(sK0,X2)
| p101(X2) ),
inference(cnf_transformation,[],[f8]) ).
fof(f49,plain,
( p2(sK2(sK0))
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f47]) ).
fof(f47,plain,
( spl3_4
<=> p2(sK2(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f72,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f63]) ).
fof(f63,plain,
( $false
| spl3_2 ),
inference(resolution,[],[f23,f38]) ).
fof(f38,plain,
( ~ r1(sK0,sK0)
| spl3_2 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f36,plain,
( spl3_2
<=> r1(sK0,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f50,plain,
( ~ spl3_2
| spl3_4 ),
inference(avatar_split_clause,[],[f45,f47,f36]) ).
fof(f45,plain,
( p2(sK2(sK0))
| ~ r1(sK0,sK0) ),
inference(subsumption_resolution,[],[f44,f22]) ).
fof(f44,plain,
( ~ r1(sK0,sK0)
| p2(sK2(sK0))
| ~ p100(sK0) ),
inference(subsumption_resolution,[],[f28,f21]) ).
fof(f28,plain,
( p101(sK0)
| ~ r1(sK0,sK0)
| ~ p100(sK0)
| p2(sK2(sK0)) ),
inference(resolution,[],[f13,f20]) ).
fof(f20,plain,
! [X1] :
( ~ r1(sK0,X1)
| p2(X1) ),
inference(cnf_transformation,[],[f8]) ).
fof(f13,plain,
! [X2] :
( r1(X2,sK2(X2))
| ~ r1(sK0,X2)
| p101(X2)
| ~ p100(X2) ),
inference(cnf_transformation,[],[f8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL656+1.001 : TPTP v8.1.0. Released v4.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 : n012.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 02:16:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.47 % (30339)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.18/0.48 % (30339)First to succeed.
% 0.18/0.48 % (30323)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.18/0.48 % (30332)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.49 % (30339)Refutation found. Thanks to Tanya!
% 0.18/0.49 % SZS status Theorem for theBenchmark
% 0.18/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.49 % (30339)------------------------------
% 0.18/0.49 % (30339)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.49 % (30339)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.49 % (30339)Termination reason: Refutation
% 0.18/0.49
% 0.18/0.49 % (30339)Memory used [KB]: 6012
% 0.18/0.49 % (30339)Time elapsed: 0.095 s
% 0.18/0.49 % (30339)Instructions burned: 3 (million)
% 0.18/0.49 % (30339)------------------------------
% 0.18/0.49 % (30339)------------------------------
% 0.18/0.49 % (30318)Success in time 0.152 s
%------------------------------------------------------------------------------