TSTP Solution File: GRP114-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP114-1 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n016.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 : Tue Apr 30 11:51:35 EDT 2024
% Result : Unsatisfiable 22.95s 3.68s
% Output : Refutation 22.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 19
% Syntax : Number of formulae : 91 ( 91 unt; 0 def)
% Number of atoms : 91 ( 90 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 141 ( 141 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f245828,plain,
$false,
inference(trivial_inequality_removal,[],[f245775]) ).
fof(f245775,plain,
a != a,
inference(superposition,[],[f21,f244702]) ).
fof(f244702,plain,
! [X0] : multiply(positive_part(X0),negative_part(X0)) = X0,
inference(forward_demodulation,[],[f244378,f5]) ).
fof(f5,axiom,
! [X0] : inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_involution) ).
fof(f244378,plain,
! [X0] : multiply(inverse(inverse(positive_part(X0))),negative_part(X0)) = X0,
inference(superposition,[],[f56838,f244328]) ).
fof(f244328,plain,
! [X0] : inverse(positive_part(X0)) = negative_part(inverse(X0)),
inference(forward_demodulation,[],[f244179,f618]) ).
fof(f618,plain,
! [X0] : inverse(X0) = multiply(inverse(X0),identity),
inference(forward_demodulation,[],[f611,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f611,plain,
! [X0] : inverse(multiply(identity,X0)) = multiply(inverse(X0),identity),
inference(superposition,[],[f6,f4]) ).
fof(f4,axiom,
identity = inverse(identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_of_identity) ).
fof(f6,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_product_lemma) ).
fof(f244179,plain,
! [X0] : negative_part(inverse(X0)) = multiply(inverse(positive_part(X0)),identity),
inference(superposition,[],[f765,f243438]) ).
fof(f243438,plain,
! [X0] : identity = multiply(positive_part(X0),negative_part(inverse(X0))),
inference(forward_demodulation,[],[f243437,f64]) ).
fof(f64,plain,
! [X0] : identity = positive_part(negative_part(X0)),
inference(forward_demodulation,[],[f58,f20]) ).
fof(f20,axiom,
! [X0] : negative_part(X0) = intersection(X0,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',negative_part) ).
fof(f58,plain,
! [X0] : identity = positive_part(intersection(X0,identity)),
inference(superposition,[],[f13,f19]) ).
fof(f19,axiom,
! [X0] : positive_part(X0) = union(X0,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',positive_part) ).
fof(f13,axiom,
! [X0,X1] : union(intersection(X0,X1),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_intersection_absorbtion) ).
fof(f243437,plain,
! [X0] : positive_part(negative_part(X0)) = multiply(positive_part(X0),negative_part(inverse(X0))),
inference(forward_demodulation,[],[f243436,f27046]) ).
fof(f27046,plain,
! [X0] : negative_part(X0) = multiply(X0,negative_part(inverse(X0))),
inference(forward_demodulation,[],[f27045,f20]) ).
fof(f27045,plain,
! [X0] : intersection(X0,identity) = multiply(X0,negative_part(inverse(X0))),
inference(forward_demodulation,[],[f26961,f802]) ).
fof(f802,plain,
! [X0,X1] : inverse(X1) = multiply(X0,inverse(multiply(X1,X0))),
inference(forward_demodulation,[],[f789,f5]) ).
fof(f789,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(inverse(X0)),inverse(multiply(X1,X0))),
inference(superposition,[],[f765,f6]) ).
fof(f26961,plain,
! [X0,X1] : intersection(X0,identity) = multiply(X0,negative_part(multiply(X1,inverse(multiply(X0,X1))))),
inference(superposition,[],[f26913,f757]) ).
fof(f757,plain,
! [X0,X1] : identity = multiply(X0,multiply(X1,inverse(multiply(X0,X1)))),
inference(superposition,[],[f3,f24]) ).
fof(f24,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f2,f5]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
fof(f3,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
fof(f26913,plain,
! [X0,X1] : multiply(X0,negative_part(X1)) = intersection(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f26831,f33]) ).
fof(f33,plain,
! [X0] : negative_part(X0) = intersection(identity,X0),
inference(superposition,[],[f9,f20]) ).
fof(f9,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_commutative) ).
fof(f26831,plain,
! [X0,X1] : multiply(X0,intersection(identity,X1)) = intersection(X0,multiply(X0,X1)),
inference(superposition,[],[f16,f633]) ).
fof(f633,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f628,f5]) ).
fof(f628,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f5,f617]) ).
fof(f617,plain,
! [X0] : inverse(X0) = inverse(multiply(X0,identity)),
inference(forward_demodulation,[],[f609,f1]) ).
fof(f609,plain,
! [X0] : inverse(multiply(X0,identity)) = multiply(identity,inverse(X0)),
inference(superposition,[],[f6,f4]) ).
fof(f16,axiom,
! [X2,X0,X1] : multiply(X0,intersection(X1,X2)) = intersection(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_intersection1) ).
fof(f243436,plain,
! [X0] : multiply(positive_part(X0),negative_part(inverse(X0))) = positive_part(multiply(X0,negative_part(inverse(X0)))),
inference(forward_demodulation,[],[f243435,f42485]) ).
fof(f42485,plain,
! [X0,X1] : positive_part(multiply(X1,negative_part(X0))) = positive_part(multiply(positive_part(X1),negative_part(X0))),
inference(superposition,[],[f6848,f41569]) ).
fof(f41569,plain,
! [X0,X1] : multiply(positive_part(X1),X0) = union(X0,multiply(X1,X0)),
inference(forward_demodulation,[],[f41435,f43]) ).
fof(f43,plain,
! [X0] : positive_part(X0) = union(identity,X0),
inference(superposition,[],[f10,f19]) ).
fof(f10,axiom,
! [X0,X1] : union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_commutative) ).
fof(f41435,plain,
! [X0,X1] : multiply(union(identity,X1),X0) = union(X0,multiply(X1,X0)),
inference(superposition,[],[f17,f1]) ).
fof(f17,axiom,
! [X2,X0,X1] : multiply(union(X1,X2),X0) = union(multiply(X1,X0),multiply(X2,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_union2) ).
fof(f6848,plain,
! [X0,X1] : positive_part(X1) = positive_part(union(negative_part(X0),X1)),
inference(superposition,[],[f6549,f1048]) ).
fof(f1048,plain,
! [X0,X1] : positive_part(X0) = union(negative_part(X1),positive_part(X0)),
inference(superposition,[],[f55,f1020]) ).
fof(f1020,plain,
! [X0,X1] : negative_part(X1) = intersection(positive_part(X0),negative_part(X1)),
inference(forward_demodulation,[],[f973,f33]) ).
fof(f973,plain,
! [X0,X1] : intersection(identity,X1) = intersection(positive_part(X0),intersection(identity,X1)),
inference(superposition,[],[f11,f90]) ).
fof(f90,plain,
! [X0] : identity = intersection(positive_part(X0),identity),
inference(superposition,[],[f14,f19]) ).
fof(f14,axiom,
! [X0,X1] : intersection(union(X0,X1),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_union_absorbtion) ).
fof(f11,axiom,
! [X2,X0,X1] : intersection(X0,intersection(X1,X2)) = intersection(intersection(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_associative) ).
fof(f55,plain,
! [X0,X1] : union(intersection(X1,X0),X1) = X1,
inference(superposition,[],[f13,f9]) ).
fof(f6549,plain,
! [X0,X1] : union(X0,positive_part(X1)) = positive_part(union(X0,X1)),
inference(forward_demodulation,[],[f6475,f19]) ).
fof(f6475,plain,
! [X0,X1] : positive_part(union(X0,X1)) = union(X0,union(X1,identity)),
inference(superposition,[],[f12,f19]) ).
fof(f12,axiom,
! [X2,X0,X1] : union(X0,union(X1,X2)) = union(union(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_associative) ).
fof(f243435,plain,
! [X0] : multiply(positive_part(X0),negative_part(inverse(X0))) = positive_part(multiply(positive_part(X0),negative_part(inverse(X0)))),
inference(forward_demodulation,[],[f242925,f633]) ).
fof(f242925,plain,
! [X0] : positive_part(multiply(positive_part(X0),negative_part(inverse(X0)))) = multiply(multiply(positive_part(X0),negative_part(inverse(X0))),identity),
inference(superposition,[],[f17427,f242169]) ).
fof(f242169,plain,
! [X0] : identity = positive_part(inverse(multiply(positive_part(X0),negative_part(inverse(X0))))),
inference(forward_demodulation,[],[f242168,f6]) ).
fof(f242168,plain,
! [X0] : identity = positive_part(multiply(inverse(negative_part(inverse(X0))),inverse(positive_part(X0)))),
inference(forward_demodulation,[],[f241401,f19028]) ).
fof(f19028,plain,
! [X0] : inverse(positive_part(X0)) = negative_part(inverse(positive_part(X0))),
inference(superposition,[],[f17451,f33]) ).
fof(f17451,plain,
! [X0] : inverse(positive_part(X0)) = intersection(identity,inverse(positive_part(X0))),
inference(superposition,[],[f17361,f2]) ).
fof(f17361,plain,
! [X0,X1] : intersection(multiply(X0,positive_part(X1)),X0) = X0,
inference(superposition,[],[f88,f17302]) ).
fof(f17302,plain,
! [X0,X1] : union(X0,multiply(X0,X1)) = multiply(X0,positive_part(X1)),
inference(forward_demodulation,[],[f17226,f43]) ).
fof(f17226,plain,
! [X0,X1] : multiply(X0,union(identity,X1)) = union(X0,multiply(X0,X1)),
inference(superposition,[],[f15,f633]) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(X0,union(X1,X2)) = union(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_union1) ).
fof(f88,plain,
! [X0,X1] : intersection(union(X1,X0),X1) = X1,
inference(superposition,[],[f14,f10]) ).
fof(f241401,plain,
! [X0] : identity = positive_part(multiply(inverse(negative_part(inverse(X0))),negative_part(inverse(positive_part(X0))))),
inference(superposition,[],[f151090,f42885]) ).
fof(f42885,plain,
! [X0] : inverse(positive_part(X0)) = intersection(inverse(positive_part(X0)),inverse(X0)),
inference(superposition,[],[f42420,f17774]) ).
fof(f17774,plain,
! [X0] : inverse(X0) = multiply(positive_part(inverse(X0)),inverse(positive_part(X0))),
inference(superposition,[],[f802,f17427]) ).
fof(f42420,plain,
! [X0,X1] : intersection(X0,multiply(positive_part(X1),X0)) = X0,
inference(superposition,[],[f187,f41569]) ).
fof(f187,plain,
! [X0,X1] : intersection(X0,union(X0,X1)) = X0,
inference(superposition,[],[f88,f9]) ).
fof(f151090,plain,
! [X0,X1] : identity = positive_part(multiply(inverse(negative_part(X0)),negative_part(intersection(X1,X0)))),
inference(forward_demodulation,[],[f150785,f2]) ).
fof(f150785,plain,
! [X0,X1] : multiply(inverse(negative_part(X0)),negative_part(X0)) = positive_part(multiply(inverse(negative_part(X0)),negative_part(intersection(X1,X0)))),
inference(superposition,[],[f17298,f1451]) ).
fof(f1451,plain,
! [X0,X1] : negative_part(X1) = union(negative_part(X1),negative_part(intersection(X0,X1))),
inference(superposition,[],[f59,f1025]) ).
fof(f1025,plain,
! [X0,X1] : negative_part(intersection(X0,X1)) = intersection(X0,negative_part(X1)),
inference(forward_demodulation,[],[f982,f20]) ).
fof(f982,plain,
! [X0,X1] : negative_part(intersection(X0,X1)) = intersection(X0,intersection(X1,identity)),
inference(superposition,[],[f11,f20]) ).
fof(f59,plain,
! [X0,X1] : union(X1,intersection(X0,X1)) = X1,
inference(superposition,[],[f13,f10]) ).
fof(f17298,plain,
! [X0,X1] : multiply(inverse(X0),union(X0,X1)) = positive_part(multiply(inverse(X0),X1)),
inference(forward_demodulation,[],[f17222,f43]) ).
fof(f17222,plain,
! [X0,X1] : multiply(inverse(X0),union(X0,X1)) = union(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f15,f2]) ).
fof(f17427,plain,
! [X0] : positive_part(X0) = multiply(X0,positive_part(inverse(X0))),
inference(forward_demodulation,[],[f17426,f19]) ).
fof(f17426,plain,
! [X0] : union(X0,identity) = multiply(X0,positive_part(inverse(X0))),
inference(forward_demodulation,[],[f17348,f802]) ).
fof(f17348,plain,
! [X0,X1] : union(X0,identity) = multiply(X0,positive_part(multiply(X1,inverse(multiply(X0,X1))))),
inference(superposition,[],[f17302,f757]) ).
fof(f765,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f747,f1]) ).
fof(f747,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f3,f2]) ).
fof(f56838,plain,
! [X0] : multiply(inverse(negative_part(inverse(X0))),negative_part(X0)) = X0,
inference(superposition,[],[f765,f56530]) ).
fof(f56530,plain,
! [X0] : negative_part(X0) = multiply(negative_part(inverse(X0)),X0),
inference(forward_demodulation,[],[f56395,f20]) ).
fof(f56395,plain,
! [X0] : intersection(X0,identity) = multiply(negative_part(inverse(X0)),X0),
inference(superposition,[],[f56317,f2]) ).
fof(f56317,plain,
! [X0,X1] : multiply(negative_part(X1),X0) = intersection(X0,multiply(X1,X0)),
inference(forward_demodulation,[],[f56160,f33]) ).
fof(f56160,plain,
! [X0,X1] : multiply(intersection(identity,X1),X0) = intersection(X0,multiply(X1,X0)),
inference(superposition,[],[f18,f1]) ).
fof(f18,axiom,
! [X2,X0,X1] : multiply(intersection(X1,X2),X0) = intersection(multiply(X1,X0),multiply(X2,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_intersection2) ).
fof(f21,axiom,
a != multiply(positive_part(a),negative_part(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_product) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP114-1 : TPTP v8.1.2. Released v1.2.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 05:06:11 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (27099)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (27102)WARNING: value z3 for option sas not known
% 0.15/0.38 % (27101)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (27103)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (27100)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (27104)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38 % (27106)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38 % (27105)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38 % (27102)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.38 TRYING [3]
% 0.15/0.38 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.21/0.41 TRYING [3]
% 0.21/0.41 TRYING [4]
% 0.21/0.46 TRYING [4]
% 0.21/0.48 TRYING [5]
% 0.21/0.56 TRYING [5]
% 0.21/0.60 TRYING [6]
% 2.98/0.82 TRYING [6]
% 4.13/0.95 TRYING [7]
% 7.82/1.48 TRYING [1]
% 7.82/1.48 TRYING [2]
% 7.82/1.48 TRYING [3]
% 7.82/1.49 TRYING [4]
% 8.34/1.54 TRYING [5]
% 8.34/1.57 TRYING [7]
% 9.47/1.71 TRYING [6]
% 10.32/1.81 TRYING [8]
% 12.55/2.18 TRYING [7]
% 22.95/3.68 % (27106)First to succeed.
% 22.95/3.68 % (27106)Refutation found. Thanks to Tanya!
% 22.95/3.68 % SZS status Unsatisfiable for theBenchmark
% 22.95/3.68 % SZS output start Proof for theBenchmark
% See solution above
% 22.95/3.68 % (27106)------------------------------
% 22.95/3.68 % (27106)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 22.95/3.68 % (27106)Termination reason: Refutation
% 22.95/3.68
% 22.95/3.68 % (27106)Memory used [KB]: 56586
% 22.95/3.68 % (27106)Time elapsed: 3.302 s
% 22.95/3.68 % (27106)Instructions burned: 11263 (million)
% 22.95/3.68 % (27106)------------------------------
% 22.95/3.68 % (27106)------------------------------
% 22.95/3.68 % (27099)Success in time 3.279 s
%------------------------------------------------------------------------------