TSTP Solution File: SET804+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET804+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 : n020.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 09:08:33 EDT 2024
% Result : Theorem 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 12 unt; 0 def)
% Number of atoms : 99 ( 16 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 99 ( 34 ~; 21 |; 26 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 77 ( 64 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f95,plain,
$false,
inference(subsumption_resolution,[],[f94,f65]) ).
fof(f65,plain,
~ least(sK2,sK0,sK1),
inference(unit_resulting_resolution,[],[f44,f43,f35]) ).
fof(f35,plain,
! [X2,X3,X0,X1] :
( ~ least(X2,X0,X1)
| ~ member(X3,X1)
| apply(X0,X2,X3) ),
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/tmp/tmp.ioS47NNjKW/Vampire---4.8_30668',least) ).
fof(f43,plain,
~ apply(sK0,sK2,sK3),
inference(unit_resulting_resolution,[],[f29,f39,f28,f37]) ).
fof(f37,plain,
! [X2,X3,X0,X1] :
( ~ min(X2,X0,X1)
| ~ member(X3,X1)
| ~ apply(X0,X3,X2)
| X2 = X3 ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( X2 = X3
| ~ apply(X0,X3,X2)
| ~ member(X3,X1) )
& member(X2,X1) )
| ~ min(X2,X0,X1) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( X2 = X3
| ~ apply(X0,X3,X2)
| ~ member(X3,X1) )
& member(X2,X1) )
| ~ min(X2,X0,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( min(X2,X0,X1)
=> ( ! [X3] :
( ( apply(X0,X3,X2)
& member(X3,X1) )
=> X2 = X3 )
& member(X2,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/tmp/tmp.ioS47NNjKW/Vampire---4.8_30668',min) ).
fof(f28,plain,
min(sK3,sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
? [X0,X1] :
( ? [X2,X3] :
( ? [X4] : least(X4,X0,X1)
& X2 != X3
& min(X3,X0,X1)
& min(X2,X0,X1) )
& order(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
? [X0,X1] :
( ? [X2,X3] :
( ? [X4] : least(X4,X0,X1)
& X2 != X3
& min(X3,X0,X1)
& min(X2,X0,X1) )
& order(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
~ ! [X0,X1] :
( order(X0,X1)
=> ! [X2,X3] :
( ( X2 != X3
& min(X3,X0,X1)
& min(X2,X0,X1) )
=> ~ ? [X4] : least(X4,X0,X1) ) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X1] :
( order(X0,X1)
=> ! [X7,X8] :
( ( X7 != X8
& min(X8,X0,X1)
& min(X7,X0,X1) )
=> ~ ? [X5] : least(X5,X0,X1) ) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X1] :
( order(X0,X1)
=> ! [X7,X8] :
( ( X7 != X8
& min(X8,X0,X1)
& min(X7,X0,X1) )
=> ~ ? [X5] : least(X5,X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.ioS47NNjKW/Vampire---4.8_30668',thIV16) ).
fof(f39,plain,
member(sK2,sK1),
inference(unit_resulting_resolution,[],[f27,f38]) ).
fof(f38,plain,
! [X2,X0,X1] :
( ~ min(X2,X0,X1)
| member(X2,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f27,plain,
min(sK2,sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
fof(f29,plain,
sK2 != sK3,
inference(cnf_transformation,[],[f21]) ).
fof(f44,plain,
member(sK3,sK1),
inference(unit_resulting_resolution,[],[f28,f38]) ).
fof(f94,plain,
least(sK2,sK0,sK1),
inference(superposition,[],[f30,f91]) ).
fof(f91,plain,
sK2 = sK4,
inference(subsumption_resolution,[],[f90,f39]) ).
fof(f90,plain,
( sK2 = sK4
| ~ member(sK2,sK1) ),
inference(subsumption_resolution,[],[f88,f51]) ).
fof(f51,plain,
member(sK4,sK1),
inference(unit_resulting_resolution,[],[f30,f36]) ).
fof(f36,plain,
! [X2,X0,X1] :
( ~ least(X2,X0,X1)
| member(X2,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f88,plain,
( ~ member(sK4,sK1)
| sK2 = sK4
| ~ member(sK2,sK1) ),
inference(resolution,[],[f40,f52]) ).
fof(f52,plain,
! [X0] :
( apply(sK0,sK4,X0)
| ~ member(X0,sK1) ),
inference(resolution,[],[f30,f35]) ).
fof(f40,plain,
! [X0] :
( ~ apply(sK0,X0,sK2)
| ~ member(X0,sK1)
| sK2 = X0 ),
inference(resolution,[],[f27,f37]) ).
fof(f30,plain,
least(sK4,sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET804+4 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.15 % 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.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 16:41:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 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.ioS47NNjKW/Vampire---4.8_30668
% 0.56/0.75 % (30912)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.75 % (30906)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.75 % (30908)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.75 % (30909)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.75 % (30910)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.75 % (30907)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.75 % (30911)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.75 % (30912)First to succeed.
% 0.56/0.75 % (30912)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30902"
% 0.56/0.75 % (30912)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Theorem for Vampire---4
% 0.56/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.75 % (30912)------------------------------
% 0.56/0.75 % (30912)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (30912)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (30912)Memory used [KB]: 1063
% 0.56/0.75 % (30912)Time elapsed: 0.003 s
% 0.56/0.75 % (30912)Instructions burned: 6 (million)
% 0.56/0.75 % (30902)Success in time 0.385 s
% 0.56/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------