TSTP Solution File: ARI119_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI119_1 : TPTP v8.2.0. 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 : n029.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:46:37 EDT 2024
% Result : Theorem 0.52s 0.71s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 5 unt; 1 typ; 0 def)
% Number of atoms : 21 ( 16 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 5 |; 4 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 42 ( 0 atm; 7 fun; 23 num; 12 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 0 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 8 !; 4 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_2,type,
sQ0_eqProxy: ( $int * $int ) > $o ).
tff(f34,plain,
$false,
inference(subsumption_resolution,[],[f33,f32]) ).
tff(f32,plain,
! [X0: $int] : sQ0_eqProxy(X0,X0),
inference(equality_proxy_axiom,[],[f25]) ).
tff(f25,plain,
! [X0: $int,X1: $int] :
( sQ0_eqProxy(X0,X1)
<=> ( X0 = X1 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ0_eqProxy])]) ).
tff(f33,plain,
~ sQ0_eqProxy(16,16),
inference(evaluation,[],[f26]) ).
tff(f26,plain,
~ sQ0_eqProxy(16,$product(4,4)),
inference(equality_proxy_replacement,[],[f24,f25]) ).
tff(f24,plain,
16 != $product(4,4),
inference(equality_resolution,[],[f23]) ).
tff(f23,plain,
! [X0: $int] :
( ( 4 != X0 )
| ( 16 != $product(X0,4) ) ),
inference(equality_resolution,[],[f22]) ).
tff(f22,plain,
! [X0: $int,X1: $int] :
( ( 4 != X1 )
| ( 4 != X0 )
| ( $product(X0,X1) != 16 ) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
! [X0: $int,X1: $int] :
( ( 4 != X1 )
| ( 4 != X0 )
| ( $product(X0,X1) != 16 ) ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,negated_conjecture,
~ ? [X0: $int,X1: $int] :
( ( 4 = X1 )
& ( 4 = X0 )
& ( $product(X0,X1) = 16 ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
? [X0: $int,X1: $int] :
( ( 4 = X1 )
& ( 4 = X0 )
& ( $product(X0,X1) = 16 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_4_4_16) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : ARI119_1 : TPTP v8.2.0. Released v5.0.0.
% 0.07/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 : n029.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 : Sun May 19 13:07:38 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.52/0.71 % (1216)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 (2996ds/56Mi)
% 0.52/0.71 % (1209)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.52/0.71 % (1210)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.52/0.71 % (1216)First to succeed.
% 0.52/0.71 % (1216)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1207"
% 0.52/0.71 % (1216)Refutation found. Thanks to Tanya!
% 0.52/0.71 % SZS status Theorem for theBenchmark
% 0.52/0.71 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.71 % (1216)------------------------------
% 0.52/0.71 % (1216)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.52/0.71 % (1216)Termination reason: Refutation
% 0.52/0.71
% 0.52/0.71 % (1216)Memory used [KB]: 958
% 0.52/0.71 % (1216)Time elapsed: 0.003 s
% 0.52/0.71 % (1216)Instructions burned: 2 (million)
% 0.52/0.71 % (1207)Success in time 0.369 s
% 0.52/0.72 % Vampire---4.8 exiting
%------------------------------------------------------------------------------