TSTP Solution File: SET793+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET793+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n004.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:30 EDT 2024
% Result : Theorem 0.59s 0.80s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 10 unt; 0 def)
% Number of atoms : 146 ( 8 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 152 ( 49 ~; 46 |; 34 &)
% ( 5 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 109 ( 97 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f61,plain,
$false,
inference(subsumption_resolution,[],[f59,f53]) ).
fof(f53,plain,
apply(sK0,sK2,sK2),
inference(unit_resulting_resolution,[],[f40,f52]) ).
fof(f52,plain,
! [X0] :
( apply(sK0,X0,X0)
| ~ member(X0,sK1) ),
inference(duplicate_literal_removal,[],[f51]) ).
fof(f51,plain,
! [X0] :
( apply(sK0,X0,X0)
| ~ member(X0,sK1)
| ~ member(X0,sK1) ),
inference(factoring,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( apply(sK0,X0,X1)
| ~ member(X1,sK1)
| ~ member(X0,sK1)
| apply(sK0,X1,X0) ),
inference(resolution,[],[f35,f32]) ).
fof(f32,plain,
total_order(sK0,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f29,plain,
( ~ greatest(sK2,sK0,sK1)
& max(sK2,sK0,sK1)
& total_order(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f21,f28]) ).
fof(f28,plain,
( ? [X0,X1,X2] :
( ~ greatest(X2,X0,X1)
& max(X2,X0,X1)
& total_order(X0,X1) )
=> ( ~ greatest(sK2,sK0,sK1)
& max(sK2,sK0,sK1)
& total_order(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1,X2] :
( ~ greatest(X2,X0,X1)
& max(X2,X0,X1)
& total_order(X0,X1) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ~ greatest(X2,X0,X1)
& max(X2,X0,X1)
& total_order(X0,X1) ),
inference(ennf_transformation,[],[f13]) ).
fof(f13,plain,
~ ! [X0,X1,X2] :
( ( max(X2,X0,X1)
& total_order(X0,X1) )
=> greatest(X2,X0,X1) ),
inference(rectify,[],[f12]) ).
fof(f12,negated_conjecture,
~ ! [X0,X1,X5] :
( ( max(X5,X0,X1)
& total_order(X0,X1) )
=> greatest(X5,X0,X1) ),
inference(negated_conjecture,[],[f11]) ).
fof(f11,conjecture,
! [X0,X1,X5] :
( ( max(X5,X0,X1)
& total_order(X0,X1) )
=> greatest(X5,X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.5lOVs9ZJcA/Vampire---4.8_8060',thIV5) ).
fof(f35,plain,
! [X2,X3,X0,X1] :
( ~ total_order(X0,X1)
| apply(X0,X2,X3)
| ~ member(X3,X1)
| ~ member(X2,X1)
| apply(X0,X3,X2) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
! [X0,X1] :
( ! [X2,X3] :
( apply(X0,X3,X2)
| apply(X0,X2,X3)
| ~ member(X3,X1)
| ~ member(X2,X1) )
| ~ total_order(X0,X1) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ! [X2,X3] :
( apply(X0,X3,X2)
| apply(X0,X2,X3)
| ~ member(X3,X1)
| ~ member(X2,X1) )
| ~ total_order(X0,X1) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( total_order(X0,X1)
=> ! [X2,X3] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( apply(X0,X3,X2)
| apply(X0,X2,X3) ) ) ),
inference(pure_predicate_removal,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( total_order(X0,X1)
=> ( ! [X2,X3] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( apply(X0,X3,X2)
| apply(X0,X2,X3) ) )
& order(X0,X1) ) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( total_order(X0,X1)
<=> ( ! [X2,X3] :
( ( member(X3,X1)
& member(X2,X1) )
=> ( apply(X0,X3,X2)
| apply(X0,X2,X3) ) )
& order(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.5lOVs9ZJcA/Vampire---4.8_8060',total_order) ).
fof(f40,plain,
member(sK2,sK1),
inference(unit_resulting_resolution,[],[f33,f38]) ).
fof(f38,plain,
! [X2,X0,X1] :
( member(X2,X1)
| ~ max(X2,X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( X2 = X3
| ~ apply(X0,X2,X3)
| ~ member(X3,X1) )
& member(X2,X1) )
| ~ max(X2,X0,X1) ),
inference(flattening,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( X2 = X3
| ~ apply(X0,X2,X3)
| ~ member(X3,X1) )
& member(X2,X1) )
| ~ max(X2,X0,X1) ),
inference(ennf_transformation,[],[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(unused_predicate_definition_removal,[],[f15]) ).
fof(f15,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/sandbox2/tmp/tmp.5lOVs9ZJcA/Vampire---4.8_8060',max) ).
fof(f33,plain,
max(sK2,sK0,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f59,plain,
~ apply(sK0,sK2,sK2),
inference(backward_demodulation,[],[f42,f56]) ).
fof(f56,plain,
sK2 = sK3(sK0,sK1,sK2),
inference(unit_resulting_resolution,[],[f33,f41,f41,f42,f40,f50]) ).
fof(f50,plain,
! [X2,X0,X1] :
( X0 = X1
| ~ member(X1,sK1)
| apply(sK0,X0,X1)
| ~ member(X0,sK1)
| ~ member(X0,X2)
| ~ max(X1,sK0,X2) ),
inference(resolution,[],[f45,f39]) ).
fof(f39,plain,
! [X2,X3,X0,X1] :
( ~ apply(X0,X2,X3)
| X2 = X3
| ~ member(X3,X1)
| ~ max(X2,X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f41,plain,
member(sK3(sK0,sK1,sK2),sK1),
inference(unit_resulting_resolution,[],[f40,f34,f36]) ).
fof(f36,plain,
! [X2,X0,X1] :
( member(sK3(X0,X1,X2),X1)
| greatest(X2,X0,X1)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( greatest(X2,X0,X1)
| ( ~ apply(X0,sK3(X0,X1,X2),X2)
& member(sK3(X0,X1,X2),X1) )
| ~ member(X2,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f25,f30]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) )
=> ( ~ apply(X0,sK3(X0,X1,X2),X2)
& member(sK3(X0,X1,X2),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0,X1,X2] :
( greatest(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) )
| ~ member(X2,X1) ),
inference(flattening,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( greatest(X2,X0,X1)
| ? [X3] :
( ~ apply(X0,X3,X2)
& member(X3,X1) )
| ~ member(X2,X1) ),
inference(ennf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( ! [X3] :
( member(X3,X1)
=> apply(X0,X3,X2) )
& member(X2,X1) )
=> greatest(X2,X0,X1) ),
inference(unused_predicate_definition_removal,[],[f14]) ).
fof(f14,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/sandbox2/tmp/tmp.5lOVs9ZJcA/Vampire---4.8_8060',greatest) ).
fof(f34,plain,
~ greatest(sK2,sK0,sK1),
inference(cnf_transformation,[],[f29]) ).
fof(f42,plain,
~ apply(sK0,sK3(sK0,sK1,sK2),sK2),
inference(unit_resulting_resolution,[],[f40,f34,f37]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ apply(X0,sK3(X0,X1,X2),X2)
| greatest(X2,X0,X1)
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET793+4 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.12 % 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.12/0.32 % Computer : n004.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 : Fri May 3 16:28:23 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.5lOVs9ZJcA/Vampire---4.8_8060
% 0.59/0.80 % (8175)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.59/0.80 % (8174)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.59/0.80 % (8173)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.59/0.80 % (8172)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.59/0.80 % (8177)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.59/0.80 % (8178)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.59/0.80 % (8176)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.59/0.80 % (8175)Refutation not found, incomplete strategy% (8175)------------------------------
% 0.59/0.80 % (8175)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (8175)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.80
% 0.59/0.80 % (8175)Memory used [KB]: 1035
% 0.59/0.80 % (8175)Time elapsed: 0.003 s
% 0.59/0.80 % (8175)Instructions burned: 3 (million)
% 0.59/0.80 % (8175)------------------------------
% 0.59/0.80 % (8175)------------------------------
% 0.59/0.80 % (8171)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.59/0.80 % (8174)First to succeed.
% 0.59/0.80 % (8172)Also succeeded, but the first one will report.
% 0.59/0.80 % (8177)Also succeeded, but the first one will report.
% 0.59/0.80 % (8171)Refutation not found, incomplete strategy% (8171)------------------------------
% 0.59/0.80 % (8171)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (8171)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.80
% 0.59/0.80 % (8171)Memory used [KB]: 981
% 0.59/0.80 % (8171)Time elapsed: 0.003 s
% 0.59/0.80 % (8171)Instructions burned: 2 (million)
% 0.59/0.80 % (8174)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-8170"
% 0.59/0.80 % (8171)------------------------------
% 0.59/0.80 % (8171)------------------------------
% 0.59/0.80 % (8174)Refutation found. Thanks to Tanya!
% 0.59/0.80 % SZS status Theorem for Vampire---4
% 0.59/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.80 % (8174)------------------------------
% 0.59/0.80 % (8174)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.80 % (8174)Termination reason: Refutation
% 0.59/0.80
% 0.59/0.80 % (8174)Memory used [KB]: 1066
% 0.59/0.80 % (8174)Time elapsed: 0.005 s
% 0.59/0.80 % (8174)Instructions burned: 5 (million)
% 0.59/0.80 % (8170)Success in time 0.468 s
% 0.59/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------