TSTP Solution File: SWV230+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV230+1 : TPTP v8.2.0. 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 : n008.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 : Tue May 21 05:54:29 EDT 2024
% Result : Theorem 0.52s 0.72s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 3 unt; 0 def)
% Number of atoms : 192 ( 131 equ)
% Maximal formula atoms : 37 ( 19 avg)
% Number of connectives : 269 ( 87 ~; 36 |; 131 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 11 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 30 ( 26 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f248,plain,
$false,
inference(trivial_inequality_removal,[],[f201]) ).
fof(f201,plain,
( sK1 != sK1
| sK0 != sK0 ),
inference(definition_unfolding,[],[f112,f126,f127]) ).
fof(f127,plain,
n5 = sK0,
inference(cnf_transformation,[],[f89]) ).
fof(f89,plain,
( ? [X4,X5] :
( n0 != a_select2(xinit_noise,n4)
& n5 = X4
& n4 = X5
& n4 = X4
& n1 = X5
& ( n5 != X5
| n5 != X4 )
& ( n5 != X4
| n4 != X5 )
& ( n5 != X5
| n4 != X4 )
& ( n5 != X4
| n3 != X5 )
& ( n5 != X5
| n3 != X4 )
& ( n5 != X4
| n2 != X5 )
& ( n5 != X5
| n2 != X4 )
& ( n5 != X5
| n1 != X4 )
& ( n5 != X5
| n0 != X4 )
& leq(X5,n5)
& leq(X4,n5)
& leq(n0,X5)
& leq(n0,X4) )
& ! [X0,X1] :
( a_select3(r_ds1_filter,X0,X1) = a_select3(r_ds1_filter,X1,X0)
| ~ leq(X1,n2)
| ~ leq(X0,n2)
| ~ leq(n0,X1)
| ~ leq(n0,X0) )
& ! [X2,X3] :
( a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2)
| ~ leq(X3,n5)
| ~ leq(X2,n5)
| ~ leq(n0,X3)
| ~ leq(n0,X2) ) ),
inference(flattening,[],[f88]) ).
fof(f88,plain,
( ? [X4,X5] :
( n0 != a_select2(xinit_noise,n4)
& n5 = X4
& n4 = X5
& n4 = X4
& n1 = X5
& ( n5 != X5
| n5 != X4 )
& ( n5 != X4
| n4 != X5 )
& ( n5 != X5
| n4 != X4 )
& ( n5 != X4
| n3 != X5 )
& ( n5 != X5
| n3 != X4 )
& ( n5 != X4
| n2 != X5 )
& ( n5 != X5
| n2 != X4 )
& ( n5 != X5
| n1 != X4 )
& ( n5 != X5
| n0 != X4 )
& leq(X5,n5)
& leq(X4,n5)
& leq(n0,X5)
& leq(n0,X4) )
& ! [X0,X1] :
( a_select3(r_ds1_filter,X0,X1) = a_select3(r_ds1_filter,X1,X0)
| ~ leq(X1,n2)
| ~ leq(X0,n2)
| ~ leq(n0,X1)
| ~ leq(n0,X0) )
& ! [X2,X3] :
( a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2)
| ~ leq(X3,n5)
| ~ leq(X2,n5)
| ~ leq(n0,X3)
| ~ leq(n0,X2) ) ),
inference(ennf_transformation,[],[f87]) ).
fof(f87,plain,
~ ( ( ! [X0,X1] :
( ( leq(X1,n2)
& leq(X0,n2)
& leq(n0,X1)
& leq(n0,X0) )
=> a_select3(r_ds1_filter,X0,X1) = a_select3(r_ds1_filter,X1,X0) )
& ! [X2,X3] :
( ( leq(X3,n5)
& leq(X2,n5)
& leq(n0,X3)
& leq(n0,X2) )
=> a_select3(q_ds1_filter,X2,X3) = a_select3(q_ds1_filter,X3,X2) ) )
=> ! [X4,X5] :
( ( leq(X5,n5)
& leq(X4,n5)
& leq(n0,X5)
& leq(n0,X4) )
=> ( ( n5 = X4
& n4 = X5
& n4 = X4
& n1 = X5
& ~ ( n5 = X5
& n5 = X4 )
& ~ ( n5 = X4
& n4 = X5 )
& ~ ( n5 = X5
& n4 = X4 )
& ~ ( n5 = X4
& n3 = X5 )
& ~ ( n5 = X5
& n3 = X4 )
& ~ ( n5 = X4
& n2 = X5 )
& ~ ( n5 = X5
& n2 = X4 )
& ~ ( n5 = X5
& n1 = X4 )
& ~ ( n5 = X5
& n0 = X4 ) )
=> n0 = a_select2(xinit_noise,n4) ) ) ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( ! [X3,X19] :
( ( leq(X19,n2)
& leq(X3,n2)
& leq(n0,X19)
& leq(n0,X3) )
=> a_select3(r_ds1_filter,X3,X19) = a_select3(r_ds1_filter,X19,X3) )
& ! [X13,X17] :
( ( leq(X17,n5)
& leq(X13,n5)
& leq(n0,X17)
& leq(n0,X13) )
=> a_select3(q_ds1_filter,X13,X17) = a_select3(q_ds1_filter,X17,X13) ) )
=> ! [X20,X21] :
( ( leq(X21,n5)
& leq(X20,n5)
& leq(n0,X21)
& leq(n0,X20) )
=> ( ( n5 = X20
& n4 = X21
& n4 = X20
& n1 = X21
& ~ ( n5 = X21
& n5 = X20 )
& ~ ( n5 = X20
& n4 = X21 )
& ~ ( n5 = X21
& n4 = X20 )
& ~ ( n5 = X20
& n3 = X21 )
& ~ ( n5 = X21
& n3 = X20 )
& ~ ( n5 = X20
& n2 = X21 )
& ~ ( n5 = X21
& n2 = X20 )
& ~ ( n5 = X21
& n1 = X20 )
& ~ ( n5 = X21
& n0 = X20 ) )
=> n0 = a_select2(xinit_noise,n4) ) ) ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( ! [X3,X19] :
( ( leq(X19,n2)
& leq(X3,n2)
& leq(n0,X19)
& leq(n0,X3) )
=> a_select3(r_ds1_filter,X3,X19) = a_select3(r_ds1_filter,X19,X3) )
& ! [X13,X17] :
( ( leq(X17,n5)
& leq(X13,n5)
& leq(n0,X17)
& leq(n0,X13) )
=> a_select3(q_ds1_filter,X13,X17) = a_select3(q_ds1_filter,X17,X13) ) )
=> ! [X20,X21] :
( ( leq(X21,n5)
& leq(X20,n5)
& leq(n0,X21)
& leq(n0,X20) )
=> ( ( n5 = X20
& n4 = X21
& n4 = X20
& n1 = X21
& ~ ( n5 = X21
& n5 = X20 )
& ~ ( n5 = X20
& n4 = X21 )
& ~ ( n5 = X21
& n4 = X20 )
& ~ ( n5 = X20
& n3 = X21 )
& ~ ( n5 = X21
& n3 = X20 )
& ~ ( n5 = X20
& n2 = X21 )
& ~ ( n5 = X21
& n2 = X20 )
& ~ ( n5 = X21
& n1 = X20 )
& ~ ( n5 = X21
& n0 = X20 ) )
=> n0 = a_select2(xinit_noise,n4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_symm_0761) ).
fof(f126,plain,
n4 = sK1,
inference(cnf_transformation,[],[f89]) ).
fof(f112,plain,
( n4 != sK1
| n5 != sK0 ),
inference(cnf_transformation,[],[f89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV230+1 : TPTP v8.2.0. Bugfixed v3.3.0.
% 0.07/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.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 06:48:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 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/benchmark/theBenchmark.p
% 0.52/0.72 % (30684)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 theBenchmark for (2996ds/83Mi)
% 0.52/0.72 % (30678)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 theBenchmark for (2996ds/34Mi)
% 0.52/0.72 % (30680)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.52/0.72 % (30681)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.52/0.72 % (30679)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 theBenchmark for (2996ds/51Mi)
% 0.52/0.72 % (30684)First to succeed.
% 0.52/0.72 % (30684)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-30677"
% 0.52/0.72 % (30681)Also succeeded, but the first one will report.
% 0.52/0.72 % (30684)Refutation found. Thanks to Tanya!
% 0.52/0.72 % SZS status Theorem for theBenchmark
% 0.52/0.72 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.72 % (30684)------------------------------
% 0.52/0.72 % (30684)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.72 % (30684)Termination reason: Refutation
% 0.52/0.72
% 0.52/0.72 % (30684)Memory used [KB]: 1095
% 0.52/0.72 % (30684)Time elapsed: 0.003 s
% 0.52/0.72 % (30684)Instructions burned: 6 (million)
% 0.52/0.72 % (30677)Success in time 0.372 s
% 0.52/0.72 % Vampire---4.8 exiting
%------------------------------------------------------------------------------