TSTP Solution File: KRS127+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : KRS127+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n024.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 : Mon May 20 23:20:11 EDT 2024
% Result : Unsatisfiable 0.75s 0.91s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of formulae : 49 ( 4 unt; 0 def)
% Number of atoms : 203 ( 17 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 240 ( 86 ~; 76 |; 60 &)
% ( 9 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-1 aty)
% Number of variables : 118 ( 84 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f136,plain,
$false,
inference(resolution,[],[f135,f99]) ).
fof(f99,plain,
cUnsatisfiable(i2003_11_14_17_22_27794),
inference(cnf_transformation,[],[f19]) ).
fof(f19,axiom,
cUnsatisfiable(i2003_11_14_17_22_27794),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f135,plain,
! [X0] : ~ cUnsatisfiable(X0),
inference(duplicate_literal_removal,[],[f134]) ).
fof(f134,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f133,f118]) ).
fof(f118,plain,
! [X0] :
( ~ cd(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f117,f113]) ).
fof(f113,plain,
! [X0] :
( cdxcomp(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f87,f94]) ).
fof(f94,plain,
! [X0] :
( ~ cc(X0)
| cdxcomp(X0) ),
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
! [X0] :
( cdxcomp(X0)
| ~ cc(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0] :
( cc(X0)
=> cdxcomp(X0) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X3] :
( cc(X3)
=> cdxcomp(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f87,plain,
! [X0] :
( cc(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ( sK0(X0) != sK1(X0)
& rr(X0,sK1(X0))
& rr(X0,sK0(X0)) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ! [X4] :
( ~ cc(X4)
| ~ rr(X0,X4) ) )
& ( ( ! [X5,X6] :
( X5 = X6
| ~ rr(X0,X6)
| ~ rr(X0,X5) )
& cd(sK2(X0))
& rr(X0,sK2(X0))
& cc(sK3(X0))
& rr(X0,sK3(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f57,f60,f59,f58]) ).
fof(f58,plain,
! [X0] :
( ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
=> ( sK0(X0) != sK1(X0)
& rr(X0,sK1(X0))
& rr(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
! [X0] :
( ? [X7] :
( cd(X7)
& rr(X0,X7) )
=> ( cd(sK2(X0))
& rr(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f60,plain,
! [X0] :
( ? [X8] :
( cc(X8)
& rr(X0,X8) )
=> ( cc(sK3(X0))
& rr(X0,sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f57,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ! [X4] :
( ~ cc(X4)
| ~ rr(X0,X4) ) )
& ( ( ! [X5,X6] :
( X5 = X6
| ~ rr(X0,X6)
| ~ rr(X0,X5) )
& ? [X7] :
( cd(X7)
& rr(X0,X7) )
& ? [X8] :
( cc(X8)
& rr(X0,X8) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f56]) ).
fof(f56,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ! [X4] :
( ~ cc(X4)
| ~ rr(X0,X4) ) )
& ( ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(flattening,[],[f55]) ).
fof(f55,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ? [X1,X2] :
( X1 != X2
& rr(X0,X2)
& rr(X0,X1) )
| ! [X3] :
( ~ cd(X3)
| ~ rr(X0,X3) )
| ! [X4] :
( ~ cc(X4)
| ~ rr(X0,X4) ) )
& ( ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) ) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( X1 = X2
| ~ rr(X0,X2)
| ~ rr(X0,X1) )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ( ! [X1,X2] :
( ( rr(X0,X2)
& rr(X0,X1) )
=> X1 = X2 )
& ? [X3] :
( cd(X3)
& rr(X0,X3) )
& ? [X4] :
( cc(X4)
& rr(X0,X4) ) ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ( ! [X5,X6] :
( ( rr(X3,X6)
& rr(X3,X5) )
=> X5 = X6 )
& ? [X4] :
( cd(X4)
& rr(X3,X4) )
& ? [X4] :
( cc(X4)
& rr(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f117,plain,
! [X0] :
( ~ cdxcomp(X0)
| ~ cd(X0) ),
inference(resolution,[],[f97,f95]) ).
fof(f95,plain,
! [X2,X0] :
( ~ ra_Px1(X0,X2)
| ~ cd(X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0] :
( ( cd(X0)
| ra_Px1(X0,sK4(X0)) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cd(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f63,f64]) ).
fof(f64,plain,
! [X0] :
( ? [X1] : ra_Px1(X0,X1)
=> ra_Px1(X0,sK4(X0)) ),
introduced(choice_axiom,[]) ).
fof(f63,plain,
! [X0] :
( ( cd(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X2] : ~ ra_Px1(X0,X2)
| ~ cd(X0) ) ),
inference(rectify,[],[f62]) ).
fof(f62,plain,
! [X0] :
( ( cd(X0)
| ? [X1] : ra_Px1(X0,X1) )
& ( ! [X1] : ~ ra_Px1(X0,X1)
| ~ cd(X0) ) ),
inference(nnf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0] :
( cd(X0)
<=> ! [X1] : ~ ra_Px1(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0] :
( cd(X0)
<=> ~ ? [X1] : ra_Px1(X0,X1) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X3] :
( cd(X3)
<=> ~ ? [X4] : ra_Px1(X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f97,plain,
! [X0] :
( ra_Px1(X0,sK5(X0))
| ~ cdxcomp(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
! [X0] :
( ( cdxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ra_Px1(X0,sK5(X0))
| ~ cdxcomp(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f67,f68]) ).
fof(f68,plain,
! [X0] :
( ? [X2] : ra_Px1(X0,X2)
=> ra_Px1(X0,sK5(X0)) ),
introduced(choice_axiom,[]) ).
fof(f67,plain,
! [X0] :
( ( cdxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X2] : ra_Px1(X0,X2)
| ~ cdxcomp(X0) ) ),
inference(rectify,[],[f66]) ).
fof(f66,plain,
! [X0] :
( ( cdxcomp(X0)
| ! [X1] : ~ ra_Px1(X0,X1) )
& ( ? [X1] : ra_Px1(X0,X1)
| ~ cdxcomp(X0) ) ),
inference(nnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0] :
( cdxcomp(X0)
<=> ? [X1] : ra_Px1(X0,X1) ),
inference(rectify,[],[f18]) ).
fof(f18,axiom,
! [X3] :
( cdxcomp(X3)
<=> ? [X5] : ra_Px1(X3,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f133,plain,
! [X0] :
( cd(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f130]) ).
fof(f130,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cd(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f127,f86]) ).
fof(f86,plain,
! [X0] :
( rr(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f127,plain,
! [X0,X1] :
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| cd(X1) ),
inference(duplicate_literal_removal,[],[f126]) ).
fof(f126,plain,
! [X0,X1] :
( cd(X1)
| ~ cUnsatisfiable(X0)
| ~ rr(X0,X1)
| ~ cUnsatisfiable(X0) ),
inference(superposition,[],[f89,f122]) ).
fof(f122,plain,
! [X0,X1] :
( sK2(X1) = X0
| ~ rr(X1,X0)
| ~ cUnsatisfiable(X1) ),
inference(duplicate_literal_removal,[],[f121]) ).
fof(f121,plain,
! [X0,X1] :
( sK2(X1) = X0
| ~ rr(X1,X0)
| ~ cUnsatisfiable(X1)
| ~ cUnsatisfiable(X1) ),
inference(resolution,[],[f90,f88]) ).
fof(f88,plain,
! [X0] :
( rr(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f90,plain,
! [X0,X6,X5] :
( ~ rr(X0,X6)
| X5 = X6
| ~ rr(X0,X5)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f89,plain,
! [X0] :
( cd(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f61]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS127+1 : TPTP v8.2.0. Released v3.1.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 22:06:37 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.36 This is a FOF_UNS_RFO_SEQ problem
% 0.13/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.71/0.90 % (14125)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2994ds/34Mi)
% 0.71/0.90 % (14121)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2994ds/34Mi)
% 0.71/0.90 % (14124)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.71/0.90 % (14126)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.71/0.90 % (14123)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.71/0.90 % (14122)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2994ds/51Mi)
% 0.71/0.90 % (14128)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2994ds/56Mi)
% 0.71/0.90 % (14121)Refutation not found, incomplete strategy% (14121)------------------------------
% 0.71/0.90 % (14121)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.90 % (14124)Refutation not found, incomplete strategy% (14124)------------------------------
% 0.71/0.90 % (14124)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.90 % (14123)Refutation not found, incomplete strategy% (14123)------------------------------
% 0.71/0.90 % (14123)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.90 % (14126)Refutation not found, incomplete strategy% (14126)------------------------------
% 0.71/0.90 % (14126)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.90 % (14126)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.90 % (14124)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.90
% 0.71/0.90
% 0.71/0.90 % (14126)Memory used [KB]: 945
% 0.71/0.90 % (14124)Memory used [KB]: 945
% 0.71/0.90 % (14123)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.90 % (14126)Time elapsed: 0.003 s
% 0.71/0.90
% 0.71/0.90 % (14124)Time elapsed: 0.003 s
% 0.71/0.90 % (14123)Memory used [KB]: 945
% 0.71/0.90 % (14126)Instructions burned: 2 (million)
% 0.71/0.90 % (14124)Instructions burned: 2 (million)
% 0.71/0.90 % (14123)Time elapsed: 0.003 s
% 0.71/0.90 % (14123)Instructions burned: 2 (million)
% 0.71/0.90 % (14121)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.90 % (14128)Refutation not found, incomplete strategy% (14128)------------------------------
% 0.71/0.90 % (14128)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.90 % (14128)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.90
% 0.71/0.90 % (14128)Memory used [KB]: 945
% 0.71/0.90 % (14128)Time elapsed: 0.002 s
% 0.71/0.90 % (14128)Instructions burned: 2 (million)
% 0.71/0.90
% 0.71/0.90 % (14121)Memory used [KB]: 945
% 0.71/0.90 % (14121)Time elapsed: 0.002 s
% 0.71/0.90 % (14121)Instructions burned: 2 (million)
% 0.71/0.90 % (14128)------------------------------
% 0.71/0.90 % (14128)------------------------------
% 0.71/0.90 % (14124)------------------------------
% 0.71/0.90 % (14124)------------------------------
% 0.71/0.90 % (14123)------------------------------
% 0.71/0.90 % (14123)------------------------------
% 0.71/0.90 % (14126)------------------------------
% 0.71/0.90 % (14126)------------------------------
% 0.71/0.90 % (14121)------------------------------
% 0.71/0.90 % (14121)------------------------------
% 0.71/0.90 % (14125)Refutation not found, incomplete strategy% (14125)------------------------------
% 0.71/0.90 % (14125)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.90 % (14125)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.90
% 0.71/0.90 % (14125)Memory used [KB]: 1026
% 0.71/0.90 % (14125)Time elapsed: 0.003 s
% 0.71/0.90 % (14125)Instructions burned: 3 (million)
% 0.71/0.90 % (14125)------------------------------
% 0.71/0.90 % (14125)------------------------------
% 0.71/0.90 % (14122)First to succeed.
% 0.71/0.91 % (14127)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2994ds/83Mi)
% 0.71/0.91 % (14122)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-14120"
% 0.71/0.91 % (14127)Refutation not found, incomplete strategy% (14127)------------------------------
% 0.71/0.91 % (14127)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.75/0.91 % (14127)Termination reason: Refutation not found, incomplete strategy
% 0.75/0.91
% 0.75/0.91 % (14127)Memory used [KB]: 945
% 0.75/0.91 % (14127)Time elapsed: 0.003 s
% 0.75/0.91 % (14127)Instructions burned: 2 (million)
% 0.75/0.91 % (14127)------------------------------
% 0.75/0.91 % (14127)------------------------------
% 0.75/0.91 % (14122)Refutation found. Thanks to Tanya!
% 0.75/0.91 % SZS status Unsatisfiable for theBenchmark
% 0.75/0.91 % SZS output start Proof for theBenchmark
% See solution above
% 0.75/0.91 % (14122)------------------------------
% 0.75/0.91 % (14122)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.75/0.91 % (14122)Termination reason: Refutation
% 0.75/0.91
% 0.75/0.91 % (14122)Memory used [KB]: 1055
% 0.75/0.91 % (14122)Time elapsed: 0.004 s
% 0.75/0.91 % (14122)Instructions burned: 5 (million)
% 0.75/0.91 % (14120)Success in time 0.544 s
% 0.75/0.91 % Vampire---4.8 exiting
%------------------------------------------------------------------------------