TSTP Solution File: ANA140_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ANA140_1 : TPTP v8.2.0. Released v8.2.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 : n020.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:40:43 EDT 2024
% Result : Theorem 0.55s 0.73s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 133 ( 10 equ)
% Maximal formula atoms : 22 ( 6 avg)
% Number of connectives : 182 ( 70 ~; 40 |; 52 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 421 ( 122 atm; 198 fun; 74 num; 27 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 3 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 16 !; 11 ?; 28 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_0,type,
a: $real ).
tff(func_def_6,type,
sK0: $real ).
tff(func_def_7,type,
sK1: $real > $real ).
tff(pred_def_3,type,
sQ2_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f50,plain,
$false,
inference(subsumption_resolution,[],[f47,f46]) ).
tff(f46,plain,
~ $less($sum(sK1(sK0),$uminus(a)),sK0),
inference(subsumption_resolution,[],[f44,f20]) ).
tff(f20,plain,
$less(0.0,sK0),
inference(cnf_transformation,[],[f19]) ).
tff(f19,plain,
( ! [X1: $real] :
( ( ( ( ~ $less($uminus($sum(sK1(X1),$uminus(a))),sK0)
& $less($sum(sK1(X1),$uminus(a)),0.0) )
| ( ~ $less($sum(sK1(X1),$uminus(a)),sK0)
& ~ $less($sum(sK1(X1),$uminus(a)),0.0) ) )
& ( $less($uminus($sum(sK1(X1),$uminus(a))),X1)
| ~ $less($sum(sK1(X1),$uminus(a)),0.0) )
& ( $less($sum(sK1(X1),$uminus(a)),X1)
| $less($sum(sK1(X1),$uminus(a)),0.0) )
& ( a != sK1(X1) ) )
| ~ $less(0.0,X1) )
& $less(0.0,sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f16,f18,f17]) ).
tff(f17,plain,
( ? [X0: $real] :
( ! [X1: $real] :
( ? [X2: $real] :
( ( ( ~ $less($uminus($sum(X2,$uminus(a))),X0)
& $less($sum(X2,$uminus(a)),0.0) )
| ( ~ $less($sum(X2,$uminus(a)),X0)
& ~ $less($sum(X2,$uminus(a)),0.0) ) )
& ( $less($uminus($sum(X2,$uminus(a))),X1)
| ~ $less($sum(X2,$uminus(a)),0.0) )
& ( $less($sum(X2,$uminus(a)),X1)
| $less($sum(X2,$uminus(a)),0.0) )
& ( a != X2 ) )
| ~ $less(0.0,X1) )
& $less(0.0,X0) )
=> ( ! [X1: $real] :
( ? [X2: $real] :
( ( ( ~ $less($uminus($sum(X2,$uminus(a))),sK0)
& $less($sum(X2,$uminus(a)),0.0) )
| ( ~ $less($sum(X2,$uminus(a)),sK0)
& ~ $less($sum(X2,$uminus(a)),0.0) ) )
& ( $less($uminus($sum(X2,$uminus(a))),X1)
| ~ $less($sum(X2,$uminus(a)),0.0) )
& ( $less($sum(X2,$uminus(a)),X1)
| $less($sum(X2,$uminus(a)),0.0) )
& ( a != X2 ) )
| ~ $less(0.0,X1) )
& $less(0.0,sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f18,plain,
! [X1: $real] :
( ? [X2: $real] :
( ( ( ~ $less($uminus($sum(X2,$uminus(a))),sK0)
& $less($sum(X2,$uminus(a)),0.0) )
| ( ~ $less($sum(X2,$uminus(a)),sK0)
& ~ $less($sum(X2,$uminus(a)),0.0) ) )
& ( $less($uminus($sum(X2,$uminus(a))),X1)
| ~ $less($sum(X2,$uminus(a)),0.0) )
& ( $less($sum(X2,$uminus(a)),X1)
| $less($sum(X2,$uminus(a)),0.0) )
& ( a != X2 ) )
=> ( ( ( ~ $less($uminus($sum(sK1(X1),$uminus(a))),sK0)
& $less($sum(sK1(X1),$uminus(a)),0.0) )
| ( ~ $less($sum(sK1(X1),$uminus(a)),sK0)
& ~ $less($sum(sK1(X1),$uminus(a)),0.0) ) )
& ( $less($uminus($sum(sK1(X1),$uminus(a))),X1)
| ~ $less($sum(sK1(X1),$uminus(a)),0.0) )
& ( $less($sum(sK1(X1),$uminus(a)),X1)
| $less($sum(sK1(X1),$uminus(a)),0.0) )
& ( a != sK1(X1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f16,plain,
? [X0: $real] :
( ! [X1: $real] :
( ? [X2: $real] :
( ( ( ~ $less($uminus($sum(X2,$uminus(a))),X0)
& $less($sum(X2,$uminus(a)),0.0) )
| ( ~ $less($sum(X2,$uminus(a)),X0)
& ~ $less($sum(X2,$uminus(a)),0.0) ) )
& ( $less($uminus($sum(X2,$uminus(a))),X1)
| ~ $less($sum(X2,$uminus(a)),0.0) )
& ( $less($sum(X2,$uminus(a)),X1)
| $less($sum(X2,$uminus(a)),0.0) )
& ( a != X2 ) )
| ~ $less(0.0,X1) )
& $less(0.0,X0) ),
inference(flattening,[],[f15]) ).
tff(f15,plain,
? [X0: $real] :
( ! [X1: $real] :
( ? [X2: $real] :
( ( ( ~ $less($uminus($sum(X2,$uminus(a))),X0)
& $less($sum(X2,$uminus(a)),0.0) )
| ( ~ $less($sum(X2,$uminus(a)),X0)
& ~ $less($sum(X2,$uminus(a)),0.0) ) )
& ( $less($uminus($sum(X2,$uminus(a))),X1)
| ~ $less($sum(X2,$uminus(a)),0.0) )
& ( $less($sum(X2,$uminus(a)),X1)
| $less($sum(X2,$uminus(a)),0.0) )
& ( a != X2 ) )
| ~ $less(0.0,X1) )
& $less(0.0,X0) ),
inference(ennf_transformation,[],[f3]) ).
tff(f3,plain,
~ ! [X0: $real] :
( $less(0.0,X0)
=> ? [X1: $real] :
( ! [X2: $real] :
( ( ( $less($sum(X2,$uminus(a)),0.0)
=> $less($uminus($sum(X2,$uminus(a))),X1) )
& ( ~ $less($sum(X2,$uminus(a)),0.0)
=> $less($sum(X2,$uminus(a)),X1) )
& ( a != X2 ) )
=> ( ( $less($sum(X2,$uminus(a)),0.0)
=> $less($uminus($sum(X2,$uminus(a))),X0) )
& ( ~ $less($sum(X2,$uminus(a)),0.0)
=> $less($sum(X2,$uminus(a)),X0) ) ) )
& $less(0.0,X1) ) ),
inference(theory_normalization,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: $real] :
( $less(0.0,X0)
=> ? [X1: $real] :
( ! [X2: $real] :
( ( ( ~ $greatereq($difference(X2,a),0.0)
=> $less($uminus($difference(X2,a)),X1) )
& ( $greatereq($difference(X2,a),0.0)
=> $less($difference(X2,a),X1) )
& ( a != X2 ) )
=> ( ( ~ $greatereq($difference(X2,a),0.0)
=> $less($uminus($difference(X2,a)),X0) )
& ( $greatereq($difference(X2,a),0.0)
=> $less($difference(X2,a),X0) ) ) )
& $less(0.0,X1) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X0: $real] :
( $less(0.0,X0)
=> ? [X1: $real] :
( ! [X2: $real] :
( ( ( ~ $greatereq($difference(X2,a),0.0)
=> $less($uminus($difference(X2,a)),X1) )
& ( $greatereq($difference(X2,a),0.0)
=> $less($difference(X2,a),X1) )
& ( a != X2 ) )
=> ( ( ~ $greatereq($difference(X2,a),0.0)
=> $less($uminus($difference(X2,a)),X0) )
& ( $greatereq($difference(X2,a),0.0)
=> $less($difference(X2,a),X0) ) ) )
& $less(0.0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_1) ).
tff(f44,plain,
( ~ $less($sum(sK1(sK0),$uminus(a)),sK0)
| ~ $less(0.0,sK0) ),
inference(resolution,[],[f43,f25]) ).
tff(f25,plain,
! [X1: $real] :
( $less($sum(sK1(X1),$uminus(a)),0.0)
| ~ $less($sum(sK1(X1),$uminus(a)),sK0)
| ~ $less(0.0,X1) ),
inference(cnf_transformation,[],[f19]) ).
tff(f43,plain,
~ $less($sum(sK1(sK0),$uminus(a)),0.0),
inference(subsumption_resolution,[],[f42,f20]) ).
tff(f42,plain,
( ~ $less($sum(sK1(sK0),$uminus(a)),0.0)
| ~ $less(0.0,sK0) ),
inference(duplicate_literal_removal,[],[f41]) ).
tff(f41,plain,
( ~ $less($sum(sK1(sK0),$uminus(a)),0.0)
| ~ $less(0.0,sK0)
| ~ $less($sum(sK1(sK0),$uminus(a)),0.0)
| ~ $less(0.0,sK0) ),
inference(resolution,[],[f26,f23]) ).
tff(f23,plain,
! [X1: $real] :
( $less($uminus($sum(sK1(X1),$uminus(a))),X1)
| ~ $less($sum(sK1(X1),$uminus(a)),0.0)
| ~ $less(0.0,X1) ),
inference(cnf_transformation,[],[f19]) ).
tff(f26,plain,
! [X1: $real] :
( ~ $less($uminus($sum(sK1(X1),$uminus(a))),sK0)
| ~ $less($sum(sK1(X1),$uminus(a)),0.0)
| ~ $less(0.0,X1) ),
inference(cnf_transformation,[],[f19]) ).
tff(f47,plain,
$less($sum(sK1(sK0),$uminus(a)),sK0),
inference(subsumption_resolution,[],[f45,f20]) ).
tff(f45,plain,
( $less($sum(sK1(sK0),$uminus(a)),sK0)
| ~ $less(0.0,sK0) ),
inference(resolution,[],[f43,f22]) ).
tff(f22,plain,
! [X1: $real] :
( $less($sum(sK1(X1),$uminus(a)),0.0)
| $less($sum(sK1(X1),$uminus(a)),X1)
| ~ $less(0.0,X1) ),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ANA140_1 : TPTP v8.2.0. Released v8.2.0.
% 0.13/0.13 % 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.13/0.34 % Computer : n020.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 : Mon May 20 07:54:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TF0_THM_EQU_ARI problem
% 0.13/0.34 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/benchmark/theBenchmark.p
% 0.55/0.73 % (12671)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.55/0.73 % (12665)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.55/0.73 % (12667)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.73 % (12669)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 (2996ds/34Mi)
% 0.55/0.73 % (12668)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.55/0.73 % (12666)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.55/0.73 % (12670)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.73 % (12665)First to succeed.
% 0.55/0.73 % (12667)Also succeeded, but the first one will report.
% 0.55/0.73 % (12666)Also succeeded, but the first one will report.
% 0.55/0.73 % (12669)Also succeeded, but the first one will report.
% 0.55/0.73 % (12665)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-12663"
% 0.55/0.73 % (12665)Refutation found. Thanks to Tanya!
% 0.55/0.73 % SZS status Theorem for theBenchmark
% 0.55/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.73 % (12665)------------------------------
% 0.55/0.73 % (12665)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.73 % (12665)Termination reason: Refutation
% 0.55/0.73
% 0.55/0.73 % (12665)Memory used [KB]: 967
% 0.55/0.73 % (12665)Time elapsed: 0.004 s
% 0.55/0.73 % (12665)Instructions burned: 5 (million)
% 0.55/0.73 % (12663)Success in time 0.38 s
% 0.55/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------