TSTP Solution File: SWV220+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV220+1 : TPTP v8.1.2. Bugfixed v3.3.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 : n025.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 10:28:27 EDT 2024
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 322 ( 289 equ)
% Maximal formula atoms : 78 ( 21 avg)
% Number of connectives : 514 ( 207 ~; 77 |; 223 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 13 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 12 ( 6 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f225,plain,
$false,
inference(subsumption_resolution,[],[f223,f178]) ).
fof(f178,plain,
sK0 = sK1,
inference(definition_unfolding,[],[f136,f137]) ).
fof(f137,plain,
n3 = sK1,
inference(cnf_transformation,[],[f115]) ).
fof(f115,plain,
( n0 != times(divide(n1,n400),a_select2(sigma,n3))
& n5 = sK1
& n3 = sK1
& n3 = sK0
& n1 = sK0
& ( n5 != sK1
| n5 != sK0 )
& ( n5 != sK0
| n4 != sK1 )
& ( n5 != sK1
| n4 != sK0 )
& ( n4 != sK1
| n4 != sK0 )
& ( n5 != sK0
| n3 != sK1 )
& ( n4 != sK0
| n3 != sK1 )
& ( n5 != sK1
| n3 != sK0 )
& ( n4 != sK1
| n3 != sK0 )
& ( n5 != sK0
| n2 != sK1 )
& ( n4 != sK0
| n2 != sK1 )
& ( n5 != sK1
| n2 != sK0 )
& ( n5 != sK0
| n1 != sK1 )
& ( n4 != sK0
| n1 != sK1 )
& ( n5 != sK0
| n0 != sK1 )
& ( n4 != sK0
| n0 != sK1 )
& leq(sK1,n5)
& leq(sK0,n5)
& leq(n0,sK1)
& leq(n0,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f96,f114]) ).
fof(f114,plain,
( ? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n3))
& n5 = X1
& n3 = X1
& n3 = X0
& n1 = X0
& ( n5 != X1
| n5 != X0 )
& ( n5 != X0
| n4 != X1 )
& ( n5 != X1
| n4 != X0 )
& ( n4 != X1
| n4 != X0 )
& ( n5 != X0
| n3 != X1 )
& ( n4 != X0
| n3 != X1 )
& ( n5 != X1
| n3 != X0 )
& ( n4 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n4 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n4 != X0
| n1 != X1 )
& ( n5 != X0
| n0 != X1 )
& ( n4 != X0
| n0 != X1 )
& leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> ( n0 != times(divide(n1,n400),a_select2(sigma,n3))
& n5 = sK1
& n3 = sK1
& n3 = sK0
& n1 = sK0
& ( n5 != sK1
| n5 != sK0 )
& ( n5 != sK0
| n4 != sK1 )
& ( n5 != sK1
| n4 != sK0 )
& ( n4 != sK1
| n4 != sK0 )
& ( n5 != sK0
| n3 != sK1 )
& ( n4 != sK0
| n3 != sK1 )
& ( n5 != sK1
| n3 != sK0 )
& ( n4 != sK1
| n3 != sK0 )
& ( n5 != sK0
| n2 != sK1 )
& ( n4 != sK0
| n2 != sK1 )
& ( n5 != sK1
| n2 != sK0 )
& ( n5 != sK0
| n1 != sK1 )
& ( n4 != sK0
| n1 != sK1 )
& ( n5 != sK0
| n0 != sK1 )
& ( n4 != sK0
| n0 != sK1 )
& leq(sK1,n5)
& leq(sK0,n5)
& leq(n0,sK1)
& leq(n0,sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f96,plain,
? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n3))
& n5 = X1
& n3 = X1
& n3 = X0
& n1 = X0
& ( n5 != X1
| n5 != X0 )
& ( n5 != X0
| n4 != X1 )
& ( n5 != X1
| n4 != X0 )
& ( n4 != X1
| n4 != X0 )
& ( n5 != X0
| n3 != X1 )
& ( n4 != X0
| n3 != X1 )
& ( n5 != X1
| n3 != X0 )
& ( n4 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n4 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n4 != X0
| n1 != X1 )
& ( n5 != X0
| n0 != X1 )
& ( n4 != X0
| n0 != X1 )
& leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) ),
inference(flattening,[],[f95]) ).
fof(f95,plain,
? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n3))
& n5 = X1
& n3 = X1
& n3 = X0
& n1 = X0
& ( n5 != X1
| n5 != X0 )
& ( n5 != X0
| n4 != X1 )
& ( n5 != X1
| n4 != X0 )
& ( n4 != X1
| n4 != X0 )
& ( n5 != X0
| n3 != X1 )
& ( n4 != X0
| n3 != X1 )
& ( n5 != X1
| n3 != X0 )
& ( n4 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n4 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n4 != X0
| n1 != X1 )
& ( n5 != X0
| n0 != X1 )
& ( n4 != X0
| n0 != X1 )
& leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) ),
inference(ennf_transformation,[],[f94]) ).
fof(f94,plain,
~ ! [X0,X1] :
( ( leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> ( ( n5 = X1
& n3 = X1
& n3 = X0
& n1 = X0
& ~ ( n5 = X1
& n5 = X0 )
& ~ ( n5 = X0
& n4 = X1 )
& ~ ( n5 = X1
& n4 = X0 )
& ~ ( n4 = X1
& n4 = X0 )
& ~ ( n5 = X0
& n3 = X1 )
& ~ ( n4 = X0
& n3 = X1 )
& ~ ( n5 = X1
& n3 = X0 )
& ~ ( n4 = X1
& n3 = X0 )
& ~ ( n5 = X0
& n2 = X1 )
& ~ ( n4 = X0
& n2 = X1 )
& ~ ( n5 = X1
& n2 = X0 )
& ~ ( n5 = X0
& n1 = X1 )
& ~ ( n4 = X0
& n1 = X1 )
& ~ ( n5 = X0
& n0 = X1 )
& ~ ( n4 = X0
& n0 = X1 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n3)) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ! [X13,X17] :
( ( leq(X17,n5)
& leq(X13,n5)
& leq(n0,X17)
& leq(n0,X13) )
=> ( ( n5 = X17
& n3 = X17
& n3 = X13
& n1 = X13
& ~ ( n5 = X17
& n5 = X13 )
& ~ ( n5 = X13
& n4 = X17 )
& ~ ( n5 = X17
& n4 = X13 )
& ~ ( n4 = X17
& n4 = X13 )
& ~ ( n5 = X13
& n3 = X17 )
& ~ ( n4 = X13
& n3 = X17 )
& ~ ( n5 = X17
& n3 = X13 )
& ~ ( n4 = X17
& n3 = X13 )
& ~ ( n5 = X13
& n2 = X17 )
& ~ ( n4 = X13
& n2 = X17 )
& ~ ( n5 = X17
& n2 = X13 )
& ~ ( n5 = X13
& n1 = X17 )
& ~ ( n4 = X13
& n1 = X17 )
& ~ ( n5 = X13
& n0 = X17 )
& ~ ( n4 = X13
& n0 = X17 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n3)) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
! [X13,X17] :
( ( leq(X17,n5)
& leq(X13,n5)
& leq(n0,X17)
& leq(n0,X13) )
=> ( ( n5 = X17
& n3 = X17
& n3 = X13
& n1 = X13
& ~ ( n5 = X17
& n5 = X13 )
& ~ ( n5 = X13
& n4 = X17 )
& ~ ( n5 = X17
& n4 = X13 )
& ~ ( n4 = X17
& n4 = X13 )
& ~ ( n5 = X13
& n3 = X17 )
& ~ ( n4 = X13
& n3 = X17 )
& ~ ( n5 = X17
& n3 = X13 )
& ~ ( n4 = X17
& n3 = X13 )
& ~ ( n5 = X13
& n2 = X17 )
& ~ ( n4 = X13
& n2 = X17 )
& ~ ( n5 = X17
& n2 = X13 )
& ~ ( n5 = X13
& n1 = X17 )
& ~ ( n4 = X13
& n1 = X17 )
& ~ ( n5 = X13
& n0 = X17 )
& ~ ( n4 = X13
& n0 = X17 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n3)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.68vuCtrtVK/Vampire---4.8_7485',quaternion_ds1_symm_0361) ).
fof(f136,plain,
n3 = sK0,
inference(cnf_transformation,[],[f115]) ).
fof(f223,plain,
sK0 != sK1,
inference(trivial_inequality_removal,[],[f179]) ).
fof(f179,plain,
( sK1 != sK1
| sK0 != sK1 ),
inference(definition_unfolding,[],[f134,f138,f138]) ).
fof(f138,plain,
n5 = sK1,
inference(cnf_transformation,[],[f115]) ).
fof(f134,plain,
( n5 != sK1
| n5 != sK0 ),
inference(cnf_transformation,[],[f115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV220+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.14 % 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.15/0.35 % Computer : n025.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 21:00:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.68vuCtrtVK/Vampire---4.8_7485
% 0.61/0.80 % (7675)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.80 % (7680)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.80 % (7675)First to succeed.
% 0.61/0.80 % (7672)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.80 % (7673)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.80 % (7674)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.80 % (7676)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.80 % (7680)Also succeeded, but the first one will report.
% 0.61/0.80 % (7677)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.80 % (7675)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-7651"
% 0.61/0.80 % (7678)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.80 % (7675)Refutation found. Thanks to Tanya!
% 0.61/0.80 % SZS status Theorem for Vampire---4
% 0.61/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.80 % (7675)------------------------------
% 0.61/0.80 % (7675)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (7675)Termination reason: Refutation
% 0.61/0.80
% 0.61/0.80 % (7675)Memory used [KB]: 1098
% 0.61/0.80 % (7675)Time elapsed: 0.002 s
% 0.61/0.80 % (7675)Instructions burned: 5 (million)
% 0.61/0.80 % (7651)Success in time 0.438 s
% 0.61/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------