TSTP Solution File: SET791+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET791+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 : n015.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:01 EDT 2024
% Result : Theorem 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 156 ( 13 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 168 ( 47 ~; 42 |; 46 &)
% ( 6 <=>; 27 =>; 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 : 111 ( 103 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f73,plain,
$false,
inference(subsumption_resolution,[],[f70,f61]) ).
fof(f61,plain,
apply(sK0,sK3(sK0,sK1,sK2),sK2),
inference(unit_resulting_resolution,[],[f28,f44,f33]) ).
fof(f33,plain,
! [X2,X3,X0,X1] :
( ~ greatest(X2,X0,X1)
| ~ member(X3,X1)
| apply(X0,X3,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( apply(X0,X3,X2)
| ~ member(X3,X1) )
& member(X2,X1) )
| ~ greatest(X2,X0,X1) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1,X2] :
( greatest(X2,X0,X1)
=> ( ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) )
& member(X2,X1) ) ),
inference(unused_predicate_definition_removal,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( greatest(X2,X0,X1)
<=> ( ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) )
& member(X2,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X0,X1,X5] :
( greatest(X5,X0,X1)
<=> ( ! [X2] :
( member(X2,X1)
=> apply(X0,X2,X5) )
& member(X5,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.hpa58BujFP/Vampire---4.8_20566',greatest) ).
fof(f44,plain,
member(sK3(sK0,sK1,sK2),sK1),
inference(unit_resulting_resolution,[],[f38,f29,f35]) ).
fof(f35,plain,
! [X2,X0,X1] :
( member(sK3(X0,X1,X2),X1)
| ~ member(X2,X1)
| max(X2,X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( max(X2,X0,X1)
| ? [X3] :
( X2 != X3
& apply(X0,X2,X3)
& member(X3,X1) )
| ~ member(X2,X1) ),
inference(flattening,[],[f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( max(X2,X0,X1)
| ? [X3] :
( X2 != X3
& apply(X0,X2,X3)
& member(X3,X1) )
| ~ member(X2,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( ( apply(X0,X2,X3)
& member(X3,X1) )
=> X2 = X3 )
& member(X2,X1) )
=> max(X2,X0,X1) ),
inference(unused_predicate_definition_removal,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( max(X2,X0,X1)
<=> ( ! [X3] :
( ( apply(X0,X2,X3)
& member(X3,X1) )
=> X2 = X3 )
& member(X2,X1) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X5] :
( max(X5,X0,X1)
<=> ( ! [X2] :
( ( apply(X0,X5,X2)
& member(X2,X1) )
=> X2 = X5 )
& member(X5,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.hpa58BujFP/Vampire---4.8_20566',max) ).
fof(f29,plain,
~ max(sK2,sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
? [X0,X1,X2] :
( ~ max(X2,X0,X1)
& greatest(X2,X0,X1)
& order(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ~ max(X2,X0,X1)
& greatest(X2,X0,X1)
& order(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
~ ! [X0,X1,X2] :
( ( greatest(X2,X0,X1)
& order(X0,X1) )
=> max(X2,X0,X1) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X5] :
( ( greatest(X5,X0,X1)
& order(X0,X1) )
=> max(X5,X0,X1) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X1,X5] :
( ( greatest(X5,X0,X1)
& order(X0,X1) )
=> max(X5,X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.hpa58BujFP/Vampire---4.8_20566',thIV3) ).
fof(f38,plain,
member(sK2,sK1),
inference(unit_resulting_resolution,[],[f28,f34]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ greatest(X2,X0,X1)
| member(X2,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f28,plain,
greatest(sK2,sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
fof(f70,plain,
~ apply(sK0,sK3(sK0,sK1,sK2),sK2),
inference(unit_resulting_resolution,[],[f38,f27,f44,f46,f45,f31]) ).
fof(f31,plain,
! [X0,X1,X6,X5] :
( ~ apply(X0,X6,X5)
| ~ member(X5,X1)
| ~ member(X6,X1)
| ~ apply(X0,X5,X6)
| ~ order(X0,X1)
| X5 = X6 ),
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/tmp/tmp.hpa58BujFP/Vampire---4.8_20566',order) ).
fof(f45,plain,
apply(sK0,sK2,sK3(sK0,sK1,sK2)),
inference(unit_resulting_resolution,[],[f38,f29,f36]) ).
fof(f36,plain,
! [X2,X0,X1] :
( apply(X0,X2,sK3(X0,X1,X2))
| ~ member(X2,X1)
| max(X2,X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f46,plain,
sK2 != sK3(sK0,sK1,sK2),
inference(unit_resulting_resolution,[],[f38,f29,f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( max(X2,X0,X1)
| sK3(X0,X1,X2) != X2
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f27,plain,
order(sK0,sK1),
inference(cnf_transformation,[],[f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET791+4 : TPTP v8.1.2. Released v3.2.0.
% 0.03/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.36 % Computer : n015.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 17:37:03 EDT 2024
% 0.14/0.36 % 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.hpa58BujFP/Vampire---4.8_20566
% 0.59/0.76 % (20826)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.59/0.76 % (20820)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.59/0.76 % (20822)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.59/0.76 % (20821)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.59/0.76 % (20825)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.59/0.76 % (20823)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.59/0.76 % (20826)First to succeed.
% 0.59/0.76 % (20824)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.59/0.76 % (20827)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.59/0.76 % (20826)Refutation found. Thanks to Tanya!
% 0.59/0.76 % SZS status Theorem for Vampire---4
% 0.59/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.76 % (20826)------------------------------
% 0.59/0.76 % (20826)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.76 % (20826)Termination reason: Refutation
% 0.59/0.76
% 0.59/0.76 % (20826)Memory used [KB]: 1058
% 0.59/0.76 % (20826)Time elapsed: 0.003 s
% 0.59/0.76 % (20826)Instructions burned: 5 (million)
% 0.59/0.76 % (20826)------------------------------
% 0.59/0.76 % (20826)------------------------------
% 0.59/0.76 % (20816)Success in time 0.387 s
% 0.59/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------