TSTP Solution File: SET792+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET792+4 : TPTP v8.2.0. Released v3.2.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 : n029.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 : Tue May 21 03:13:19 EDT 2024
% Result : Theorem 0.53s 0.70s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 6 unt; 0 def)
% Number of atoms : 221 ( 17 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 265 ( 90 ~; 82 |; 58 &)
% ( 6 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 132 ( 120 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f60,plain,
$false,
inference(subsumption_resolution,[],[f59,f33]) ).
fof(f33,plain,
~ min(sK2,sK0,sK1),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
( ~ min(sK2,sK0,sK1)
& least(sK2,sK0,sK1)
& order(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f21,f27]) ).
fof(f27,plain,
( ? [X0,X1,X2] :
( ~ min(X2,X0,X1)
& least(X2,X0,X1)
& order(X0,X1) )
=> ( ~ min(sK2,sK0,sK1)
& least(sK2,sK0,sK1)
& order(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1,X2] :
( ~ min(X2,X0,X1)
& least(X2,X0,X1)
& order(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ~ min(X2,X0,X1)
& least(X2,X0,X1)
& order(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
~ ! [X0,X1,X2] :
( ( least(X2,X0,X1)
& order(X0,X1) )
=> min(X2,X0,X1) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X5] :
( ( least(X5,X0,X1)
& order(X0,X1) )
=> min(X5,X0,X1) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X1,X5] :
( ( least(X5,X0,X1)
& order(X0,X1) )
=> min(X5,X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thIV4) ).
fof(f59,plain,
min(sK2,sK0,sK1),
inference(subsumption_resolution,[],[f58,f31]) ).
fof(f31,plain,
order(sK0,sK1),
inference(cnf_transformation,[],[f28]) ).
fof(f58,plain,
( ~ order(sK0,sK1)
| min(sK2,sK0,sK1) ),
inference(subsumption_resolution,[],[f57,f42]) ).
fof(f42,plain,
member(sK2,sK1),
inference(resolution,[],[f32,f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ least(X2,X0,X1)
| member(X2,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) )
& member(X2,X1) )
| ~ least(X2,X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2] :
( least(X2,X0,X1)
=> ( ! [X3] :
( member(X3,X1)
=> apply(X0,X2,X3) )
& member(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( least(X2,X0,X1)
<=> ( ! [X3] :
( member(X3,X1)
=> apply(X0,X2,X3) )
& member(X2,X1) ) ),
inference(rectify,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X5] :
( least(X5,X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X5,X2) )
& member(X5,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',least) ).
fof(f32,plain,
least(sK2,sK0,sK1),
inference(cnf_transformation,[],[f28]) ).
fof(f57,plain,
( ~ member(sK2,sK1)
| ~ order(sK0,sK1)
| min(sK2,sK0,sK1) ),
inference(duplicate_literal_removal,[],[f56]) ).
fof(f56,plain,
( ~ member(sK2,sK1)
| ~ order(sK0,sK1)
| min(sK2,sK0,sK1)
| ~ member(sK2,sK1) ),
inference(resolution,[],[f55,f39]) ).
fof(f39,plain,
! [X2,X0,X1] :
( member(sK3(X0,X1,X2),X1)
| min(X2,X0,X1)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0,X1,X2] :
( min(X2,X0,X1)
| ( sK3(X0,X1,X2) != X2
& apply(X0,sK3(X0,X1,X2),X2)
& member(sK3(X0,X1,X2),X1) )
| ~ member(X2,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f26,f29]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ? [X3] :
( X2 != X3
& apply(X0,X3,X2)
& member(X3,X1) )
=> ( sK3(X0,X1,X2) != X2
& apply(X0,sK3(X0,X1,X2),X2)
& member(sK3(X0,X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f26,plain,
! [X0,X1,X2] :
( min(X2,X0,X1)
| ? [X3] :
( X2 != X3
& apply(X0,X3,X2)
& member(X3,X1) )
| ~ member(X2,X1) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( min(X2,X0,X1)
| ? [X3] :
( X2 != X3
& apply(X0,X3,X2)
& member(X3,X1) )
| ~ member(X2,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( apply(X0,X3,X2)
& member(X3,X1) )
=> X2 = X3 )
& member(X2,X1) )
=> min(X2,X0,X1) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( min(X2,X0,X1)
<=> ( ! [X3] :
( ( apply(X0,X3,X2)
& member(X3,X1) )
=> X2 = X3 )
& member(X2,X1) ) ),
inference(rectify,[],[f8]) ).
fof(f8,axiom,
! [X0,X1,X5] :
( min(X5,X0,X1)
<=> ( ! [X2] :
( ( apply(X0,X2,X5)
& member(X2,X1) )
=> X2 = X5 )
& member(X5,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',min) ).
fof(f55,plain,
! [X0] :
( ~ member(sK3(sK0,sK1,sK2),X0)
| ~ member(sK2,X0)
| ~ order(sK0,X0) ),
inference(subsumption_resolution,[],[f54,f42]) ).
fof(f54,plain,
! [X0] :
( ~ member(sK2,X0)
| ~ member(sK3(sK0,sK1,sK2),X0)
| ~ order(sK0,X0)
| ~ member(sK2,sK1) ),
inference(subsumption_resolution,[],[f53,f33]) ).
fof(f53,plain,
! [X0] :
( ~ member(sK2,X0)
| ~ member(sK3(sK0,sK1,sK2),X0)
| ~ order(sK0,X0)
| min(sK2,sK0,sK1)
| ~ member(sK2,sK1) ),
inference(duplicate_literal_removal,[],[f52]) ).
fof(f52,plain,
! [X0] :
( ~ member(sK2,X0)
| ~ member(sK3(sK0,sK1,sK2),X0)
| ~ order(sK0,X0)
| min(sK2,sK0,sK1)
| ~ member(sK2,sK1)
| min(sK2,sK0,sK1)
| ~ member(sK2,sK1) ),
inference(resolution,[],[f51,f39]) ).
fof(f51,plain,
! [X0,X1] :
( ~ member(sK3(sK0,X0,sK2),sK1)
| ~ member(sK2,X1)
| ~ member(sK3(sK0,X0,sK2),X1)
| ~ order(sK0,X1)
| min(sK2,sK0,X0)
| ~ member(sK2,X0) ),
inference(subsumption_resolution,[],[f48,f41]) ).
fof(f41,plain,
! [X2,X0,X1] :
( sK3(X0,X1,X2) != X2
| min(X2,X0,X1)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f48,plain,
! [X0,X1] :
( sK2 = sK3(sK0,X0,sK2)
| ~ member(sK3(sK0,X0,sK2),sK1)
| ~ member(sK2,X1)
| ~ member(sK3(sK0,X0,sK2),X1)
| ~ order(sK0,X1)
| min(sK2,sK0,X0)
| ~ member(sK2,X0) ),
inference(resolution,[],[f44,f40]) ).
fof(f40,plain,
! [X2,X0,X1] :
( apply(X0,sK3(X0,X1,X2),X2)
| min(X2,X0,X1)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f44,plain,
! [X0,X1] :
( ~ apply(sK0,X0,sK2)
| sK2 = X0
| ~ member(X0,sK1)
| ~ member(sK2,X1)
| ~ member(X0,X1)
| ~ order(sK0,X1) ),
inference(resolution,[],[f43,f35]) ).
fof(f35,plain,
! [X0,X1,X6,X5] :
( ~ apply(X0,X6,X5)
| X5 = X6
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1)
| ~ order(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ( ! [X2,X3,X4] :
( apply(X0,X2,X4)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X2,X3)
| ~ member(X4,X1)
| ~ member(X3,X1)
| ~ member(X2,X1) )
& ! [X5,X6] :
( X5 = X6
| ~ apply(X0,X6,X5)
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) )
& ! [X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ( ! [X2,X3,X4] :
( apply(X0,X2,X4)
| ~ apply(X0,X3,X4)
| ~ apply(X0,X2,X3)
| ~ member(X4,X1)
| ~ member(X3,X1)
| ~ member(X2,X1) )
& ! [X5,X6] :
( X5 = X6
| ~ apply(X0,X6,X5)
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) )
& ! [X7] :
( apply(X0,X7,X7)
| ~ member(X7,X1) ) )
| ~ order(X0,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( order(X0,X1)
=> ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X5,X6] :
( ( member(X6,X1)
& member(X5,X1) )
=> ( ( apply(X0,X6,X5)
& apply(X0,X5,X6) )
=> X5 = X6 ) )
& ! [X7] :
( member(X7,X1)
=> apply(X0,X7,X7) ) ) ),
inference(unused_predicate_definition_removal,[],[f14]) ).
fof(f14,plain,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X5,X6] :
( ( member(X6,X1)
& member(X5,X1) )
=> ( ( apply(X0,X6,X5)
& apply(X0,X5,X6) )
=> X5 = X6 ) )
& ! [X7] :
( member(X7,X1)
=> apply(X0,X7,X7) ) ) ),
inference(rectify,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( order(X0,X1)
<=> ( ! [X2,X3,X4] :
( ( member(X4,X1)
& member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X4)
& apply(X0,X2,X3) )
=> apply(X0,X2,X4) ) )
& ! [X2,X3] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( ( apply(X0,X3,X2)
& apply(X0,X2,X3) )
=> X2 = X3 ) )
& ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).
fof(f43,plain,
! [X0] :
( apply(sK0,sK2,X0)
| ~ member(X0,sK1) ),
inference(resolution,[],[f32,f38]) ).
fof(f38,plain,
! [X2,X3,X0,X1] :
( ~ least(X2,X0,X1)
| ~ member(X3,X1)
| apply(X0,X2,X3) ),
inference(cnf_transformation,[],[f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET792+4 : TPTP v8.2.0. Released v3.2.0.
% 0.00/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.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 11:53:08 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/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.47/0.70 % (18600)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.47/0.70 % (18604)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.47/0.70 % (18602)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.47/0.70 % (18603)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.47/0.70 % (18605)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.47/0.70 % (18607)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.47/0.70 % (18606)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.47/0.70 % (18604)Refutation not found, incomplete strategy% (18604)------------------------------
% 0.47/0.70 % (18604)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.70 % (18604)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.70
% 0.47/0.70 % (18604)Memory used [KB]: 1043
% 0.47/0.70 % (18604)Time elapsed: 0.001 s
% 0.47/0.70 % (18604)Instructions burned: 3 (million)
% 0.47/0.70 % (18604)------------------------------
% 0.47/0.70 % (18604)------------------------------
% 0.47/0.70 % (18607)Refutation not found, incomplete strategy% (18607)------------------------------
% 0.47/0.70 % (18607)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.47/0.70 % (18607)Termination reason: Refutation not found, incomplete strategy
% 0.47/0.70
% 0.47/0.70 % (18607)Memory used [KB]: 1053
% 0.47/0.70 % (18607)Time elapsed: 0.003 s
% 0.47/0.70 % (18607)Instructions burned: 2 (million)
% 0.47/0.70 % (18605)First to succeed.
% 0.47/0.70 % (18603)Also succeeded, but the first one will report.
% 0.47/0.70 % (18600)Also succeeded, but the first one will report.
% 0.47/0.70 % (18607)------------------------------
% 0.47/0.70 % (18607)------------------------------
% 0.53/0.70 % (18602)Also succeeded, but the first one will report.
% 0.53/0.70 % (18606)Also succeeded, but the first one will report.
% 0.53/0.70 % (18601)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.53/0.70 % (18605)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18599"
% 0.53/0.70 % (18605)Refutation found. Thanks to Tanya!
% 0.53/0.70 % SZS status Theorem for theBenchmark
% 0.53/0.70 % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.70 % (18605)------------------------------
% 0.53/0.70 % (18605)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.70 % (18605)Termination reason: Refutation
% 0.53/0.70
% 0.53/0.70 % (18605)Memory used [KB]: 1065
% 0.53/0.70 % (18605)Time elapsed: 0.004 s
% 0.53/0.70 % (18605)Instructions burned: 5 (million)
% 0.53/0.70 % (18599)Success in time 0.374 s
% 0.53/0.70 % Vampire---4.8 exiting
%------------------------------------------------------------------------------