TSTP Solution File: SWV121+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV121+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n032.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:09 EDT 2024
% Result : Theorem 0.38s 0.60s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 4 unt; 0 def)
% Number of atoms : 84 ( 15 equ)
% Maximal formula atoms : 16 ( 9 avg)
% Number of connectives : 104 ( 29 ~; 24 |; 39 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 30 ( 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f220,plain,
$false,
inference(subsumption_resolution,[],[f129,f135]) ).
fof(f135,plain,
true,
inference(cnf_transformation,[],[f51]) ).
fof(f51,axiom,
true,
file('/export/starexec/sandbox/tmp/tmp.Se1WORxeJM/Vampire---4.8_28381',ttrue) ).
fof(f129,plain,
~ true,
inference(cnf_transformation,[],[f98]) ).
fof(f98,plain,
( ~ true
& ! [X0,X1] :
( a_select3(pminus_ds1_filter,X0,X1) = a_select3(pminus_ds1_filter,X1,X0)
| ~ leq(X1,minus(n6,n1))
| ~ leq(X0,minus(n6,n1))
| ~ leq(n0,X1)
| ~ leq(n0,X0) )
& ! [X2,X3] :
( a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2)
| ~ leq(X3,minus(n3,n1))
| ~ leq(X2,minus(n3,n1))
| ~ leq(n0,X3)
| ~ leq(n0,X2) )
& ! [X4,X5] :
( a_select3(q_ds1_filter,X4,X5) = a_select3(q_ds1_filter,X5,X4)
| ~ leq(X5,minus(n6,n1))
| ~ leq(X4,minus(n6,n1))
| ~ leq(n0,X5)
| ~ leq(n0,X4) ) ),
inference(flattening,[],[f97]) ).
fof(f97,plain,
( ~ true
& ! [X0,X1] :
( a_select3(pminus_ds1_filter,X0,X1) = a_select3(pminus_ds1_filter,X1,X0)
| ~ leq(X1,minus(n6,n1))
| ~ leq(X0,minus(n6,n1))
| ~ leq(n0,X1)
| ~ leq(n0,X0) )
& ! [X2,X3] :
( a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2)
| ~ leq(X3,minus(n3,n1))
| ~ leq(X2,minus(n3,n1))
| ~ leq(n0,X3)
| ~ leq(n0,X2) )
& ! [X4,X5] :
( a_select3(q_ds1_filter,X4,X5) = a_select3(q_ds1_filter,X5,X4)
| ~ leq(X5,minus(n6,n1))
| ~ leq(X4,minus(n6,n1))
| ~ leq(n0,X5)
| ~ leq(n0,X4) ) ),
inference(ennf_transformation,[],[f96]) ).
fof(f96,plain,
~ ( ( ! [X0,X1] :
( ( leq(X1,minus(n6,n1))
& leq(X0,minus(n6,n1))
& leq(n0,X1)
& leq(n0,X0) )
=> a_select3(pminus_ds1_filter,X0,X1) = a_select3(pminus_ds1_filter,X1,X0) )
& ! [X2,X3] :
( ( leq(X3,minus(n3,n1))
& leq(X2,minus(n3,n1))
& leq(n0,X3)
& leq(n0,X2) )
=> a_select3(r_ds1_filter,X2,X3) = a_select3(r_ds1_filter,X3,X2) )
& ! [X4,X5] :
( ( leq(X5,minus(n6,n1))
& leq(X4,minus(n6,n1))
& leq(n0,X5)
& leq(n0,X4) )
=> a_select3(q_ds1_filter,X4,X5) = a_select3(q_ds1_filter,X5,X4) ) )
=> true ),
inference(rectify,[],[f54]) ).
fof(f54,negated_conjecture,
~ ( ( ! [X20,X21] :
( ( leq(X21,minus(n6,n1))
& leq(X20,minus(n6,n1))
& leq(n0,X21)
& leq(n0,X20) )
=> a_select3(pminus_ds1_filter,X20,X21) = a_select3(pminus_ds1_filter,X21,X20) )
& ! [X3,X19] :
( ( leq(X19,minus(n3,n1))
& leq(X3,minus(n3,n1))
& leq(n0,X19)
& leq(n0,X3) )
=> a_select3(r_ds1_filter,X3,X19) = a_select3(r_ds1_filter,X19,X3) )
& ! [X13,X17] :
( ( leq(X17,minus(n6,n1))
& leq(X13,minus(n6,n1))
& leq(n0,X17)
& leq(n0,X13) )
=> a_select3(q_ds1_filter,X13,X17) = a_select3(q_ds1_filter,X17,X13) ) )
=> true ),
inference(negated_conjecture,[],[f53]) ).
fof(f53,conjecture,
( ( ! [X20,X21] :
( ( leq(X21,minus(n6,n1))
& leq(X20,minus(n6,n1))
& leq(n0,X21)
& leq(n0,X20) )
=> a_select3(pminus_ds1_filter,X20,X21) = a_select3(pminus_ds1_filter,X21,X20) )
& ! [X3,X19] :
( ( leq(X19,minus(n3,n1))
& leq(X3,minus(n3,n1))
& leq(n0,X19)
& leq(n0,X3) )
=> a_select3(r_ds1_filter,X3,X19) = a_select3(r_ds1_filter,X19,X3) )
& ! [X13,X17] :
( ( leq(X17,minus(n6,n1))
& leq(X13,minus(n6,n1))
& leq(n0,X17)
& leq(n0,X13) )
=> a_select3(q_ds1_filter,X13,X17) = a_select3(q_ds1_filter,X17,X13) ) )
=> true ),
file('/export/starexec/sandbox/tmp/tmp.Se1WORxeJM/Vampire---4.8_28381',quaternion_ds1_symm_0014) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.08 % Problem : SWV121+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.10 % 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.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Fri May 3 20:56:52 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.09/0.29 This is a FOF_THM_RFO_SEQ problem
% 0.09/0.29 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.Se1WORxeJM/Vampire---4.8_28381
% 0.38/0.59 % (28696)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.38/0.59 % (28692)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.38/0.59 % (28690)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.38/0.59 % (28693)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.38/0.60 % (28694)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.38/0.60 % (28688)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.38/0.60 % (28689)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.38/0.60 % (28696)First to succeed.
% 0.38/0.60 % (28691)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.38/0.60 % (28696)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28622"
% 0.38/0.60 % (28690)Also succeeded, but the first one will report.
% 0.38/0.60 % (28696)Refutation found. Thanks to Tanya!
% 0.38/0.60 % SZS status Theorem for Vampire---4
% 0.38/0.60 % SZS output start Proof for Vampire---4
% See solution above
% 0.38/0.60 % (28696)------------------------------
% 0.38/0.60 % (28696)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.38/0.60 % (28696)Termination reason: Refutation
% 0.38/0.60
% 0.38/0.60 % (28696)Memory used [KB]: 1088
% 0.38/0.60 % (28696)Time elapsed: 0.002 s
% 0.38/0.60 % (28696)Instructions burned: 5 (million)
% 0.38/0.60 % (28622)Success in time 0.302 s
% 0.38/0.60 % Vampire---4.8 exiting
%------------------------------------------------------------------------------