TSTP Solution File: SET810+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET810+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n016.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:23 EDT 2024
% Result : Theorem 0.60s 0.78s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 11 unt; 0 def)
% Number of atoms : 133 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 139 ( 42 ~; 33 |; 36 &)
% ( 15 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 86 ( 76 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f177,plain,
$false,
inference(subsumption_resolution,[],[f174,f107]) ).
fof(f107,plain,
apply(member_predicate,sK1,sK0),
inference(unit_resulting_resolution,[],[f43,f58]) ).
fof(f58,plain,
! [X0,X1] :
( apply(member_predicate,X0,X1)
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( apply(member_predicate,X0,X1)
<=> member(X0,X1) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X2,X4] :
( apply(member_predicate,X2,X4)
<=> member(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rel_member) ).
fof(f43,plain,
member(sK1,sK0),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
? [X0,X1] :
( member(X1,X0)
& member(X0,X1)
& member(X1,on)
& member(X0,on) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
? [X0,X1] :
( member(X1,X0)
& member(X0,X1)
& member(X1,on)
& member(X0,on) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,negated_conjecture,
~ ! [X0,X1] :
( ( member(X1,on)
& member(X0,on) )
=> ~ ( member(X1,X0)
& member(X0,X1) ) ),
inference(negated_conjecture,[],[f20]) ).
fof(f20,conjecture,
! [X0,X1] :
( ( member(X1,on)
& member(X0,on) )
=> ~ ( member(X1,X0)
& member(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thV3) ).
fof(f174,plain,
~ apply(member_predicate,sK1,sK0),
inference(unit_resulting_resolution,[],[f111,f43,f118,f101,f71]) ).
fof(f71,plain,
! [X0,X1,X6,X5] :
( ~ apply(X0,X6,X5)
| ~ member(X6,X1)
| ~ apply(X0,X5,X6)
| ~ member(X5,X1)
| ~ strict_order(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0,X1] :
( strict_order(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] :
( ~ apply(X0,X6,X5)
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) ) ) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
! [X0,X1] :
( strict_order(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] :
( ~ apply(X0,X6,X5)
| ~ apply(X0,X5,X6)
| ~ member(X6,X1)
| ~ member(X5,X1) ) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( strict_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) ) ) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X5,X3] :
( strict_order(X5,X3)
<=> ( ! [X2,X4,X7] :
( ( member(X7,X3)
& member(X4,X3)
& member(X2,X3) )
=> ( ( apply(X5,X4,X7)
& apply(X5,X2,X4) )
=> apply(X5,X2,X7) ) )
& ! [X2,X4] :
( ( member(X4,X3)
& member(X2,X3) )
=> ~ ( apply(X5,X4,X2)
& apply(X5,X2,X4) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',strict_order) ).
fof(f101,plain,
apply(member_predicate,sK0,sK1),
inference(unit_resulting_resolution,[],[f42,f58]) ).
fof(f42,plain,
member(sK0,sK1),
inference(cnf_transformation,[],[f30]) ).
fof(f118,plain,
member(sK0,sK0),
inference(unit_resulting_resolution,[],[f42,f105,f49]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset) ).
fof(f105,plain,
subset(sK1,sK0),
inference(unit_resulting_resolution,[],[f40,f43,f46]) ).
fof(f46,plain,
! [X0,X1] :
( ~ member(X0,on)
| subset(X1,X0)
| ~ member(X1,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0] :
( member(X0,on)
<=> ( ! [X1] :
( subset(X1,X0)
| ~ member(X1,X0) )
& strict_well_order(member_predicate,X0)
& set(X0) ) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0] :
( member(X0,on)
<=> ( ! [X1] :
( member(X1,X0)
=> subset(X1,X0) )
& strict_well_order(member_predicate,X0)
& set(X0) ) ),
inference(rectify,[],[f12]) ).
fof(f12,axiom,
! [X0] :
( member(X0,on)
<=> ( ! [X2] :
( member(X2,X0)
=> subset(X2,X0) )
& strict_well_order(member_predicate,X0)
& set(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ordinal_number) ).
fof(f40,plain,
member(sK0,on),
inference(cnf_transformation,[],[f30]) ).
fof(f111,plain,
strict_order(member_predicate,sK0),
inference(unit_resulting_resolution,[],[f84,f57]) ).
fof(f57,plain,
! [X0,X1] :
( strict_order(X0,X1)
| ~ strict_well_order(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1] :
( strict_well_order(X0,X1)
<=> ( ! [X2] :
( ? [X4] : least(X4,X0,X2)
| ! [X3] : ~ member(X3,X2)
| ~ subset(X2,X1) )
& strict_order(X0,X1) ) ),
inference(flattening,[],[f34]) ).
fof(f34,plain,
! [X0,X1] :
( strict_well_order(X0,X1)
<=> ( ! [X2] :
( ? [X4] : least(X4,X0,X2)
| ! [X3] : ~ member(X3,X2)
| ~ subset(X2,X1) )
& strict_order(X0,X1) ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( strict_well_order(X0,X1)
<=> ( ! [X2] :
( ( ? [X3] : member(X3,X2)
& subset(X2,X1) )
=> ? [X4] : least(X4,X0,X2) )
& strict_order(X0,X1) ) ),
inference(rectify,[],[f13]) ).
fof(f13,axiom,
! [X5,X3] :
( strict_well_order(X5,X3)
<=> ( ! [X0] :
( ( ? [X2] : member(X2,X0)
& subset(X0,X3) )
=> ? [X4] : least(X4,X5,X0) )
& strict_order(X5,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',strict_well_order) ).
fof(f84,plain,
strict_well_order(member_predicate,sK0),
inference(unit_resulting_resolution,[],[f40,f48]) ).
fof(f48,plain,
! [X0] :
( strict_well_order(member_predicate,X0)
| ~ member(X0,on) ),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET810+4 : TPTP v8.2.0. Released v3.2.0.
% 0.05/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon May 20 11:58:53 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.32 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.77 % (31231)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.77 % (31232)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 (2995ds/34Mi)
% 0.60/0.77 % (31229)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 (2995ds/51Mi)
% 0.60/0.77 % (31228)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 (2995ds/34Mi)
% 0.60/0.77 % (31230)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.77 % (31233)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.77 % (31234)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 (2995ds/83Mi)
% 0.60/0.77 % (31235)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 (2995ds/56Mi)
% 0.60/0.78 % (31231)Refutation not found, incomplete strategy% (31231)------------------------------
% 0.60/0.78 % (31231)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (31235)Refutation not found, incomplete strategy% (31235)------------------------------
% 0.60/0.78 % (31235)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (31235)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (31235)Memory used [KB]: 1054
% 0.60/0.78 % (31235)Time elapsed: 0.002 s
% 0.60/0.78 % (31235)Instructions burned: 2 (million)
% 0.60/0.78 % (31231)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78 % (31228)Refutation not found, incomplete strategy% (31228)------------------------------
% 0.60/0.78 % (31228)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (31228)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (31228)Memory used [KB]: 1005
% 0.60/0.78 % (31228)Time elapsed: 0.003 s
% 0.60/0.78 % (31228)Instructions burned: 2 (million)
% 0.60/0.78
% 0.60/0.78 % (31231)Memory used [KB]: 1055
% 0.60/0.78 % (31231)Time elapsed: 0.003 s
% 0.60/0.78 % (31231)Instructions burned: 2 (million)
% 0.60/0.78 % (31235)------------------------------
% 0.60/0.78 % (31235)------------------------------
% 0.60/0.78 % (31228)------------------------------
% 0.60/0.78 % (31228)------------------------------
% 0.60/0.78 % (31231)------------------------------
% 0.60/0.78 % (31231)------------------------------
% 0.60/0.78 % (31234)First to succeed.
% 0.60/0.78 % (31237)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 (2995ds/50Mi)
% 0.60/0.78 % (31234)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-31227"
% 0.60/0.78 % (31236)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 (2995ds/55Mi)
% 0.60/0.78 % (31238)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2995ds/208Mi)
% 0.60/0.78 % (31234)Refutation found. Thanks to Tanya!
% 0.60/0.78 % SZS status Theorem for theBenchmark
% 0.60/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.78 % (31234)------------------------------
% 0.60/0.78 % (31234)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (31234)Termination reason: Refutation
% 0.60/0.78
% 0.60/0.78 % (31234)Memory used [KB]: 1105
% 0.60/0.78 % (31234)Time elapsed: 0.006 s
% 0.60/0.78 % (31234)Instructions burned: 9 (million)
% 0.60/0.78 % (31227)Success in time 0.456 s
% 0.60/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------