TSTP Solution File: SET798+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET798+4 : TPTP v8.1.2. 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 : n019.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 : Wed May 1 03:49:02 EDT 2024
% Result : Theorem 0.61s 0.81s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 8 unt; 0 def)
% Number of atoms : 124 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 127 ( 36 ~; 20 |; 49 &)
% ( 4 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 92 ( 66 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f71,plain,
$false,
inference(subsumption_resolution,[],[f70,f65]) ).
fof(f65,plain,
member(sK5(sK0,sK2,sK4),sK2),
inference(resolution,[],[f48,f54]) ).
fof(f54,plain,
! [X2,X0,X1] :
( lower_bound(X2,X0,X1)
| member(sK5(X0,X1,X2),X1) ),
inference(cnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0,X1,X2] :
( ( lower_bound(X2,X0,X1)
| ( ~ apply(X0,X2,sK5(X0,X1,X2))
& member(sK5(X0,X1,X2),X1) ) )
& ( ! [X4] :
( apply(X0,X2,X4)
| ~ member(X4,X1) )
| ~ lower_bound(X2,X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f40,f41]) ).
fof(f41,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) )
=> ( ~ apply(X0,X2,sK5(X0,X1,X2))
& member(sK5(X0,X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ( lower_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) ) )
& ( ! [X4] :
( apply(X0,X2,X4)
| ~ member(X4,X1) )
| ~ lower_bound(X2,X0,X1) ) ),
inference(rectify,[],[f39]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ( lower_bound(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X2,X3)
& member(X3,X1) ) )
& ( ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) )
| ~ lower_bound(X2,X0,X1) ) ),
inference(nnf_transformation,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( lower_bound(X2,X0,X1)
<=> ! [X3] :
( apply(X0,X2,X3)
| ~ member(X3,X1) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( lower_bound(X2,X0,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X0,X2,X3) ) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X5,X3,X7] :
( lower_bound(X7,X5,X3)
<=> ! [X2] :
( member(X2,X3)
=> apply(X5,X7,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.yN1bN88qwe/Vampire---4.8_12585',lower_bound) ).
fof(f48,plain,
~ lower_bound(sK4,sK0,sK2),
inference(cnf_transformation,[],[f38]) ).
fof(f38,plain,
( ~ lower_bound(sK4,sK0,sK2)
& lower_bound(sK4,sK0,sK3)
& subset(sK2,sK3)
& subset(sK3,sK1)
& subset(sK2,sK1)
& order(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f30,f37,f36,f35]) ).
fof(f35,plain,
( ? [X0,X1] :
( ? [X2,X3] :
( ? [X4] :
( ~ lower_bound(X4,X0,X2)
& lower_bound(X4,X0,X3) )
& subset(X2,X3)
& subset(X3,X1)
& subset(X2,X1) )
& order(X0,X1) )
=> ( ? [X3,X2] :
( ? [X4] :
( ~ lower_bound(X4,sK0,X2)
& lower_bound(X4,sK0,X3) )
& subset(X2,X3)
& subset(X3,sK1)
& subset(X2,sK1) )
& order(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f36,plain,
( ? [X3,X2] :
( ? [X4] :
( ~ lower_bound(X4,sK0,X2)
& lower_bound(X4,sK0,X3) )
& subset(X2,X3)
& subset(X3,sK1)
& subset(X2,sK1) )
=> ( ? [X4] :
( ~ lower_bound(X4,sK0,sK2)
& lower_bound(X4,sK0,sK3) )
& subset(sK2,sK3)
& subset(sK3,sK1)
& subset(sK2,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
( ? [X4] :
( ~ lower_bound(X4,sK0,sK2)
& lower_bound(X4,sK0,sK3) )
=> ( ~ lower_bound(sK4,sK0,sK2)
& lower_bound(sK4,sK0,sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
? [X0,X1] :
( ? [X2,X3] :
( ? [X4] :
( ~ lower_bound(X4,X0,X2)
& lower_bound(X4,X0,X3) )
& subset(X2,X3)
& subset(X3,X1)
& subset(X2,X1) )
& order(X0,X1) ),
inference(flattening,[],[f29]) ).
fof(f29,plain,
? [X0,X1] :
( ? [X2,X3] :
( ? [X4] :
( ~ lower_bound(X4,X0,X2)
& lower_bound(X4,X0,X3) )
& subset(X2,X3)
& subset(X3,X1)
& subset(X2,X1) )
& order(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
~ ! [X0,X1] :
( order(X0,X1)
=> ! [X2,X3] :
( ( subset(X2,X3)
& subset(X3,X1)
& subset(X2,X1) )
=> ! [X4] :
( lower_bound(X4,X0,X3)
=> lower_bound(X4,X0,X2) ) ) ),
inference(rectify,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X5,X3] :
( order(X5,X3)
=> ! [X2,X4] :
( ( subset(X2,X4)
& subset(X4,X3)
& subset(X2,X3) )
=> ! [X7] :
( lower_bound(X7,X5,X4)
=> lower_bound(X7,X5,X2) ) ) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X5,X3] :
( order(X5,X3)
=> ! [X2,X4] :
( ( subset(X2,X4)
& subset(X4,X3)
& subset(X2,X3) )
=> ! [X7] :
( lower_bound(X7,X5,X4)
=> lower_bound(X7,X5,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.yN1bN88qwe/Vampire---4.8_12585',thIV10) ).
fof(f70,plain,
~ member(sK5(sK0,sK2,sK4),sK2),
inference(resolution,[],[f69,f63]) ).
fof(f63,plain,
! [X0] :
( member(X0,sK3)
| ~ member(X0,sK2) ),
inference(resolution,[],[f46,f49]) ).
fof(f49,plain,
! [X2,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,plain,
! [X0,X1] :
( subset(X0,X1)
=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.yN1bN88qwe/Vampire---4.8_12585',subset) ).
fof(f46,plain,
subset(sK2,sK3),
inference(cnf_transformation,[],[f38]) ).
fof(f69,plain,
~ member(sK5(sK0,sK2,sK4),sK3),
inference(resolution,[],[f66,f64]) ).
fof(f64,plain,
! [X0] :
( apply(sK0,sK4,X0)
| ~ member(X0,sK3) ),
inference(resolution,[],[f47,f53]) ).
fof(f53,plain,
! [X2,X0,X1,X4] :
( ~ lower_bound(X2,X0,X1)
| ~ member(X4,X1)
| apply(X0,X2,X4) ),
inference(cnf_transformation,[],[f42]) ).
fof(f47,plain,
lower_bound(sK4,sK0,sK3),
inference(cnf_transformation,[],[f38]) ).
fof(f66,plain,
~ apply(sK0,sK4,sK5(sK0,sK2,sK4)),
inference(resolution,[],[f48,f55]) ).
fof(f55,plain,
! [X2,X0,X1] :
( lower_bound(X2,X0,X1)
| ~ apply(X0,X2,sK5(X0,X1,X2)) ),
inference(cnf_transformation,[],[f42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET798+4 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.12 % 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.12/0.32 % Computer : n019.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Tue Apr 30 17:19:29 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.12/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.12/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/tmp/tmp.yN1bN88qwe/Vampire---4.8_12585
% 0.61/0.81 % (12704)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.81 % (12703)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.81 % (12701)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 (2995ds/34Mi)
% 0.61/0.81 % (12706)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.81 % (12705)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 (2995ds/34Mi)
% 0.61/0.81 % (12702)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 (2995ds/51Mi)
% 0.61/0.81 % (12707)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 (2995ds/83Mi)
% 0.61/0.81 % (12708)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 (2995ds/56Mi)
% 0.61/0.81 % (12708)First to succeed.
% 0.61/0.81 % (12704)Also succeeded, but the first one will report.
% 0.61/0.81 % (12701)Also succeeded, but the first one will report.
% 0.61/0.81 % (12708)Refutation found. Thanks to Tanya!
% 0.61/0.81 % SZS status Theorem for Vampire---4
% 0.61/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.81 % (12708)------------------------------
% 0.61/0.81 % (12708)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.81 % (12708)Termination reason: Refutation
% 0.61/0.81
% 0.61/0.81 % (12708)Memory used [KB]: 1067
% 0.61/0.81 % (12708)Time elapsed: 0.004 s
% 0.61/0.81 % (12708)Instructions burned: 4 (million)
% 0.61/0.81 % (12708)------------------------------
% 0.61/0.81 % (12708)------------------------------
% 0.61/0.81 % (12698)Success in time 0.487 s
% 0.61/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------