TSTP Solution File: KRS088+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : KRS088+1 : TPTP v8.1.2. 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 : 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:17:49 EDT 2024
% Result : Unsatisfiable 0.56s 0.73s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 4 unt; 0 def)
% Number of atoms : 142 ( 6 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 173 ( 68 ~; 56 |; 37 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 86 ( 69 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f145,plain,
$false,
inference(resolution,[],[f144,f102]) ).
fof(f102,plain,
cUnsatisfiable(i2003_11_14_17_19_49673),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
cUnsatisfiable(i2003_11_14_17_19_49673),
file('/export/starexec/sandbox/tmp/tmp.dYVyF3HuUM/Vampire---4.8_23840',axiom_7) ).
fof(f144,plain,
! [X0] : ~ cUnsatisfiable(X0),
inference(duplicate_literal_removal,[],[f143]) ).
fof(f143,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f142,f121]) ).
fof(f121,plain,
! [X0] :
( ~ cp1(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ~ cp1(sK2(X0))
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f92,f118]) ).
fof(f118,plain,
! [X0] :
( rinvF(sK1(X0),X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f98,f90]) ).
fof(f90,plain,
! [X0] :
( rf(X0,sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp1(X1)
| ( ! [X3] :
( cp1(X3)
| ~ rf(sK0(X1),X3) )
& rinvF(X1,sK0(X1)) )
| ~ rf(X0,X1) ) )
& ( ( cp1(sK1(X0))
& ! [X5] :
( ( ~ cp1(sK2(X5))
& rf(X5,sK2(X5)) )
| ~ rinvF(sK1(X0),X5) )
& rf(X0,sK1(X0)) )
| ~ cUnsatisfiable(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f65,f68,f67,f66]) ).
fof(f66,plain,
! [X1] :
( ? [X2] :
( ! [X3] :
( cp1(X3)
| ~ rf(X2,X3) )
& rinvF(X1,X2) )
=> ( ! [X3] :
( cp1(X3)
| ~ rf(sK0(X1),X3) )
& rinvF(X1,sK0(X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f67,plain,
! [X0] :
( ? [X4] :
( cp1(X4)
& ! [X5] :
( ? [X6] :
( ~ cp1(X6)
& rf(X5,X6) )
| ~ rinvF(X4,X5) )
& rf(X0,X4) )
=> ( cp1(sK1(X0))
& ! [X5] :
( ? [X6] :
( ~ cp1(X6)
& rf(X5,X6) )
| ~ rinvF(sK1(X0),X5) )
& rf(X0,sK1(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f68,plain,
! [X5] :
( ? [X6] :
( ~ cp1(X6)
& rf(X5,X6) )
=> ( ~ cp1(sK2(X5))
& rf(X5,sK2(X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f65,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp1(X1)
| ? [X2] :
( ! [X3] :
( cp1(X3)
| ~ rf(X2,X3) )
& rinvF(X1,X2) )
| ~ rf(X0,X1) ) )
& ( ? [X4] :
( cp1(X4)
& ! [X5] :
( ? [X6] :
( ~ cp1(X6)
& rf(X5,X6) )
| ~ rinvF(X4,X5) )
& rf(X0,X4) )
| ~ cUnsatisfiable(X0) ) ),
inference(rectify,[],[f64]) ).
fof(f64,plain,
! [X0] :
( ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp1(X1)
| ? [X2] :
( ! [X3] :
( cp1(X3)
| ~ rf(X2,X3) )
& rinvF(X1,X2) )
| ~ rf(X0,X1) ) )
& ( ? [X1] :
( cp1(X1)
& ! [X2] :
( ? [X3] :
( ~ cp1(X3)
& rf(X2,X3) )
| ~ rinvF(X1,X2) )
& rf(X0,X1) )
| ~ cUnsatisfiable(X0) ) ),
inference(nnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ? [X1] :
( cp1(X1)
& ! [X2] :
( ? [X3] :
( ~ cp1(X3)
& rf(X2,X3) )
| ~ rinvF(X1,X2) )
& rf(X0,X1) ) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0] :
( cUnsatisfiable(X0)
<=> ? [X1] :
( cp1(X1)
& ! [X2] :
( rinvF(X1,X2)
=> ? [X3] :
( ~ cp1(X3)
& rf(X2,X3) ) )
& rf(X0,X1) ) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X3] :
( cUnsatisfiable(X3)
<=> ? [X4] :
( cp1(X4)
& ! [X5] :
( rinvF(X4,X5)
=> ? [X6] :
( ~ cp1(X6)
& rf(X5,X6) ) )
& rf(X3,X4) ) ),
file('/export/starexec/sandbox/tmp/tmp.dYVyF3HuUM/Vampire---4.8_23840',axiom_2) ).
fof(f98,plain,
! [X0,X1] :
( ~ rf(X1,X0)
| rinvF(X0,X1) ),
inference(cnf_transformation,[],[f70]) ).
fof(f70,plain,
! [X0,X1] :
( ( rinvF(X0,X1)
| ~ rf(X1,X0) )
& ( rf(X1,X0)
| ~ rinvF(X0,X1) ) ),
inference(nnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( rinvF(X0,X1)
<=> rf(X1,X0) ),
inference(rectify,[],[f19]) ).
fof(f19,axiom,
! [X3,X4] :
( rinvF(X3,X4)
<=> rf(X4,X3) ),
file('/export/starexec/sandbox/tmp/tmp.dYVyF3HuUM/Vampire---4.8_23840',axiom_4) ).
fof(f92,plain,
! [X0,X5] :
( ~ rinvF(sK1(X0),X5)
| ~ cp1(sK2(X5))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f142,plain,
! [X0] :
( cp1(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0)
| cp1(sK2(X0)) ),
inference(resolution,[],[f138,f128]) ).
fof(f128,plain,
! [X0,X1] :
( ~ rf(X0,X1)
| ~ cUnsatisfiable(X0)
| cp1(X1) ),
inference(duplicate_literal_removal,[],[f127]) ).
fof(f127,plain,
! [X0,X1] :
( cp1(X1)
| ~ cUnsatisfiable(X0)
| ~ rf(X0,X1)
| ~ cUnsatisfiable(X0) ),
inference(superposition,[],[f93,f122]) ).
fof(f122,plain,
! [X0,X1] :
( sK1(X1) = X0
| ~ rf(X1,X0)
| ~ cUnsatisfiable(X1) ),
inference(resolution,[],[f96,f90]) ).
fof(f96,plain,
! [X2,X0,X1] :
( ~ rf(X0,X2)
| X1 = X2
| ~ rf(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(flattening,[],[f59]) ).
fof(f59,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( rf(X0,X2)
& rf(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f18]) ).
fof(f18,axiom,
! [X3,X4,X5] :
( ( rf(X3,X5)
& rf(X3,X4) )
=> X4 = X5 ),
file('/export/starexec/sandbox/tmp/tmp.dYVyF3HuUM/Vampire---4.8_23840',axiom_3) ).
fof(f93,plain,
! [X0] :
( cp1(sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f69]) ).
fof(f138,plain,
! [X0] :
( rf(X0,sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(duplicate_literal_removal,[],[f135]) ).
fof(f135,plain,
! [X0] :
( rf(X0,sK2(X0))
| ~ cUnsatisfiable(X0)
| ~ cUnsatisfiable(X0) ),
inference(resolution,[],[f91,f118]) ).
fof(f91,plain,
! [X0,X5] :
( ~ rinvF(sK1(X0),X5)
| rf(X5,sK2(X5))
| ~ cUnsatisfiable(X0) ),
inference(cnf_transformation,[],[f69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS088+1 : TPTP v8.1.2. Released v3.1.0.
% 0.12/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.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 19:53:52 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_UNS_RFO_SEQ problem
% 0.14/0.35 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/tmp/tmp.dYVyF3HuUM/Vampire---4.8_23840
% 0.56/0.72 % (23954)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 Vampire---4 for (2996ds/83Mi)
% 0.56/0.72 % (23954)Refutation not found, incomplete strategy% (23954)------------------------------
% 0.56/0.72 % (23954)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.72 % (23954)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.72
% 0.56/0.72 % (23954)Memory used [KB]: 948
% 0.56/0.72 % (23954)Time elapsed: 0.001 s
% 0.56/0.72 % (23954)Instructions burned: 2 (million)
% 0.56/0.72 % (23954)------------------------------
% 0.56/0.72 % (23954)------------------------------
% 0.56/0.72 % (23948)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 Vampire---4 for (2996ds/34Mi)
% 0.56/0.72 % (23951)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.56/0.72 % (23952)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 Vampire---4 for (2996ds/34Mi)
% 0.56/0.72 % (23953)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.56/0.72 % (23950)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.56/0.72 % (23949)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 Vampire---4 for (2996ds/51Mi)
% 0.56/0.72 % (23948)Refutation not found, incomplete strategy% (23948)------------------------------
% 0.56/0.72 % (23948)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.72 % (23948)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.72
% 0.56/0.72 % (23948)Memory used [KB]: 948
% 0.56/0.72 % (23948)Time elapsed: 0.002 s
% 0.56/0.72 % (23948)Instructions burned: 2 (million)
% 0.56/0.72 % (23951)Refutation not found, incomplete strategy% (23951)------------------------------
% 0.56/0.72 % (23951)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.72 % (23950)Refutation not found, incomplete strategy% (23950)------------------------------
% 0.56/0.72 % (23950)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.72 % (23950)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.72
% 0.56/0.72 % (23950)Memory used [KB]: 947
% 0.56/0.72 % (23950)Time elapsed: 0.002 s
% 0.56/0.72 % (23950)Instructions burned: 2 (million)
% 0.56/0.72 % (23951)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.72
% 0.56/0.72 % (23951)Memory used [KB]: 947
% 0.56/0.72 % (23951)Time elapsed: 0.002 s
% 0.56/0.72 % (23953)Refutation not found, incomplete strategy% (23953)------------------------------
% 0.56/0.72 % (23953)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.72 % (23951)Instructions burned: 2 (million)
% 0.56/0.72 % (23953)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.72
% 0.56/0.72 % (23953)Memory used [KB]: 947
% 0.56/0.72 % (23953)Time elapsed: 0.002 s
% 0.56/0.72 % (23948)------------------------------
% 0.56/0.72 % (23948)------------------------------
% 0.56/0.72 % (23953)Instructions burned: 2 (million)
% 0.56/0.72 % (23950)------------------------------
% 0.56/0.72 % (23950)------------------------------
% 0.56/0.72 % (23951)------------------------------
% 0.56/0.72 % (23951)------------------------------
% 0.56/0.72 % (23953)------------------------------
% 0.56/0.72 % (23953)------------------------------
% 0.56/0.73 % (23952)Refutation not found, incomplete strategy% (23952)------------------------------
% 0.56/0.73 % (23952)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (23952)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (23952)Memory used [KB]: 1027
% 0.56/0.73 % (23952)Time elapsed: 0.003 s
% 0.56/0.73 % (23952)Instructions burned: 3 (million)
% 0.56/0.73 % (23952)------------------------------
% 0.56/0.73 % (23952)------------------------------
% 0.56/0.73 % (23955)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.56/0.73 % (23955)Refutation not found, incomplete strategy% (23955)------------------------------
% 0.56/0.73 % (23955)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (23955)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (23955)Memory used [KB]: 947
% 0.56/0.73 % (23955)Time elapsed: 0.001 s
% 0.56/0.73 % (23955)Instructions burned: 2 (million)
% 0.56/0.73 % (23955)------------------------------
% 0.56/0.73 % (23955)------------------------------
% 0.56/0.73 % (23949)First to succeed.
% 0.56/0.73 % (23949)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23947"
% 0.56/0.73 % (23949)Refutation found. Thanks to Tanya!
% 0.56/0.73 % SZS status Unsatisfiable for Vampire---4
% 0.56/0.73 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.73 % (23949)------------------------------
% 0.56/0.73 % (23949)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (23949)Termination reason: Refutation
% 0.56/0.73
% 0.56/0.73 % (23949)Memory used [KB]: 1057
% 0.56/0.73 % (23949)Time elapsed: 0.005 s
% 0.56/0.73 % (23949)Instructions burned: 4 (million)
% 0.56/0.73 % (23947)Success in time 0.372 s
% 0.56/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------