TSTP Solution File: ARI122_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ARI122_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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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 02:08:14 EDT 2024
% Result : Theorem 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 25 ( 15 unt; 4 typ; 0 def)
% Number of atoms : 50 ( 49 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 41 ( 12 ~; 0 |; 26 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 121 ( 0 atm; 39 fun; 60 num; 22 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 4 usr; 9 con; 0-2 aty)
% Number of variables : 22 ( 10 !; 12 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
tff(func_def_8,type,
sK0: $int ).
tff(func_def_9,type,
sK1: $int ).
tff(func_def_10,type,
sK2: $int ).
tff(func_def_11,type,
sK3: $int ).
tff(f38,plain,
$false,
inference(evaluation,[],[f37]) ).
tff(f37,plain,
36 != $product(6,6),
inference(forward_demodulation,[],[f36,f30]) ).
tff(f30,plain,
6 = sK0,
inference(evaluation,[],[f25]) ).
tff(f25,plain,
$product(2,3) = sK0,
inference(cnf_transformation,[],[f24]) ).
tff(f24,plain,
( ( sK1 != sK3 )
& ( sK3 = $product(2,sK2) )
& ( $product(3,6) = sK2 )
& ( sK1 = $product(sK0,6) )
& ( $product(2,3) = sK0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f22,f23]) ).
tff(f23,plain,
( ? [X0: $int,X1: $int,X2: $int,X3: $int] :
( ( X1 != X3 )
& ( $product(2,X2) = X3 )
& ( $product(3,6) = X2 )
& ( $product(X0,6) = X1 )
& ( $product(2,3) = X0 ) )
=> ( ( sK1 != sK3 )
& ( sK3 = $product(2,sK2) )
& ( $product(3,6) = sK2 )
& ( sK1 = $product(sK0,6) )
& ( $product(2,3) = sK0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f22,plain,
? [X0: $int,X1: $int,X2: $int,X3: $int] :
( ( X1 != X3 )
& ( $product(2,X2) = X3 )
& ( $product(3,6) = X2 )
& ( $product(X0,6) = X1 )
& ( $product(2,3) = X0 ) ),
inference(flattening,[],[f21]) ).
tff(f21,plain,
? [X0: $int,X1: $int,X2: $int,X3: $int] :
( ( X1 != X3 )
& ( $product(2,X2) = X3 )
& ( $product(3,6) = X2 )
& ( $product(X0,6) = X1 )
& ( $product(2,3) = X0 ) ),
inference(ennf_transformation,[],[f2]) ).
tff(f2,negated_conjecture,
~ ! [X0: $int,X1: $int,X2: $int,X3: $int] :
( ( ( $product(2,X2) = X3 )
& ( $product(3,6) = X2 )
& ( $product(X0,6) = X1 )
& ( $product(2,3) = X0 ) )
=> ( X1 = X3 ) ),
inference(negated_conjecture,[],[f1]) ).
tff(f1,conjecture,
! [X0: $int,X1: $int,X2: $int,X3: $int] :
( ( ( $product(2,X2) = X3 )
& ( $product(3,6) = X2 )
& ( $product(X0,6) = X1 )
& ( $product(2,3) = X0 ) )
=> ( X1 = X3 ) ),
file('/export/starexec/sandbox2/tmp/tmp.4P2fQ3WApV/Vampire---4.8_29215',associative_product) ).
tff(f36,plain,
$product(6,sK0) != 36,
inference(superposition,[],[f35,f32]) ).
tff(f32,plain,
sK1 = $product(6,sK0),
inference(forward_demodulation,[],[f26,f14]) ).
tff(f14,plain,
! [X0: $int,X1: $int] : ( $product(X0,X1) = $product(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f26,plain,
sK1 = $product(sK0,6),
inference(cnf_transformation,[],[f24]) ).
tff(f35,plain,
sK1 != 36,
inference(evaluation,[],[f34]) ).
tff(f34,plain,
sK1 != $product(2,18),
inference(forward_demodulation,[],[f33,f31]) ).
tff(f31,plain,
sK2 = 18,
inference(evaluation,[],[f27]) ).
tff(f27,plain,
$product(3,6) = sK2,
inference(cnf_transformation,[],[f24]) ).
tff(f33,plain,
sK1 != $product(2,sK2),
inference(superposition,[],[f29,f28]) ).
tff(f28,plain,
sK3 = $product(2,sK2),
inference(cnf_transformation,[],[f24]) ).
tff(f29,plain,
sK1 != sK3,
inference(cnf_transformation,[],[f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI122_1 : TPTP v8.1.2. Released v5.0.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.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 18:47:50 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.4P2fQ3WApV/Vampire---4.8_29215
% 0.55/0.74 % (29427)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.74 % (29429)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.55/0.74 % (29429)Refutation not found, incomplete strategy% (29429)------------------------------
% 0.55/0.74 % (29429)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.74 % (29429)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (29429)Memory used [KB]: 956
% 0.55/0.74 % (29429)Time elapsed: 0.002 s
% 0.55/0.74 % (29429)Instructions burned: 2 (million)
% 0.55/0.74 % (29429)------------------------------
% 0.55/0.74 % (29429)------------------------------
% 0.55/0.74 % (29422)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.74 % (29427)First to succeed.
% 0.55/0.74 % (29424)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.74 % (29425)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.74 % (29426)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.74 % (29423)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.74 % (29428)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.74 % (29427)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Theorem for Vampire---4
% 0.55/0.74 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.74 % (29427)------------------------------
% 0.55/0.74 % (29427)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.74 % (29427)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (29427)Memory used [KB]: 964
% 0.55/0.74 % (29427)Time elapsed: 0.002 s
% 0.55/0.74 % (29427)Instructions burned: 3 (million)
% 0.55/0.74 % (29427)------------------------------
% 0.55/0.74 % (29427)------------------------------
% 0.55/0.74 % (29401)Success in time 0.376 s
% 0.55/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------