TSTP Solution File: KRS096+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : KRS096+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 : n014.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:04 EDT 2024
% Result : Unsatisfiable 0.48s 0.64s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 4 unt; 0 def)
% Number of atoms : 157 ( 17 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 194 ( 69 ~; 60 |; 54 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 83 ( 59 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f101,plain,
$false,
inference(resolution,[],[f100,f70]) ).
fof(f70,plain,
cUnsatisfiable(i2003_11_14_17_20_18265),
inference(cnf_transformation,[],[f14]) ).
fof(f14,axiom,
cUnsatisfiable(i2003_11_14_17_20_18265),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).
fof(f100,plain,
! [X0] : ~ cUnsatisfiable(X0),
inference(duplicate_literal_removal,[],[f99]) ).
fof(f99,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f98,f62]) ).
fof(f62,plain,
! [X0] :
( cc(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,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])],[f43,f46,f45,f44]) ).
fof(f44,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(f45,plain,
! [X0] :
( ? [X7] :
( cd(X7)
& rr(X0,X7) )
=> ( cd(sK2(X0))
& rr(X0,sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f46,plain,
! [X0] :
( ? [X8] :
( cc(X8)
& rr(X0,X8) )
=> ( cc(sK3(X0))
& rr(X0,sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f43,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,[],[f42]) ).
fof(f42,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,[],[f41]) ).
fof(f41,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,[],[f38]) ).
fof(f38,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,[],[f37]) ).
fof(f37,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,[],[f17]) ).
fof(f17,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,[],[f12]) ).
fof(f12,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(f98,plain,
! [X0] :
( ~ cc(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f97,f69]) ).
fof(f69,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
! [X0] :
( ~ cd(X0)
| ~ cc(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0] :
( cc(X0)
=> ~ cd(X0) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X3] :
( cc(X3)
=> ~ cd(X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f97,plain,
! [X0] :
( cd(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f94]) ).
fof(f94,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cd(sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f90,f61]) ).
fof(f61,plain,
! [X0] :
( rr(X0,sK3(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f90,plain,
! [X0,X1] :
( ~ rr(X0,X1)
| ~ cUnsatisfiable(X0)
| cd(X1) ),
inference(duplicate_literal_removal,[],[f89]) ).
fof(f89,plain,
! [X0,X1] :
( cd(X1)
| ~ cUnsatisfiable(X0)
| ~ rr(X0,X1)
| ~ cUnsatisfiable(X0) ),
inference(superposition,[],[f64,f84]) ).
fof(f84,plain,
! [X0,X1] :
( sK2(X1) = X0
| ~ rr(X1,X0)
| ~ cUnsatisfiable(X1) ),
inference(duplicate_literal_removal,[],[f83]) ).
fof(f83,plain,
! [X0,X1] :
( sK2(X1) = X0
| ~ rr(X1,X0)
| ~ cUnsatisfiable(X1)
| ~ cUnsatisfiable(X1) ),
inference(resolution,[],[f65,f63]) ).
fof(f63,plain,
! [X0] :
( rr(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f65,plain,
! [X0,X6,X5] :
( ~ rr(X0,X6)
| X5 = X6
| ~ rr(X0,X5)
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f47]) ).
fof(f64,plain,
! [X0] :
( cd(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : KRS096+1 : TPTP v8.2.0. Released v3.1.0.
% 0.10/0.11 % 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.10/0.32 % Computer : n014.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Sat May 18 22:23:23 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.10/0.32 This is a FOF_UNS_RFO_SEQ problem
% 0.10/0.32 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.48/0.64 % (28624)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.48/0.64 % (28624)Refutation not found, incomplete strategy% (28624)------------------------------
% 0.48/0.64 % (28624)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.64 % (28624)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.64
% 0.48/0.64 % (28624)Memory used [KB]: 944
% 0.48/0.64 % (28624)Time elapsed: 0.001 s
% 0.48/0.64 % (28624)Instructions burned: 2 (million)
% 0.48/0.64 % (28624)------------------------------
% 0.48/0.64 % (28624)------------------------------
% 0.48/0.64 % (28626)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 (2996ds/56Mi)
% 0.48/0.64 % (28626)Refutation not found, incomplete strategy% (28626)------------------------------
% 0.48/0.64 % (28626)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.64 % (28626)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.64
% 0.48/0.64 % (28626)Memory used [KB]: 944
% 0.48/0.64 % (28626)Time elapsed: 0.002 s
% 0.48/0.64 % (28626)Instructions burned: 2 (million)
% 0.48/0.64 % (28619)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 (2996ds/34Mi)
% 0.48/0.64 % (28620)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 (2996ds/51Mi)
% 0.48/0.64 % (28626)------------------------------
% 0.48/0.64 % (28626)------------------------------
% 0.48/0.64 % (28619)Refutation not found, incomplete strategy% (28619)------------------------------
% 0.48/0.64 % (28619)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.64 % (28619)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.64
% 0.48/0.64 % (28619)Memory used [KB]: 945
% 0.48/0.64 % (28619)Time elapsed: 0.002 s
% 0.48/0.64 % (28619)Instructions burned: 2 (million)
% 0.48/0.64 % (28619)------------------------------
% 0.48/0.64 % (28619)------------------------------
% 0.48/0.64 % (28623)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 (2996ds/34Mi)
% 0.48/0.64 % (28625)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 (2996ds/83Mi)
% 0.48/0.64 % (28620)First to succeed.
% 0.48/0.64 % (28623)Refutation not found, incomplete strategy% (28623)------------------------------
% 0.48/0.64 % (28623)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.64 % (28623)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.64
% 0.48/0.64 % (28623)Memory used [KB]: 957
% 0.48/0.64 % (28623)Time elapsed: 0.001 s
% 0.48/0.64 % (28623)Instructions burned: 2 (million)
% 0.48/0.64 % (28623)------------------------------
% 0.48/0.64 % (28623)------------------------------
% 0.48/0.64 % (28625)Refutation not found, incomplete strategy% (28625)------------------------------
% 0.48/0.64 % (28625)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.64 % (28625)Termination reason: Refutation not found, incomplete strategy
% 0.48/0.64
% 0.48/0.64 % (28625)Memory used [KB]: 945
% 0.48/0.64 % (28625)Time elapsed: 0.002 s
% 0.48/0.64 % (28625)Instructions burned: 2 (million)
% 0.48/0.64 % (28627)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.48/0.64 % (28625)------------------------------
% 0.48/0.64 % (28625)------------------------------
% 0.48/0.64 % (28620)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28618"
% 0.48/0.64 % (28628)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2996ds/50Mi)
% 0.48/0.64 % (28620)Refutation found. Thanks to Tanya!
% 0.48/0.64 % SZS status Unsatisfiable for theBenchmark
% 0.48/0.64 % SZS output start Proof for theBenchmark
% See solution above
% 0.48/0.65 % (28620)------------------------------
% 0.48/0.65 % (28620)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.48/0.65 % (28620)Termination reason: Refutation
% 0.48/0.65
% 0.48/0.65 % (28620)Memory used [KB]: 986
% 0.48/0.65 % (28620)Time elapsed: 0.004 s
% 0.48/0.65 % (28620)Instructions burned: 4 (million)
% 0.48/0.65 % (28618)Success in time 0.315 s
% 0.48/0.65 % Vampire---4.8 exiting
%------------------------------------------------------------------------------