TSTP Solution File: LCL674+1.001 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL674+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n028.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 : Sun May 5 07:51:26 EDT 2024
% Result : Theorem 0.19s 0.36s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 37 ( 8 unt; 0 def)
% Number of atoms : 414 ( 0 equ)
% Maximal formula atoms : 66 ( 11 avg)
% Number of connectives : 669 ( 292 ~; 230 |; 140 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 5 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 95 ( 77 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f114,plain,
$false,
inference(avatar_sat_refutation,[],[f78,f81,f83,f85,f113]) ).
fof(f113,plain,
( ~ spl3_2
| ~ spl3_3
| spl3_4
| ~ spl3_1 ),
inference(avatar_split_clause,[],[f99,f63,f75,f71,f67]) ).
fof(f67,plain,
( spl3_2
<=> r1(sK0,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f71,plain,
( spl3_3
<=> p100(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f75,plain,
( spl3_4
<=> p101(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f63,plain,
( spl3_1
<=> p2(sK2(sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f99,plain,
( p101(sK0)
| ~ p100(sK0)
| ~ r1(sK0,sK0)
| ~ spl3_1 ),
inference(resolution,[],[f65,f18]) ).
fof(f18,plain,
! [X1] :
( ~ p2(sK2(X1))
| p101(X1)
| ~ p100(X1)
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
( p100(sK0)
& ~ p101(sK0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ p100(X1)
| p101(X1)
| ( p101(sK1(X1))
& p2(sK1(X1))
& r1(X1,sK1(X1))
& p101(sK2(X1))
& ~ p2(sK2(X1))
& r1(X1,sK2(X1)) ) ) )
| ~ r1(sK0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(sK0,X8) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f14,f13,f12]) ).
fof(f12,plain,
( ? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) )
=> ( p100(sK0)
& ~ p101(sK0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) ) ) )
| ~ r1(sK0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(sK0,X8) ) ) ),
introduced(choice_axiom,[]) ).
fof(f13,plain,
! [X1] :
( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
=> ( p101(sK1(X1))
& p2(sK1(X1))
& r1(X1,sK1(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X1] :
( ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) )
=> ( p101(sK2(X1))
& ~ p2(sK2(X1))
& r1(X1,sK2(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(flattening,[],[f8]) ).
fof(f8,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ p100(X1)
| p101(X1)
| ( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
& ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,plain,
? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X6] :
( ~ ( p101(X6)
& p2(X6) )
| ~ r1(X1,X6) )
& ~ ! [X7] :
( ~ ( p101(X7)
& ~ p2(X7) )
| ~ r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f6,plain,
? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X6] :
( ~ ( p101(X6)
& ~ p102(X6)
& p2(X6) )
| ~ r1(X1,X6) )
& ~ ! [X7] :
( ~ ( p101(X7)
& ~ p102(X7)
& ~ p2(X7) )
| ~ r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(flattening,[],[f5]) ).
fof(f5,plain,
~ ~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X6] :
( ~ ( p101(X6)
& ~ p102(X6)
& p2(X6) )
| ~ r1(X1,X6) )
& ~ ! [X7] :
( ~ ( p101(X7)
& ~ p102(X7)
& ~ p2(X7) )
| ~ r1(X1,X7) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(rectify,[],[f4]) ).
fof(f4,negated_conjecture,
~ ~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X0] :
( ~ p100(X0)
| p1(X0)
| ~ r1(X1,X0) ) )
& ( p1(X1)
| ! [X0] :
( ~ p100(X0)
| ~ p1(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X0] :
( ~ p101(X0)
| p2(X0)
| ~ r1(X1,X0) ) )
& ( p2(X1)
| ! [X0] :
( ~ p101(X0)
| ~ p2(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& p2(X0) )
| ~ r1(X1,X0) )
& ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& ~ p2(X0) )
| ~ r1(X1,X0) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f3]) ).
fof(f3,conjecture,
~ ? [X0] :
~ ( ~ ( p100(X0)
& ~ p101(X0)
& ! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& ( ~ p102(X1)
| p101(X1) )
& ( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X0] :
( ~ p100(X0)
| p1(X0)
| ~ r1(X1,X0) ) )
& ( p1(X1)
| ! [X0] :
( ~ p100(X0)
| ~ p1(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X0] :
( ~ p101(X0)
| p2(X0)
| ~ r1(X1,X0) ) )
& ( p2(X1)
| ! [X0] :
( ~ p101(X0)
| ~ p2(X0)
| ~ r1(X1,X0) ) ) ) )
& ( ~ ( p100(X1)
& ~ p101(X1) )
| ( ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& p2(X0) )
| ~ r1(X1,X0) )
& ~ ! [X0] :
( ~ ( p101(X0)
& ~ p102(X0)
& ~ p2(X0) )
| ~ r1(X1,X0) ) ) ) )
| ~ r1(X0,X1) ) )
| ~ ! [X1] :
( p2(X1)
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
fof(f65,plain,
( p2(sK2(sK0))
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f63]) ).
fof(f85,plain,
~ spl3_4,
inference(avatar_contradiction_clause,[],[f84]) ).
fof(f84,plain,
( $false
| ~ spl3_4 ),
inference(resolution,[],[f77,f28]) ).
fof(f28,plain,
~ p101(sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f77,plain,
( p101(sK0)
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f75]) ).
fof(f83,plain,
spl3_3,
inference(avatar_contradiction_clause,[],[f82]) ).
fof(f82,plain,
( $false
| spl3_3 ),
inference(resolution,[],[f73,f29]) ).
fof(f29,plain,
p100(sK0),
inference(cnf_transformation,[],[f15]) ).
fof(f73,plain,
( ~ p100(sK0)
| spl3_3 ),
inference(avatar_component_clause,[],[f71]) ).
fof(f81,plain,
spl3_2,
inference(avatar_contradiction_clause,[],[f79]) ).
fof(f79,plain,
( $false
| spl3_2 ),
inference(resolution,[],[f69,f30]) ).
fof(f30,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(f69,plain,
( ~ r1(sK0,sK0)
| spl3_2 ),
inference(avatar_component_clause,[],[f67]) ).
fof(f78,plain,
( spl3_1
| ~ spl3_2
| ~ spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f37,f75,f71,f67,f63]) ).
fof(f37,plain,
( p101(sK0)
| ~ p100(sK0)
| ~ r1(sK0,sK0)
| p2(sK2(sK0)) ),
inference(resolution,[],[f17,f16]) ).
fof(f16,plain,
! [X8] :
( ~ r1(sK0,X8)
| p2(X8) ),
inference(cnf_transformation,[],[f15]) ).
fof(f17,plain,
! [X1] :
( r1(X1,sK2(X1))
| p101(X1)
| ~ p100(X1)
| ~ r1(sK0,X1) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL674+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 14:18:19 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % (6740)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (6744)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.19/0.36 % (6744)First to succeed.
% 0.19/0.36 % (6744)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6740"
% 0.19/0.36 % (6744)Refutation found. Thanks to Tanya!
% 0.19/0.36 % SZS status Theorem for theBenchmark
% 0.19/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.36 % (6744)------------------------------
% 0.19/0.36 % (6744)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.19/0.36 % (6744)Termination reason: Refutation
% 0.19/0.36
% 0.19/0.36 % (6744)Memory used [KB]: 786
% 0.19/0.36 % (6744)Time elapsed: 0.004 s
% 0.19/0.36 % (6744)Instructions burned: 7 (million)
% 0.19/0.36 % (6740)Success in time 0.013 s
%------------------------------------------------------------------------------