TSTP Solution File: FLD071-2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : FLD071-2 : TPTP v8.1.2. Bugfixed v2.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/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:20:19 EDT 2024
% Result : Unsatisfiable 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 50 ( 29 ~; 21 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f118,plain,
$false,
inference(subsumption_resolution,[],[f117,f32]) ).
fof(f32,axiom,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox2/tmp/tmp.xB5MrPYp1b/Vampire---4.8_25151',less_or_equal_5) ).
fof(f117,plain,
~ less_or_equal(additive_identity,b),
inference(subsumption_resolution,[],[f113,f31]) ).
fof(f31,axiom,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox2/tmp/tmp.xB5MrPYp1b/Vampire---4.8_25151',less_or_equal_4) ).
fof(f113,plain,
( ~ less_or_equal(additive_identity,a)
| ~ less_or_equal(additive_identity,b) ),
inference(resolution,[],[f104,f20]) ).
fof(f20,axiom,
! [X2,X1] :
( less_or_equal(additive_identity,multiply(X1,X2))
| ~ less_or_equal(additive_identity,X1)
| ~ less_or_equal(additive_identity,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xB5MrPYp1b/Vampire---4.8_25151',compatibility_of_order_relation_and_multiplication) ).
fof(f104,plain,
~ less_or_equal(additive_identity,multiply(a,b)),
inference(resolution,[],[f99,f33]) ).
fof(f33,axiom,
equalish(multiply(a,b),u),
file('/export/starexec/sandbox2/tmp/tmp.xB5MrPYp1b/Vampire---4.8_25151',multiply_equals_u_6) ).
fof(f99,plain,
! [X0] :
( ~ equalish(X0,u)
| ~ less_or_equal(additive_identity,X0) ),
inference(resolution,[],[f91,f22]) ).
fof(f22,axiom,
! [X0,X1] :
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.xB5MrPYp1b/Vampire---4.8_25151',symmetry_of_equality) ).
fof(f91,plain,
! [X0] :
( ~ equalish(u,X0)
| ~ less_or_equal(additive_identity,X0) ),
inference(subsumption_resolution,[],[f87,f30]) ).
fof(f30,axiom,
defined(u),
file('/export/starexec/sandbox2/tmp/tmp.xB5MrPYp1b/Vampire---4.8_25151',u_is_defined) ).
fof(f87,plain,
! [X0] :
( ~ equalish(u,X0)
| ~ less_or_equal(additive_identity,X0)
| ~ defined(u) ),
inference(resolution,[],[f38,f45]) ).
fof(f45,plain,
! [X0] :
( less_or_equal(X0,X0)
| ~ defined(X0) ),
inference(duplicate_literal_removal,[],[f44]) ).
fof(f44,plain,
! [X0] :
( less_or_equal(X0,X0)
| ~ defined(X0)
| ~ defined(X0) ),
inference(factoring,[],[f18]) ).
fof(f18,axiom,
! [X0,X1] :
( less_or_equal(X0,X1)
| ~ defined(X0)
| less_or_equal(X1,X0)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.xB5MrPYp1b/Vampire---4.8_25151',totality_of_order_relation) ).
fof(f38,plain,
! [X0,X1] :
( ~ less_or_equal(X0,u)
| ~ equalish(X0,X1)
| ~ less_or_equal(additive_identity,X1) ),
inference(resolution,[],[f26,f35]) ).
fof(f35,plain,
! [X0] :
( ~ less_or_equal(X0,u)
| ~ less_or_equal(additive_identity,X0) ),
inference(resolution,[],[f17,f34]) ).
fof(f34,axiom,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/tmp/tmp.xB5MrPYp1b/Vampire---4.8_25151',not_less_or_equal_7) ).
fof(f17,axiom,
! [X2,X0,X1] :
( less_or_equal(X0,X2)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.xB5MrPYp1b/Vampire---4.8_25151',transitivity_of_order_relation) ).
fof(f26,axiom,
! [X2,X0,X1] :
( less_or_equal(X1,X2)
| ~ less_or_equal(X0,X2)
| ~ equalish(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.xB5MrPYp1b/Vampire---4.8_25151',compatibility_of_equality_and_order_relation) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : FLD071-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.02/0.11 % 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.11/0.31 % Computer : n006.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Apr 30 17:57:50 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.11/0.32 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.xB5MrPYp1b/Vampire---4.8_25151
% 0.61/0.80 % (25273)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.80 % (25270)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 (2995ds/34Mi)
% 0.61/0.80 % (25271)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 (2995ds/51Mi)
% 0.61/0.80 % (25274)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 (2995ds/34Mi)
% 0.61/0.80 % (25275)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.80 % (25276)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 (2995ds/83Mi)
% 0.61/0.80 % (25277)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 (2995ds/56Mi)
% 0.61/0.80 % (25272)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.80 % (25272)First to succeed.
% 0.61/0.80 % (25272)Refutation found. Thanks to Tanya!
% 0.61/0.80 % SZS status Unsatisfiable for Vampire---4
% 0.61/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.80 % (25272)------------------------------
% 0.61/0.80 % (25272)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (25272)Termination reason: Refutation
% 0.61/0.80
% 0.61/0.80 % (25272)Memory used [KB]: 997
% 0.61/0.80 % (25272)Time elapsed: 0.004 s
% 0.61/0.80 % (25272)Instructions burned: 6 (million)
% 0.61/0.80 % (25272)------------------------------
% 0.61/0.80 % (25272)------------------------------
% 0.61/0.81 % (25261)Success in time 0.482 s
% 0.61/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------