TSTP Solution File: ARI592_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI592_1 : TPTP v8.1.2. 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/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 : Sun May 5 04:34:08 EDT 2024
% Result : Theorem 0.54s 0.74s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 34 ( 11 unt; 2 typ; 0 def)
% Number of atoms : 70 ( 15 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 66 ( 28 ~; 26 |; 8 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 142 ( 51 atm; 11 fun; 45 num; 35 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 2 usr; 5 con; 0-2 aty)
% Number of variables : 35 ( 29 !; 6 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_5,type,
sK0: $int ).
tff(func_def_6,type,
sK1: $int ).
tff(f186,plain,
$false,
inference(avatar_sat_refutation,[],[f176,f182]) ).
tff(f182,plain,
~ spl2_2,
inference(avatar_split_clause,[],[f181,f51]) ).
tff(f51,plain,
( spl2_2
<=> $less(1,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f181,plain,
~ $less(1,sK1),
inference(evaluation,[],[f180]) ).
tff(f180,plain,
( ( 2 = 1 )
| ~ $less(1,sK1) ),
inference(forward_demodulation,[],[f59,f94]) ).
tff(f94,plain,
2 = sK0,
inference(evaluation,[],[f91]) ).
tff(f91,plain,
( $less(2,1)
| ( 2 = sK0 ) ),
inference(resolution,[],[f88,f18]) ).
tff(f18,plain,
$less(2,sK1),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
( ! [X2: $int] :
( ( sK0 = X2 )
| ~ $less(X2,sK1)
| ~ $less(0,X2) )
& $less(2,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f15,f16]) ).
tff(f16,plain,
( ? [X0: $int,X1: $int] :
( ! [X2: $int] :
( ( X0 = X2 )
| ~ $less(X2,X1)
| ~ $less(0,X2) )
& $less(2,X1) )
=> ( ! [X2: $int] :
( ( sK0 = X2 )
| ~ $less(X2,sK1)
| ~ $less(0,X2) )
& $less(2,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f15,plain,
? [X0: $int,X1: $int] :
( ! [X2: $int] :
( ( X0 = X2 )
| ~ $less(X2,X1)
| ~ $less(0,X2) )
& $less(2,X1) ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: $int,X1: $int] :
( $less(2,X1)
=> ? [X2: $int] :
( ( X0 != X2 )
& $less(X2,X1)
& $less(0,X2) ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X0: $int,X1: $int] :
( $less(2,X1)
=> ? [X2: $int] :
( ( X0 != X2 )
& $less(X2,X1)
& $less(0,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.FolUHtQoHu/Vampire---4.8_14205',exists_X_0_Z_noteq_Y) ).
tff(f88,plain,
! [X0: $int] :
( ~ $less(X0,sK1)
| $less(X0,1)
| ( sK0 = X0 ) ),
inference(resolution,[],[f83,f19]) ).
tff(f19,plain,
! [X2: $int] :
( ~ $less(0,X2)
| ~ $less(X2,sK1)
| ( sK0 = X2 ) ),
inference(cnf_transformation,[],[f17]) ).
tff(f83,plain,
! [X0: $int] :
( $less(0,X0)
| $less(X0,1) ),
inference(superposition,[],[f34,f5]) ).
tff(f5,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(theory_axiom_137,[]) ).
tff(f34,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(1,X0))
| $less(X0,X1) ),
inference(superposition,[],[f12,f3]) ).
tff(f3,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f12,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_147,[]) ).
tff(f59,plain,
( ~ $less(1,sK1)
| ( 1 = sK0 ) ),
inference(evaluation,[],[f55]) ).
tff(f55,plain,
( ~ $less($sum(0,1),sK1)
| ( sK0 = $sum(0,1) ) ),
inference(resolution,[],[f33,f19]) ).
tff(f33,plain,
! [X0: $int] : $less(X0,$sum(X0,1)),
inference(resolution,[],[f12,f8]) ).
tff(f8,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_142,[]) ).
tff(f176,plain,
spl2_2,
inference(avatar_split_clause,[],[f175,f51]) ).
tff(f175,plain,
$less(1,sK1),
inference(evaluation,[],[f169]) ).
tff(f169,plain,
( $less(1,sK1)
| ~ $less(1,2) ),
inference(resolution,[],[f158,f71]) ).
tff(f71,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(1,X0))
| ~ $less(X0,X1) ),
inference(superposition,[],[f14,f3]) ).
tff(f14,plain,
! [X0: $int,X1: $int] :
( ~ $less(X1,$sum(X0,1))
| ~ $less(X0,X1) ),
introduced(theory_axiom_161,[]) ).
tff(f158,plain,
! [X0: $int] :
( $less(2,$sum(X0,1))
| $less(X0,sK1) ),
inference(resolution,[],[f151,f12]) ).
tff(f151,plain,
! [X0: $int] :
( ~ $less(sK1,X0)
| $less(2,X0) ),
inference(resolution,[],[f9,f18]) ).
tff(f9,plain,
! [X2: $int,X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,X2)
| $less(X0,X2) ),
introduced(theory_axiom_143,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI592_1 : TPTP v8.1.2. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 21:43:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TF0_THM_EQU_ARI problem
% 0.13/0.35 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.FolUHtQoHu/Vampire---4.8_14205
% 0.54/0.73 % (14610)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.54/0.73 % (14610)Refutation not found, incomplete strategy% (14610)------------------------------
% 0.54/0.73 % (14610)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.73 % (14610)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.73
% 0.54/0.73 % (14610)Memory used [KB]: 965
% 0.54/0.73 % (14610)Time elapsed: 0.002 s
% 0.54/0.73 % (14610)Instructions burned: 2 (million)
% 0.54/0.73 % (14603)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.54/0.73 % (14605)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.54/0.73 % (14604)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.54/0.73 % (14607)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.54/0.73 % (14610)------------------------------
% 0.54/0.73 % (14610)------------------------------
% 0.54/0.73 % (14608)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.54/0.73 % (14606)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.54/0.73 % (14609)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.54/0.74 % (14606)Refutation not found, incomplete strategy% (14606)------------------------------
% 0.54/0.74 % (14606)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (14606)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.74
% 0.54/0.74 % (14606)Memory used [KB]: 971
% 0.54/0.74 % (14606)Time elapsed: 0.004 s
% 0.54/0.74 % (14606)Instructions burned: 3 (million)
% 0.54/0.74 % (14614)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 Vampire---4 for (2996ds/55Mi)
% 0.54/0.74 % (14606)------------------------------
% 0.54/0.74 % (14606)------------------------------
% 0.54/0.74 % (14604)First to succeed.
% 0.54/0.74 % (14604)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-14456"
% 0.54/0.74 % (14604)Refutation found. Thanks to Tanya!
% 0.54/0.74 % SZS status Theorem for Vampire---4
% 0.54/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.74 % (14604)------------------------------
% 0.54/0.74 % (14604)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.74 % (14604)Termination reason: Refutation
% 0.54/0.74
% 0.54/0.74 % (14604)Memory used [KB]: 1071
% 0.54/0.74 % (14604)Time elapsed: 0.007 s
% 0.54/0.74 % (14604)Instructions burned: 8 (million)
% 0.54/0.74 % (14456)Success in time 0.384 s
% 0.54/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------