TSTP Solution File: ARI618_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI618_1 : TPTP v8.2.0. Released v5.1.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 : n022.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 : Mon May 20 18:48:15 EDT 2024
% Result : Theorem 0.71s 0.88s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of formulae : 29 ( 8 unt; 2 typ; 0 def)
% Number of atoms : 71 ( 20 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 92 ( 48 ~; 22 |; 17 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 102 ( 50 atm; 22 fun; 0 num; 30 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 30 ( 27 !; 3 ?; 30 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
f: $int > $int ).
tff(func_def_5,type,
sK0: $int ).
tff(f276,plain,
$false,
inference(subsumption_resolution,[],[f264,f259]) ).
tff(f259,plain,
sK0 = f(sK0),
inference(resolution,[],[f258,f25]) ).
tff(f25,plain,
! [X0: $int] :
( $less(X0,f(X0))
| ( f(X0) = X0 ) ),
inference(resolution,[],[f21,f11]) ).
tff(f11,plain,
! [X0: $int,X1: $int] :
( $less(X1,X0)
| $less(X0,X1)
| ( X0 = X1 ) ),
introduced(theory_axiom_144,[]) ).
tff(f21,plain,
! [X1: $int] : ~ $less(f(X1),X1),
inference(cnf_transformation,[],[f20]) ).
tff(f20,plain,
( ( f(sK0) != f(f(sK0)) )
& ! [X1: $int] :
( ( ~ $less($uminus(X1),f(X1))
| ~ $less(X1,f(X1)) )
& ~ $less(f(X1),$uminus(X1))
& ~ $less(f(X1),X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f18,f19]) ).
tff(f19,plain,
( ? [X0: $int] : ( f(X0) != f(f(X0)) )
=> ( f(sK0) != f(f(sK0)) ) ),
introduced(choice_axiom,[]) ).
tff(f18,plain,
( ? [X0: $int] : ( f(X0) != f(f(X0)) )
& ! [X1: $int] :
( ( ~ $less($uminus(X1),f(X1))
| ~ $less(X1,f(X1)) )
& ~ $less(f(X1),$uminus(X1))
& ~ $less(f(X1),X1) ) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
( ? [X1: $int] : ( f(X1) != f(f(X1)) )
& ! [X0: $int] :
( ( ~ $less($uminus(X0),f(X0))
| ~ $less(X0,f(X0)) )
& ~ $less(f(X0),$uminus(X0))
& ~ $less(f(X0),X0) ) ),
inference(ennf_transformation,[],[f16]) ).
tff(f16,plain,
~ ( ! [X0: $int] :
( ( ~ $less($uminus(X0),f(X0))
| ~ $less(X0,f(X0)) )
& ~ $less(f(X0),$uminus(X0))
& ~ $less(f(X0),X0) )
=> ! [X1: $int] : ( f(X1) = f(f(X1)) ) ),
inference(rectify,[],[f3]) ).
tff(f3,plain,
~ ( ! [X0: $int] :
( ( ~ $less($uminus(X0),f(X0))
| ~ $less(X0,f(X0)) )
& ~ $less(f(X0),$uminus(X0))
& ~ $less(f(X0),X0) )
=> ! [X0: $int] : ( f(X0) = f(f(X0)) ) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ( ! [X0: $int] :
( ( $lesseq(f(X0),$uminus(X0))
| $lesseq(f(X0),X0) )
& $lesseq($uminus(X0),f(X0))
& $lesseq(X0,f(X0)) )
=> ! [X0: $int] : ( f(X0) = f(f(X0)) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
( ! [X0: $int] :
( ( $lesseq(f(X0),$uminus(X0))
| $lesseq(f(X0),X0) )
& $lesseq($uminus(X0),f(X0))
& $lesseq(X0,f(X0)) )
=> ! [X0: $int] : ( f(X0) = f(f(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absolute_value_idempotent) ).
tff(f258,plain,
~ $less(sK0,f(sK0)),
inference(trivial_inequality_removal,[],[f245]) ).
tff(f245,plain,
( ( f(sK0) != f(sK0) )
| ~ $less(sK0,f(sK0)) ),
inference(superposition,[],[f24,f184]) ).
tff(f184,plain,
! [X0: $int] :
( ( f(X0) = f(f(X0)) )
| ~ $less(X0,f(X0)) ),
inference(resolution,[],[f68,f25]) ).
tff(f68,plain,
! [X0: $int] :
( ~ $less(f(X0),f(f(X0)))
| ~ $less(X0,f(X0)) ),
inference(subsumption_resolution,[],[f63,f10]) ).
tff(f10,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(theory_axiom_143,[]) ).
tff(f63,plain,
! [X0: $int] :
( ~ $less(X0,f(f(X0)))
| ~ $less(f(X0),f(f(X0)))
| ~ $less(X0,f(X0)) ),
inference(superposition,[],[f23,f58]) ).
tff(f58,plain,
! [X0: $int] :
( ( $uminus(f(X0)) = X0 )
| ~ $less(X0,f(X0)) ),
inference(superposition,[],[f14,f50]) ).
tff(f50,plain,
! [X0: $int] :
( ( f(X0) = $uminus(X0) )
| ~ $less(X0,f(X0)) ),
inference(subsumption_resolution,[],[f46,f22]) ).
tff(f22,plain,
! [X1: $int] : ~ $less(f(X1),$uminus(X1)),
inference(cnf_transformation,[],[f20]) ).
tff(f46,plain,
! [X0: $int] :
( ~ $less(X0,f(X0))
| $less(f(X0),$uminus(X0))
| ( f(X0) = $uminus(X0) ) ),
inference(resolution,[],[f23,f11]) ).
tff(f14,plain,
! [X0: $int] : ( $uminus($uminus(X0)) = X0 ),
introduced(theory_axiom_148,[]) ).
tff(f23,plain,
! [X1: $int] :
( ~ $less($uminus(X1),f(X1))
| ~ $less(X1,f(X1)) ),
inference(cnf_transformation,[],[f20]) ).
tff(f24,plain,
f(sK0) != f(f(sK0)),
inference(cnf_transformation,[],[f20]) ).
tff(f264,plain,
sK0 != f(sK0),
inference(superposition,[],[f24,f259]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI618_1 : TPTP v8.2.0. Released v5.1.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.15/0.37 % Computer : n022.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 12:55:23 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TF0_THM_EQU_ARI problem
% 0.15/0.37 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.71/0.87 % (32126)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 (2995ds/34Mi)
% 0.71/0.87 % (32128)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.71/0.87 % (32127)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 (2995ds/51Mi)
% 0.71/0.87 % (32129)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.71/0.87 % (32130)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 theBenchmark for (2995ds/34Mi)
% 0.71/0.87 % (32131)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.71/0.87 % (32133)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.71/0.87 % (32132)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 (2995ds/83Mi)
% 0.71/0.87 % (32129)Refutation not found, incomplete strategy% (32129)------------------------------
% 0.71/0.87 % (32129)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.87 % (32129)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.87
% 0.71/0.87 % (32129)Memory used [KB]: 981
% 0.71/0.87 % (32129)Time elapsed: 0.004 s
% 0.71/0.87 % (32129)Instructions burned: 4 (million)
% 0.71/0.87 % (32129)------------------------------
% 0.71/0.87 % (32129)------------------------------
% 0.71/0.88 % (32134)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2995ds/55Mi)
% 0.71/0.88 % (32131)First to succeed.
% 0.71/0.88 % (32131)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32125"
% 0.71/0.88 % (32131)Refutation found. Thanks to Tanya!
% 0.71/0.88 % SZS status Theorem for theBenchmark
% 0.71/0.88 % SZS output start Proof for theBenchmark
% See solution above
% 0.71/0.88 % (32131)------------------------------
% 0.71/0.88 % (32131)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.88 % (32131)Termination reason: Refutation
% 0.71/0.88
% 0.71/0.88 % (32131)Memory used [KB]: 1068
% 0.71/0.88 % (32131)Time elapsed: 0.011 s
% 0.71/0.88 % (32131)Instructions burned: 16 (million)
% 0.71/0.88 % (32125)Success in time 0.505 s
% 0.71/0.88 % Vampire---4.8 exiting
%------------------------------------------------------------------------------