TSTP Solution File: LCL656+1.001 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL656+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 : n027.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:09 EDT 2024
% Result : Theorem 0.12s 0.35s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 44 ( 11 unt; 0 def)
% Number of atoms : 386 ( 0 equ)
% Maximal formula atoms : 37 ( 8 avg)
% Number of connectives : 615 ( 273 ~; 204 |; 136 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 107 ( 88 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f76,plain,
$false,
inference(subsumption_resolution,[],[f75,f67]) ).
fof(f67,plain,
~ p2(sK7(sK8)),
inference(resolution,[],[f64,f49]) ).
fof(f49,plain,
! [X0] :
( ~ sP0(X0)
| ~ p2(sK7(X0)) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0] :
( ( p101(sK7(X0))
& ~ p2(sK7(X0))
& r1(X0,sK7(X0)) )
| ~ sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK7])],[f29,f30]) ).
fof(f30,plain,
! [X0] :
( ? [X1] :
( p101(X1)
& ~ p2(X1)
& r1(X0,X1) )
=> ( p101(sK7(X0))
& ~ p2(sK7(X0))
& r1(X0,sK7(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f29,plain,
! [X0] :
( ? [X1] :
( p101(X1)
& ~ p2(X1)
& r1(X0,X1) )
| ~ sP0(X0) ),
inference(rectify,[],[f28]) ).
fof(f28,plain,
! [X1] :
( ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) )
| ~ sP0(X1) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X1] :
( ? [X7] :
( p101(X7)
& ~ p2(X7)
& r1(X1,X7) )
| ~ sP0(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f64,plain,
sP0(sK8),
inference(subsumption_resolution,[],[f63,f54]) ).
fof(f54,plain,
p100(sK8),
inference(cnf_transformation,[],[f34]) ).
fof(f34,plain,
( p100(sK8)
& ~ p101(sK8)
& ! [X1] :
( sP5(X1)
| ~ r1(sK8,X1) )
& ! [X2] :
( p2(X2)
| ~ r1(sK8,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f32,f33]) ).
fof(f33,plain,
( ? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( sP5(X1)
| ~ r1(X0,X1) )
& ! [X2] :
( p2(X2)
| ~ r1(X0,X2) ) )
=> ( p100(sK8)
& ~ p101(sK8)
& ! [X1] :
( sP5(X1)
| ~ r1(sK8,X1) )
& ! [X2] :
( p2(X2)
| ~ r1(sK8,X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( sP5(X1)
| ~ r1(X0,X1) )
& ! [X2] :
( p2(X2)
| ~ r1(X0,X2) ) ),
inference(rectify,[],[f15]) ).
fof(f15,plain,
? [X0] :
( p100(X0)
& ~ p101(X0)
& ! [X1] :
( sP5(X1)
| ~ r1(X0,X1) )
& ! [X8] :
( p2(X8)
| ~ r1(X0,X8) ) ),
inference(definition_folding,[],[f8,f14,f13,f12,f11,f10,f9]) ).
fof(f10,plain,
! [X1] :
( ? [X6] :
( p101(X6)
& p2(X6)
& r1(X1,X6) )
| ~ sP1(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f11,plain,
! [X1] :
( ~ p100(X1)
| p101(X1)
| ( sP1(X1)
& sP0(X1) )
| ~ sP2(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f12,plain,
! [X1] :
( ~ p101(X1)
| ( ( ~ p2(X1)
| ! [X4] :
( ~ p101(X4)
| p2(X4)
| ~ r1(X1,X4) ) )
& ( p2(X1)
| ! [X5] :
( ~ p101(X5)
| ~ p2(X5)
| ~ r1(X1,X5) ) ) )
| ~ sP3(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP3])]) ).
fof(f13,plain,
! [X1] :
( ~ p100(X1)
| ( ( ~ p1(X1)
| ! [X2] :
( ~ p100(X2)
| p1(X2)
| ~ r1(X1,X2) ) )
& ( p1(X1)
| ! [X3] :
( ~ p100(X3)
| ~ p1(X3)
| ~ r1(X1,X3) ) ) )
| ~ sP4(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f14,plain,
! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& sP4(X1)
& sP3(X1)
& sP2(X1) )
| ~ sP5(X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP5])]) ).
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(flattening,[],[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(ennf_transformation,[],[f6]) ).
fof(f6,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,[],[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(flattening,[],[f4]) ).
fof(f4,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,[],[f3]) ).
fof(f3,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,[],[f2]) ).
fof(f2,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(f63,plain,
( sP0(sK8)
| ~ p100(sK8) ),
inference(subsumption_resolution,[],[f62,f53]) ).
fof(f53,plain,
~ p101(sK8),
inference(cnf_transformation,[],[f34]) ).
fof(f62,plain,
( p101(sK8)
| sP0(sK8)
| ~ p100(sK8) ),
inference(resolution,[],[f43,f58]) ).
fof(f58,plain,
sP2(sK8),
inference(resolution,[],[f35,f56]) ).
fof(f56,plain,
sP5(sK8),
inference(resolution,[],[f55,f52]) ).
fof(f52,plain,
! [X1] :
( ~ r1(sK8,X1)
| sP5(X1) ),
inference(cnf_transformation,[],[f34]) ).
fof(f55,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(f35,plain,
! [X0] :
( ~ sP5(X0)
| sP2(X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0] :
( ( ( ~ p101(X0)
| p100(X0) )
& sP4(X0)
& sP3(X0)
& sP2(X0) )
| ~ sP5(X0) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X1] :
( ( ( ~ p101(X1)
| p100(X1) )
& sP4(X1)
& sP3(X1)
& sP2(X1) )
| ~ sP5(X1) ),
inference(nnf_transformation,[],[f14]) ).
fof(f43,plain,
! [X0] :
( ~ sP2(X0)
| p101(X0)
| sP0(X0)
| ~ p100(X0) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0] :
( ~ p100(X0)
| p101(X0)
| ( sP1(X0)
& sP0(X0) )
| ~ sP2(X0) ),
inference(rectify,[],[f22]) ).
fof(f22,plain,
! [X1] :
( ~ p100(X1)
| p101(X1)
| ( sP1(X1)
& sP0(X1) )
| ~ sP2(X1) ),
inference(nnf_transformation,[],[f11]) ).
fof(f75,plain,
p2(sK7(sK8)),
inference(resolution,[],[f65,f51]) ).
fof(f51,plain,
! [X2] :
( ~ r1(sK8,X2)
| p2(X2) ),
inference(cnf_transformation,[],[f34]) ).
fof(f65,plain,
r1(sK8,sK7(sK8)),
inference(resolution,[],[f64,f48]) ).
fof(f48,plain,
! [X0] :
( ~ sP0(X0)
| r1(X0,sK7(X0)) ),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.12 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.32 % Computer : n027.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 : Fri May 3 13:54:21 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.33 % (21547)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.34 % (21552)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.12/0.34 % (21550)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.12/0.34 % (21549)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.12/0.34 % (21554)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.12/0.34 % (21548)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.12/0.34 % (21551)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.12/0.34 % (21553)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.12/0.34 TRYING [1]
% 0.12/0.34 TRYING [1]
% 0.12/0.34 TRYING [2]
% 0.12/0.34 TRYING [1]
% 0.12/0.34 TRYING [2]
% 0.12/0.34 TRYING [1]
% 0.12/0.34 TRYING [2]
% 0.12/0.34 % (21554)Also succeeded, but the first one will report.
% 0.12/0.34 % (21552)First to succeed.
% 0.12/0.34 TRYING [3]
% 0.12/0.34 TRYING [2]
% 0.12/0.34 TRYING [3]
% 0.12/0.34 % (21553)Also succeeded, but the first one will report.
% 0.12/0.34 TRYING [3]
% 0.12/0.34 TRYING [4]
% 0.12/0.34 % (21550)Also succeeded, but the first one will report.
% 0.12/0.34 TRYING [4]
% 0.12/0.35 TRYING [4]
% 0.12/0.35 % (21552)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21547"
% 0.12/0.35 TRYING [5]
% 0.12/0.35 TRYING [5]
% 0.12/0.35 % (21552)Refutation found. Thanks to Tanya!
% 0.12/0.35 % SZS status Theorem for theBenchmark
% 0.12/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.35 % (21552)------------------------------
% 0.12/0.35 % (21552)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.35 % (21552)Termination reason: Refutation
% 0.12/0.35
% 0.12/0.35 % (21552)Memory used [KB]: 743
% 0.12/0.35 % (21552)Time elapsed: 0.004 s
% 0.12/0.35 % (21552)Instructions burned: 5 (million)
% 0.12/0.35 % (21547)Success in time 0.019 s
%------------------------------------------------------------------------------