TSTP Solution File: SWV216+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV216+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 : n003.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 04:02:52 EDT 2024
% Result : Theorem 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 3 unt; 0 def)
% Number of atoms : 447 ( 414 equ)
% Maximal formula atoms : 110 ( 37 avg)
% Number of connectives : 745 ( 310 ~; 117 |; 311 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 20 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(f260,plain,
$false,
inference(trivial_inequality_removal,[],[f216]) ).
fof(f216,plain,
( sK0 != sK0
| sK1 != sK1 ),
inference(definition_unfolding,[],[f138,f152,f151]) ).
fof(f151,plain,
n2 = sK1,
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& n4 = sK0
& n2 = sK1
& n2 = sK0
& n1 = sK1
& ( 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 )
& ( n3 != sK1
| n3 != sK0 )
& ( n5 != sK0
| n2 != sK1 )
& ( n4 != sK0
| n2 != sK1 )
& ( n3 != sK0
| n2 != sK1 )
& ( n5 != sK1
| n2 != sK0 )
& ( n4 != sK1
| n2 != sK0 )
& ( n3 != sK1
| n2 != sK0 )
& ( n5 != sK0
| n1 != sK1 )
& ( n5 != sK1
| n1 != sK0 )
& ( n4 != sK1
| n1 != sK0 )
& ( n3 != sK1
| n1 != sK0 )
& ( n5 != sK0
| n0 != sK1 )
& ( n5 != sK1
| n0 != sK0 )
& ( n4 != sK1
| n0 != sK0 )
& ( n3 != sK1
| n0 != sK0 )
& leq(sK1,n5)
& leq(sK0,n5)
& leq(n0,sK1)
& leq(n0,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f96,f118]) ).
fof(f118,plain,
( ? [X0,X1] :
( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& n4 = X0
& n2 = X1
& n2 = X0
& n1 = X1
& ( 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 )
& ( n3 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n4 != X0
| n2 != X1 )
& ( n3 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n4 != X1
| n2 != X0 )
& ( n3 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n5 != X1
| n1 != X0 )
& ( n4 != X1
| n1 != X0 )
& ( n3 != X1
| n1 != X0 )
& ( n5 != X0
| n0 != X1 )
& ( n5 != X1
| n0 != X0 )
& ( n4 != X1
| n0 != X0 )
& ( n3 != X1
| n0 != X0 )
& leq(X1,n5)
& leq(X0,n5)
& leq(n0,X1)
& leq(n0,X0) )
=> ( n0 != times(divide(n1,n400),a_select2(sigma,n2))
& n4 = sK0
& n2 = sK1
& n2 = sK0
& n1 = sK1
& ( 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 )
& ( n3 != sK1
| n3 != sK0 )
& ( n5 != sK0
| n2 != sK1 )
& ( n4 != sK0
| n2 != sK1 )
& ( n3 != sK0
| n2 != sK1 )
& ( n5 != sK1
| n2 != sK0 )
& ( n4 != sK1
| n2 != sK0 )
& ( n3 != sK1
| n2 != sK0 )
& ( n5 != sK0
| n1 != sK1 )
& ( n5 != sK1
| n1 != sK0 )
& ( n4 != sK1
| n1 != sK0 )
& ( n3 != sK1
| n1 != sK0 )
& ( n5 != sK0
| n0 != sK1 )
& ( n5 != sK1
| n0 != sK0 )
& ( n4 != sK1
| n0 != sK0 )
& ( n3 != sK1
| n0 != sK0 )
& 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,n2))
& n4 = X0
& n2 = X1
& n2 = X0
& n1 = X1
& ( 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 )
& ( n3 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n4 != X0
| n2 != X1 )
& ( n3 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n4 != X1
| n2 != X0 )
& ( n3 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n5 != X1
| n1 != X0 )
& ( n4 != X1
| n1 != X0 )
& ( n3 != X1
| n1 != X0 )
& ( n5 != X0
| n0 != X1 )
& ( n5 != X1
| n0 != X0 )
& ( n4 != X1
| n0 != X0 )
& ( n3 != X1
| n0 != X0 )
& 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,n2))
& n4 = X0
& n2 = X1
& n2 = X0
& n1 = X1
& ( 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 )
& ( n3 != X1
| n3 != X0 )
& ( n5 != X0
| n2 != X1 )
& ( n4 != X0
| n2 != X1 )
& ( n3 != X0
| n2 != X1 )
& ( n5 != X1
| n2 != X0 )
& ( n4 != X1
| n2 != X0 )
& ( n3 != X1
| n2 != X0 )
& ( n5 != X0
| n1 != X1 )
& ( n5 != X1
| n1 != X0 )
& ( n4 != X1
| n1 != X0 )
& ( n3 != X1
| n1 != X0 )
& ( n5 != X0
| n0 != X1 )
& ( n5 != X1
| n0 != X0 )
& ( n4 != X1
| n0 != X0 )
& ( n3 != X1
| n0 != X0 )
& 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) )
=> ( ( n4 = X0
& n2 = X1
& n2 = X0
& n1 = X1
& ~ ( 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 )
& ~ ( n3 = X1
& n3 = X0 )
& ~ ( n5 = X0
& n2 = X1 )
& ~ ( n4 = X0
& n2 = X1 )
& ~ ( n3 = X0
& n2 = X1 )
& ~ ( n5 = X1
& n2 = X0 )
& ~ ( n4 = X1
& n2 = X0 )
& ~ ( n3 = X1
& n2 = X0 )
& ~ ( n5 = X0
& n1 = X1 )
& ~ ( n5 = X1
& n1 = X0 )
& ~ ( n4 = X1
& n1 = X0 )
& ~ ( n3 = X1
& n1 = X0 )
& ~ ( n5 = X0
& n0 = X1 )
& ~ ( n5 = X1
& n0 = X0 )
& ~ ( n4 = X1
& n0 = X0 )
& ~ ( n3 = X1
& n0 = X0 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ! [X13,X17] :
( ( leq(X17,n5)
& leq(X13,n5)
& leq(n0,X17)
& leq(n0,X13) )
=> ( ( n4 = X13
& n2 = X17
& n2 = X13
& n1 = X17
& ~ ( 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 )
& ~ ( n3 = X17
& n3 = X13 )
& ~ ( n5 = X13
& n2 = X17 )
& ~ ( n4 = X13
& n2 = X17 )
& ~ ( n3 = X13
& n2 = X17 )
& ~ ( n5 = X17
& n2 = X13 )
& ~ ( n4 = X17
& n2 = X13 )
& ~ ( n3 = X17
& n2 = X13 )
& ~ ( n5 = X13
& n1 = X17 )
& ~ ( n5 = X17
& n1 = X13 )
& ~ ( n4 = X17
& n1 = X13 )
& ~ ( n3 = X17
& n1 = X13 )
& ~ ( n5 = X13
& n0 = X17 )
& ~ ( n5 = X17
& n0 = X13 )
& ~ ( n4 = X17
& n0 = X13 )
& ~ ( n3 = X17
& n0 = X13 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
! [X13,X17] :
( ( leq(X17,n5)
& leq(X13,n5)
& leq(n0,X17)
& leq(n0,X13) )
=> ( ( n4 = X13
& n2 = X17
& n2 = X13
& n1 = X17
& ~ ( 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 )
& ~ ( n3 = X17
& n3 = X13 )
& ~ ( n5 = X13
& n2 = X17 )
& ~ ( n4 = X13
& n2 = X17 )
& ~ ( n3 = X13
& n2 = X17 )
& ~ ( n5 = X17
& n2 = X13 )
& ~ ( n4 = X17
& n2 = X13 )
& ~ ( n3 = X17
& n2 = X13 )
& ~ ( n5 = X13
& n1 = X17 )
& ~ ( n5 = X17
& n1 = X13 )
& ~ ( n4 = X17
& n1 = X13 )
& ~ ( n3 = X17
& n1 = X13 )
& ~ ( n5 = X13
& n0 = X17 )
& ~ ( n5 = X17
& n0 = X13 )
& ~ ( n4 = X17
& n0 = X13 )
& ~ ( n3 = X17
& n0 = X13 ) )
=> n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TmX2rW04ly/Vampire---4.8_28456',quaternion_ds1_symm_0201) ).
fof(f152,plain,
n4 = sK0,
inference(cnf_transformation,[],[f119]) ).
fof(f138,plain,
( n4 != sK0
| n2 != sK1 ),
inference(cnf_transformation,[],[f119]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWV216+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.13/0.15 % 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.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 18:37:49 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 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.TmX2rW04ly/Vampire---4.8_28456
% 0.61/0.78 % (28657)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.78 % (28659)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.78 % (28652)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.78 % (28654)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.78 % (28657)First to succeed.
% 0.61/0.78 % (28653)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.78 % (28655)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.78 % (28656)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.78 % (28658)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.78 % (28659)Also succeeded, but the first one will report.
% 0.61/0.78 % (28657)Refutation found. Thanks to Tanya!
% 0.61/0.78 % SZS status Theorem for Vampire---4
% 0.61/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.78 % (28657)------------------------------
% 0.61/0.78 % (28657)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78 % (28657)Termination reason: Refutation
% 0.61/0.78
% 0.61/0.78 % (28657)Memory used [KB]: 1141
% 0.61/0.78 % (28657)Time elapsed: 0.005 s
% 0.61/0.78 % (28657)Instructions burned: 7 (million)
% 0.61/0.78 % (28657)------------------------------
% 0.61/0.78 % (28657)------------------------------
% 0.61/0.78 % (28621)Success in time 0.413 s
% 0.61/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------