TSTP Solution File: HEN007-4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : HEN007-4 : 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/sandbox2/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 21:34:32 EDT 2024
% Result : Unsatisfiable 0.55s 0.74s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of formulae : 10 ( 7 unt; 0 def)
% Number of atoms : 14 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 8 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 9 ( 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f288,plain,
$false,
inference(unit_resulting_resolution,[],[f10,f203,f2]) ).
fof(f2,axiom,
! [X0,X1] :
( less_equal(X0,X1)
| divide(X0,X1) != zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quotient_less_equal2) ).
fof(f203,plain,
~ less_equal(divide(c,a),divide(c,a)),
inference(unit_resulting_resolution,[],[f150,f13]) ).
fof(f13,axiom,
! [X2,X0,X1] :
( ~ less_equal(divide(X0,X1),X2)
| less_equal(divide(X0,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_divide1) ).
fof(f150,plain,
~ less_equal(divide(c,divide(c,a)),a),
inference(unit_resulting_resolution,[],[f14,f95,f12]) ).
fof(f12,axiom,
! [X2,X0,X1] :
( ~ less_equal(X0,X1)
| ~ less_equal(X1,X2)
| less_equal(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less_equal) ).
fof(f95,plain,
~ less_equal(divide(c,divide(c,a)),b),
inference(unit_resulting_resolution,[],[f15,f13]) ).
fof(f15,axiom,
~ less_equal(divide(c,b),divide(c,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c_divide_b_LE_c_divide_a) ).
fof(f14,axiom,
less_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_LE_b) ).
fof(f10,axiom,
! [X0] : zero = divide(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_divide_x_is_zero) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : HEN007-4 : TPTP v8.2.0. Released v1.0.0.
% 0.10/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.33 % Computer : n029.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Sun May 19 22:49:38 EDT 2024
% 0.15/0.33 % CPUTime :
% 0.15/0.33 This is a CNF_UNS_RFO_SEQ_HRN problem
% 0.15/0.34 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/benchmark/theBenchmark.p
% 0.55/0.74 % (27471)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.55/0.74 % (27464)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.74 % (27466)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.74 % (27465)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.74 % (27467)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.74 % (27468)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.74 % (27469)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.74 % (27470)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.74 % (27464)Also succeeded, but the first one will report.
% 0.55/0.74 % (27470)First to succeed.
% 0.55/0.74 % (27470)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27291"
% 0.55/0.74 % (27470)Refutation found. Thanks to Tanya!
% 0.55/0.74 % SZS status Unsatisfiable for theBenchmark
% 0.55/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.74 % (27470)------------------------------
% 0.55/0.74 % (27470)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (27470)Termination reason: Refutation
% 0.55/0.74
% 0.55/0.74 % (27470)Memory used [KB]: 1083
% 0.55/0.74 % (27470)Time elapsed: 0.009 s
% 0.55/0.74 % (27470)Instructions burned: 12 (million)
% 0.55/0.75 % (27291)Success in time 0.396 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------