TSTP Solution File: LCL664+1.001 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : LCL664+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 : n020.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:18 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 4 unt; 0 def)
% Number of atoms : 187 ( 0 equ)
% Maximal formula atoms : 18 ( 8 avg)
% Number of connectives : 300 ( 135 ~; 128 |; 32 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 112 ( 80 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f31,plain,
$false,
inference(subsumption_resolution,[],[f28,f24]) ).
fof(f24,plain,
~ p12(sK2),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
( r1(sK0,sK1)
& ~ p12(sK2)
& r1(sK0,sK2)
& r1(sK0,sK3)
& r1(sK0,sK4)
& ! [X5] :
( p12(X5)
| ~ r1(sK0,X5) )
& ! [X6] :
( p12(X6)
| ~ r1(sK0,X6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f12,f17,f16,f15,f14,f13]) ).
fof(f13,plain,
( ? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] :
( ~ p12(X2)
& r1(X0,X2) )
& ? [X3] : r1(X0,X3)
& ? [X4] : r1(X0,X4)
& ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
& ! [X6] :
( p12(X6)
| ~ r1(X0,X6) ) )
=> ( ? [X1] : r1(sK0,X1)
& ? [X2] :
( ~ p12(X2)
& r1(sK0,X2) )
& ? [X3] : r1(sK0,X3)
& ? [X4] : r1(sK0,X4)
& ! [X5] :
( p12(X5)
| ~ r1(sK0,X5) )
& ! [X6] :
( p12(X6)
| ~ r1(sK0,X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
( ? [X1] : r1(sK0,X1)
=> r1(sK0,sK1) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
( ? [X2] :
( ~ p12(X2)
& r1(sK0,X2) )
=> ( ~ p12(sK2)
& r1(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
( ? [X3] : r1(sK0,X3)
=> r1(sK0,sK3) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
( ? [X4] : r1(sK0,X4)
=> r1(sK0,sK4) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] :
( ~ p12(X2)
& r1(X0,X2) )
& ? [X3] : r1(X0,X3)
& ? [X4] : r1(X0,X4)
& ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
& ! [X6] :
( p12(X6)
| ~ r1(X0,X6) ) ),
inference(rectify,[],[f11]) ).
fof(f11,plain,
? [X0] :
( ? [X1] : r1(X0,X1)
& ? [X2] :
( ~ p12(X2)
& r1(X0,X2) )
& ? [X3] : r1(X0,X3)
& ? [X4] : r1(X0,X4)
& ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
& ! [X7] :
( p12(X7)
| ~ r1(X0,X7) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f10,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) ) ),
inference(pure_predicate_removal,[],[f9]) ).
fof(f9,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f8]) ).
fof(f8,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] : ~ r1(X0,X4)
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p14(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f7]) ).
fof(f7,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] : ~ r1(X0,X3)
| ! [X4] :
( p15(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p14(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f6]) ).
fof(f6,plain,
? [X0] :
~ ( ! [X1] : ~ r1(X0,X1)
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] :
( p13(X3)
| ~ r1(X0,X3) )
| ! [X4] :
( p15(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p14(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(pure_predicate_removal,[],[f5]) ).
fof(f5,plain,
? [X0] :
~ ( ! [X1] :
( p11(X1)
| ~ r1(X0,X1) )
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] :
( p13(X3)
| ~ r1(X0,X3) )
| ! [X4] :
( p15(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p14(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(flattening,[],[f4]) ).
fof(f4,plain,
~ ~ ? [X0] :
~ ( ! [X1] :
( p11(X1)
| ~ r1(X0,X1) )
| ! [X2] :
( p12(X2)
| ~ r1(X0,X2) )
| ! [X3] :
( p13(X3)
| ~ r1(X0,X3) )
| ! [X4] :
( p15(X4)
| ~ r1(X0,X4) )
| ~ ! [X5] :
( p12(X5)
| ~ r1(X0,X5) )
| ~ ! [X6] :
( p14(X6)
| ~ r1(X0,X6) )
| ~ ! [X7] :
( p12(X7)
| ~ r1(X0,X7) )
| ~ ! [X8] :
( p16(X8)
| ~ r1(X0,X8) ) ),
inference(rectify,[],[f3]) ).
fof(f3,negated_conjecture,
~ ~ ? [X0] :
~ ( ! [X1] :
( p11(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p13(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p15(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p14(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
inference(negated_conjecture,[],[f2]) ).
fof(f2,conjecture,
~ ? [X0] :
~ ( ! [X1] :
( p11(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p13(X1)
| ~ r1(X0,X1) )
| ! [X1] :
( p15(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p14(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p12(X1)
| ~ r1(X0,X1) )
| ~ ! [X1] :
( p16(X1)
| ~ r1(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
fof(f28,plain,
p12(sK2),
inference(resolution,[],[f19,f23]) ).
fof(f23,plain,
r1(sK0,sK2),
inference(cnf_transformation,[],[f18]) ).
fof(f19,plain,
! [X6] :
( ~ r1(sK0,X6)
| p12(X6) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL664+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 13:44:16 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (29537)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (29542)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.14/0.38 % (29539)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.14/0.38 % (29538)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.14/0.38 % (29540)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.14/0.38 % (29543)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.14/0.38 % (29541)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.14/0.38 % (29544)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.14/0.38 Detected minimum model sizes of [1]
% 0.14/0.38 Detected minimum model sizes of [1]
% 0.14/0.38 Detected minimum model sizes of [1]
% 0.14/0.38 Detected maximum model sizes of [5]
% 0.14/0.38 Detected maximum model sizes of [5]
% 0.14/0.38 Detected maximum model sizes of [5]
% 0.14/0.38 Detected minimum model sizes of [1]
% 0.14/0.38 Detected maximum model sizes of [5]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 % (29543)Also succeeded, but the first one will report.
% 0.14/0.38 % (29542)First to succeed.
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 % (29540)Also succeeded, but the first one will report.
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 % (29538)Also succeeded, but the first one will report.
% 0.14/0.38 % (29541)Also succeeded, but the first one will report.
% 0.14/0.38 % (29539)Also succeeded, but the first one will report.
% 0.14/0.38 TRYING [4]
% 0.14/0.38 % (29544)Also succeeded, but the first one will report.
% 0.14/0.38 % (29542)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-29537"
% 0.14/0.38 % (29542)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (29542)------------------------------
% 0.14/0.38 % (29542)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.38 % (29542)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (29542)Memory used [KB]: 734
% 0.14/0.38 % (29542)Time elapsed: 0.004 s
% 0.14/0.38 % (29542)Instructions burned: 3 (million)
% 0.14/0.38 % (29537)Success in time 0.019 s
%------------------------------------------------------------------------------