TSTP Solution File: HEN005-5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : HEN005-5 : TPTP v8.2.0. Released v1.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 : n003.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 21:34:28 EDT 2024
% Result : Unsatisfiable 0.62s 0.80s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 11 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 8 ( 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f84,plain,
$false,
inference(subsumption_resolution,[],[f83,f3]) ).
fof(f3,axiom,
! [X0] : zero = divide(zero,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zero_is_smallest) ).
fof(f83,plain,
zero != divide(zero,divide(a,c)),
inference(subsumption_resolution,[],[f80,f8]) ).
fof(f8,axiom,
zero != divide(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_transitivity_of_divide_to_zero) ).
fof(f80,plain,
( zero = divide(a,c)
| zero != divide(zero,divide(a,c)) ),
inference(trivial_inequality_removal,[],[f79]) ).
fof(f79,plain,
( zero != zero
| zero = divide(a,c)
| zero != divide(zero,divide(a,c)) ),
inference(superposition,[],[f4,f70]) ).
fof(f70,plain,
zero = divide(divide(a,c),zero),
inference(subsumption_resolution,[],[f65,f3]) ).
fof(f65,plain,
( zero = divide(divide(a,c),zero)
| zero != divide(zero,divide(divide(a,c),zero)) ),
inference(trivial_inequality_removal,[],[f64]) ).
fof(f64,plain,
( zero != zero
| zero = divide(divide(a,c),zero)
| zero != divide(zero,divide(divide(a,c),zero)) ),
inference(superposition,[],[f4,f44]) ).
fof(f44,plain,
zero = divide(divide(divide(a,c),zero),zero),
inference(superposition,[],[f15,f7]) ).
fof(f7,axiom,
zero = divide(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_divide_c_is_zero) ).
fof(f15,plain,
! [X0] : zero = divide(divide(divide(a,X0),divide(b,X0)),zero),
inference(forward_demodulation,[],[f10,f3]) ).
fof(f10,plain,
! [X0] : zero = divide(divide(divide(a,X0),divide(b,X0)),divide(zero,X0)),
inference(superposition,[],[f2,f6]) ).
fof(f6,axiom,
zero = divide(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_divide_b_is_zero) ).
fof(f2,axiom,
! [X2,X0,X1] : zero = divide(divide(divide(X0,X2),divide(X1,X2)),divide(divide(X0,X1),X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quotient_property) ).
fof(f4,axiom,
! [X0,X1] :
( zero != divide(X1,X0)
| X0 = X1
| divide(X0,X1) != zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',divide_and_equal) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.15 % Problem : HEN005-5 : TPTP v8.2.0. Released v1.0.0.
% 0.09/0.18 % 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.18/0.40 % Computer : n003.cluster.edu
% 0.18/0.40 % Model : x86_64 x86_64
% 0.18/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40 % Memory : 8042.1875MB
% 0.18/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40 % CPULimit : 300
% 0.18/0.40 % WCLimit : 300
% 0.18/0.40 % DateTime : Sun May 19 22:49:53 EDT 2024
% 0.18/0.41 % CPUTime :
% 0.18/0.41 This is a CNF_UNS_RFO_PEQ_NUE problem
% 0.18/0.41 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.62/0.80 % (20266)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.62/0.80 % (20267)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.62/0.80 % (20269)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.62/0.80 % (20268)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.62/0.80 % (20270)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.62/0.80 % (20271)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.62/0.80 % (20268)Refutation not found, incomplete strategy% (20268)------------------------------
% 0.62/0.80 % (20268)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (20268)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.80
% 0.62/0.80 % (20264)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.62/0.80 % (20268)Memory used [KB]: 981
% 0.62/0.80 % (20268)Time elapsed: 0.003 s
% 0.62/0.80 % (20268)Instructions burned: 2 (million)
% 0.62/0.80 % (20268)------------------------------
% 0.62/0.80 % (20268)------------------------------
% 0.62/0.80 % (20269)First to succeed.
% 0.62/0.80 % (20270)Also succeeded, but the first one will report.
% 0.62/0.80 % (20264)Refutation not found, incomplete strategy% (20264)------------------------------
% 0.62/0.80 % (20264)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (20264)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.80
% 0.62/0.80 % (20264)Memory used [KB]: 987
% 0.62/0.80 % (20264)Time elapsed: 0.004 s
% 0.62/0.80 % (20264)Instructions burned: 3 (million)
% 0.62/0.80 % (20269)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20263"
% 0.62/0.80 % (20264)------------------------------
% 0.62/0.80 % (20264)------------------------------
% 0.62/0.80 % (20266)Also succeeded, but the first one will report.
% 0.62/0.80 % (20269)Refutation found. Thanks to Tanya!
% 0.62/0.80 % SZS status Unsatisfiable for theBenchmark
% 0.62/0.80 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.80 % (20269)------------------------------
% 0.62/0.80 % (20269)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (20269)Termination reason: Refutation
% 0.62/0.80
% 0.62/0.80 % (20269)Memory used [KB]: 1072
% 0.62/0.80 % (20269)Time elapsed: 0.005 s
% 0.62/0.80 % (20269)Instructions burned: 5 (million)
% 0.62/0.80 % (20263)Success in time 0.387 s
% 0.62/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------