TSTP Solution File: SWV997_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWV997_1 : TPTP v8.1.2. Released v5.0.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 : n016.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:14:19 EDT 2024
% Result : Theorem 0.55s 0.75s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 341 ( 234 equ)
% Maximal formula atoms : 54 ( 21 avg)
% Number of connectives : 514 ( 189 ~; 69 |; 252 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 387 ( 100 atm; 0 fun; 182 num; 105 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 2 prp; 0-2 aty)
% Number of functors : 15 ( 6 usr; 13 con; 0-1 aty)
% Number of variables : 105 ( 105 !; 0 ?; 105 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
z1: $int ).
tff(func_def_1,type,
z2: $int ).
tff(func_def_2,type,
z3: $int ).
tff(func_def_3,type,
z4: $int ).
tff(func_def_4,type,
a: $int > $int ).
tff(func_def_5,type,
b: $int > $int ).
tff(f194,plain,
$false,
inference(unit_resulting_resolution,[],[f40,f29,f32,f38,f36,f30,f35,f39,f20]) ).
tff(f20,plain,
! [X3: $int,X4: $int,X5: $int] :
( ( 5 != b(X5) )
| ( X3 = X5 )
| ( X4 = X5 )
| ( 6 != a(X3) )
| ( 10 != a(X4) )
| ~ $less(b(X4),3)
| ( X3 = X4 )
| ~ $less(X4,X3) ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
( $less(z2,z1)
& ( 5 = b(z3) )
& $less(b(z2),3)
& ( 1 = a(z3) )
& ( 10 = a(z2) )
& ( 6 = a(z1) )
& ! [X0: $int,X1: $int,X2: $int] :
( ~ $less(X1,X0)
| ~ $less(b(X1),3)
| ( 8 != a(X2) )
| ( 10 != a(X1) )
| ( a(X0) != 7 )
| ( X1 = X2 )
| ( X0 = X2 )
| ( X0 = X1 ) )
& ! [X3: $int,X4: $int,X5: $int] :
( ~ $less(X4,X3)
| ( 5 != b(X5) )
| ~ $less(b(X4),3)
| ( 10 != a(X4) )
| ( 6 != a(X3) )
| ( X4 = X5 )
| ( X3 = X5 )
| ( X3 = X4 ) )
& ! [X6: $int,X7: $int,X8: $int] :
( ~ $less(X7,X6)
| ( 5 != b(X8) )
| ~ $less(b(X7),3)
| ( 10 != a(X7) )
| ( 7 != a(X6) )
| ( X7 = X8 )
| ( X6 = X8 )
| ( X6 = X7 ) )
& ! [X9: $int,X10: $int] :
( ~ $less(X10,X9)
| ~ $less(b(X10),3)
| ( 10 != a(X10) )
| ( 8 != a(X9) )
| ( X9 = X10 ) )
& ! [X11: $int,X12: $int] :
( ~ $less(X12,X11)
| ~ $less(b(X12),3)
| ( 10 != a(X12) )
| ( 9 != a(X11) )
| ( X11 = X12 ) )
& ! [X13: $int,X14: $int] :
( ( 10 != a(X14) )
| ( 10 != a(X13) )
| ( X13 = X14 ) )
& ( z3 != z4 )
& ( z2 != z4 )
& ( z2 != z3 )
& ( z1 != z4 )
& ( z1 != z3 )
& ( z1 != z2 )
& $true
& ! [X15: $int] :
( ~ $less(5,b(X15))
& ~ $less(b(X15),1) )
& ! [X16: $int] :
( ~ $less(12,a(X16))
& ~ $less(a(X16),1) ) ),
inference(flattening,[],[f17]) ).
tff(f17,plain,
( $less(z2,z1)
& ( 5 = b(z3) )
& $less(b(z2),3)
& ( 1 = a(z3) )
& ( 10 = a(z2) )
& ( 6 = a(z1) )
& ! [X0: $int,X1: $int,X2: $int] :
( ~ $less(X1,X0)
| ~ $less(b(X1),3)
| ( 8 != a(X2) )
| ( 10 != a(X1) )
| ( a(X0) != 7 )
| ( X1 = X2 )
| ( X0 = X2 )
| ( X0 = X1 ) )
& ! [X3: $int,X4: $int,X5: $int] :
( ~ $less(X4,X3)
| ( 5 != b(X5) )
| ~ $less(b(X4),3)
| ( 10 != a(X4) )
| ( 6 != a(X3) )
| ( X4 = X5 )
| ( X3 = X5 )
| ( X3 = X4 ) )
& ! [X6: $int,X7: $int,X8: $int] :
( ~ $less(X7,X6)
| ( 5 != b(X8) )
| ~ $less(b(X7),3)
| ( 10 != a(X7) )
| ( 7 != a(X6) )
| ( X7 = X8 )
| ( X6 = X8 )
| ( X6 = X7 ) )
& ! [X9: $int,X10: $int] :
( ~ $less(X10,X9)
| ~ $less(b(X10),3)
| ( 10 != a(X10) )
| ( 8 != a(X9) )
| ( X9 = X10 ) )
& ! [X11: $int,X12: $int] :
( ~ $less(X12,X11)
| ~ $less(b(X12),3)
| ( 10 != a(X12) )
| ( 9 != a(X11) )
| ( X11 = X12 ) )
& ! [X13: $int,X14: $int] :
( ( 10 != a(X14) )
| ( 10 != a(X13) )
| ( X13 = X14 ) )
& ( z3 != z4 )
& ( z2 != z4 )
& ( z2 != z3 )
& ( z1 != z4 )
& ( z1 != z3 )
& ( z1 != z2 )
& $true
& ! [X15: $int] :
( ~ $less(5,b(X15))
& ~ $less(b(X15),1) )
& ! [X16: $int] :
( ~ $less(12,a(X16))
& ~ $less(a(X16),1) ) ),
inference(ennf_transformation,[],[f16]) ).
tff(f16,plain,
~ ( ( ! [X0: $int,X1: $int,X2: $int] :
~ ( $less(X1,X0)
& $less(b(X1),3)
& ( 8 = a(X2) )
& ( 10 = a(X1) )
& ( a(X0) = 7 )
& ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) )
& ! [X3: $int,X4: $int,X5: $int] :
~ ( $less(X4,X3)
& ( 5 = b(X5) )
& $less(b(X4),3)
& ( 10 = a(X4) )
& ( 6 = a(X3) )
& ( X4 != X5 )
& ( X3 != X5 )
& ( X3 != X4 ) )
& ! [X6: $int,X7: $int,X8: $int] :
~ ( $less(X7,X6)
& ( 5 = b(X8) )
& $less(b(X7),3)
& ( 10 = a(X7) )
& ( 7 = a(X6) )
& ( X7 != X8 )
& ( X6 != X8 )
& ( X6 != X7 ) )
& ! [X9: $int,X10: $int] :
~ ( $less(X10,X9)
& $less(b(X10),3)
& ( 10 = a(X10) )
& ( 8 = a(X9) )
& ( X9 != X10 ) )
& ! [X11: $int,X12: $int] :
~ ( $less(X12,X11)
& $less(b(X12),3)
& ( 10 = a(X12) )
& ( 9 = a(X11) )
& ( X11 != X12 ) )
& ! [X13: $int,X14: $int] :
~ ( ( 10 = a(X14) )
& ( 10 = a(X13) )
& ( X13 != X14 ) )
& ( z3 != z4 )
& ( z2 != z4 )
& ( z2 != z3 )
& ( z1 != z4 )
& ( z1 != z3 )
& ( z1 != z2 )
& $true
& ! [X15: $int] :
( ~ $less(5,b(X15))
& ~ $less(b(X15),1) )
& ! [X16: $int] :
( ~ $less(12,a(X16))
& ~ $less(a(X16),1) ) )
=> ~ ( $less(z2,z1)
& ( 5 = b(z3) )
& $less(b(z2),3)
& ( 1 = a(z3) )
& ( 10 = a(z2) )
& ( 6 = a(z1) ) ) ),
inference(rectify,[],[f3]) ).
tff(f3,plain,
~ ( ( ! [X0: $int,X1: $int,X2: $int] :
~ ( $less(X1,X0)
& $less(b(X1),3)
& ( 8 = a(X2) )
& ( 10 = a(X1) )
& ( a(X0) = 7 )
& ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int,X2: $int] :
~ ( $less(X1,X0)
& ( 5 = b(X2) )
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 6 )
& ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int,X2: $int] :
~ ( $less(X1,X0)
& ( 5 = b(X2) )
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 7 )
& ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int] :
~ ( $less(X1,X0)
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 8 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int] :
~ ( $less(X1,X0)
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 9 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int] :
~ ( ( 10 = a(X1) )
& ( a(X0) = 10 )
& ( X0 != X1 ) )
& ( z3 != z4 )
& ( z2 != z4 )
& ( z2 != z3 )
& ( z1 != z4 )
& ( z1 != z3 )
& ( z1 != z2 )
& $true
& ! [X0: $int] :
( ~ $less(5,b(X0))
& ~ $less(b(X0),1) )
& ! [X0: $int] :
( ~ $less(12,a(X0))
& ~ $less(a(X0),1) ) )
=> ~ ( $less(z2,z1)
& ( 5 = b(z3) )
& $less(b(z2),3)
& ( 1 = a(z3) )
& ( 10 = a(z2) )
& ( 6 = a(z1) ) ) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ( ! [X0: $int,X1: $int,X2: $int] :
~ ( $less(X1,X0)
& $less(b(X1),3)
& ( 8 = a(X2) )
& ( 10 = a(X1) )
& ( a(X0) = 7 )
& ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int,X2: $int] :
~ ( $less(X1,X0)
& ( 5 = b(X2) )
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 6 )
& ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int,X2: $int] :
~ ( $less(X1,X0)
& ( 5 = b(X2) )
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 7 )
& ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int] :
~ ( $less(X1,X0)
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 8 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int] :
~ ( $less(X1,X0)
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 9 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int] :
~ ( ( 10 = a(X1) )
& ( a(X0) = 10 )
& ( X0 != X1 ) )
& ( z3 != z4 )
& ( z2 != z4 )
& ( z2 != z3 )
& ( z1 != z4 )
& ( z1 != z3 )
& ( z1 != z2 )
& $true
& ! [X0: $int] :
( $lesseq(b(X0),5)
& $lesseq(1,b(X0)) )
& ! [X0: $int] :
( $lesseq(a(X0),12)
& $lesseq(1,a(X0)) ) )
=> ~ ( $less(z2,z1)
& ( 5 = b(z3) )
& $less(b(z2),3)
& ( 1 = a(z3) )
& ( 10 = a(z2) )
& ( 6 = a(z1) ) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ( ! [X0: $int,X1: $int,X2: $int] :
~ ( $less(X1,X0)
& $less(b(X1),3)
& ( 8 = a(X2) )
& ( 10 = a(X1) )
& ( a(X0) = 7 )
& ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int,X2: $int] :
~ ( $less(X1,X0)
& ( 5 = b(X2) )
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 6 )
& ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int,X2: $int] :
~ ( $less(X1,X0)
& ( 5 = b(X2) )
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 7 )
& ( X1 != X2 )
& ( X0 != X2 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int] :
~ ( $less(X1,X0)
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 8 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int] :
~ ( $less(X1,X0)
& $less(b(X1),3)
& ( 10 = a(X1) )
& ( a(X0) = 9 )
& ( X0 != X1 ) )
& ! [X0: $int,X1: $int] :
~ ( ( 10 = a(X1) )
& ( a(X0) = 10 )
& ( X0 != X1 ) )
& ( z3 != z4 )
& ( z2 != z4 )
& ( z2 != z3 )
& ( z1 != z4 )
& ( z1 != z3 )
& ( z1 != z2 )
& $true
& ! [X0: $int] :
( $lesseq(b(X0),5)
& $lesseq(1,b(X0)) )
& ! [X0: $int] :
( $lesseq(a(X0),12)
& $lesseq(1,a(X0)) ) )
=> ~ ( $less(z2,z1)
& ( 5 = b(z3) )
& $less(b(z2),3)
& ( 1 = a(z3) )
& ( 10 = a(z2) )
& ( 6 = a(z1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.56ou2m77TU/Vampire---4.8_19419',0) ).
tff(f39,plain,
5 = b(z3),
inference(cnf_transformation,[],[f18]) ).
tff(f35,plain,
6 = a(z1),
inference(cnf_transformation,[],[f18]) ).
tff(f30,plain,
z1 != z3,
inference(cnf_transformation,[],[f18]) ).
tff(f36,plain,
10 = a(z2),
inference(cnf_transformation,[],[f18]) ).
tff(f38,plain,
$less(b(z2),3),
inference(cnf_transformation,[],[f18]) ).
tff(f32,plain,
z2 != z3,
inference(cnf_transformation,[],[f18]) ).
tff(f29,plain,
z1 != z2,
inference(cnf_transformation,[],[f18]) ).
tff(f40,plain,
$less(z2,z1),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV997_1 : TPTP v8.1.2. Released v5.0.0.
% 0.07/0.15 % 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.15/0.36 % Computer : n016.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 19:08:26 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF0_THM_EQU_ARI problem
% 0.15/0.36 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.56ou2m77TU/Vampire---4.8_19419
% 0.55/0.75 % (19680)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.55/0.75 % (19674)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.55/0.75 % (19676)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.55/0.75 % (19675)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.55/0.75 % (19677)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.55/0.75 % (19678)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.55/0.75 % (19679)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.55/0.75 % (19680)First to succeed.
% 0.55/0.75 % (19680)Refutation found. Thanks to Tanya!
% 0.55/0.75 % SZS status Theorem for Vampire---4
% 0.55/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.75 % (19680)------------------------------
% 0.55/0.75 % (19680)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.75 % (19680)Termination reason: Refutation
% 0.55/0.75
% 0.55/0.75 % (19680)Memory used [KB]: 1071
% 0.55/0.75 % (19680)Time elapsed: 0.006 s
% 0.55/0.75 % (19680)Instructions burned: 15 (million)
% 0.55/0.75 % (19680)------------------------------
% 0.55/0.75 % (19680)------------------------------
% 0.55/0.75 % (19670)Success in time 0.376 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------