TSTP Solution File: GRP184-4 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP184-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n012.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:52:05 EDT 2024
% Result : Unsatisfiable 25.42s 4.01s
% Output : Refutation 25.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 17
% Syntax : Number of formulae : 84 ( 84 unt; 0 def)
% Number of atoms : 84 ( 83 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 142 ( 142 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f139099,plain,
$false,
inference(subsumption_resolution,[],[f139098,f66472]) ).
fof(f66472,plain,
! [X0] : least_upper_bound(identity,least_upper_bound(X0,inverse(X0))) = multiply(least_upper_bound(X0,identity),inverse(greatest_lower_bound(identity,X0))),
inference(forward_demodulation,[],[f66471,f18548]) ).
fof(f18548,plain,
! [X2,X0,X1] : least_upper_bound(X1,least_upper_bound(X0,X2)) = least_upper_bound(X1,least_upper_bound(X2,X0)),
inference(superposition,[],[f13327,f8941]) ).
fof(f8941,plain,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X2,least_upper_bound(X0,X1)),
inference(superposition,[],[f7,f5]) ).
fof(f5,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
fof(f7,axiom,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f13327,plain,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(X1,least_upper_bound(X0,X2)),
inference(superposition,[],[f8899,f7]) ).
fof(f8899,plain,
! [X2,X0,X1] : least_upper_bound(X0,least_upper_bound(X1,X2)) = least_upper_bound(least_upper_bound(X1,X0),X2),
inference(superposition,[],[f7,f5]) ).
fof(f66471,plain,
! [X0] : least_upper_bound(identity,least_upper_bound(inverse(X0),X0)) = multiply(least_upper_bound(X0,identity),inverse(greatest_lower_bound(identity,X0))),
inference(forward_demodulation,[],[f66193,f58007]) ).
fof(f58007,plain,
! [X0,X1] : least_upper_bound(identity,least_upper_bound(inverse(X0),X1)) = least_upper_bound(least_upper_bound(identity,X1),inverse(greatest_lower_bound(identity,X0))),
inference(forward_demodulation,[],[f57756,f8908]) ).
fof(f8908,plain,
! [X0,X1] : least_upper_bound(inverse(greatest_lower_bound(identity,X0)),X1) = least_upper_bound(identity,least_upper_bound(inverse(X0),X1)),
inference(superposition,[],[f7,f293]) ).
fof(f293,plain,
! [X0] : inverse(greatest_lower_bound(identity,X0)) = least_upper_bound(identity,inverse(X0)),
inference(superposition,[],[f19,f16]) ).
fof(f16,axiom,
identity = inverse(identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21x_1) ).
fof(f19,axiom,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = least_upper_bound(inverse(X0),inverse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21x_4) ).
fof(f57756,plain,
! [X0,X1] : least_upper_bound(inverse(greatest_lower_bound(identity,X0)),X1) = least_upper_bound(least_upper_bound(identity,X1),inverse(greatest_lower_bound(identity,X0))),
inference(superposition,[],[f13608,f324]) ).
fof(f324,plain,
! [X0] : identity = greatest_lower_bound(inverse(greatest_lower_bound(identity,X0)),identity),
inference(superposition,[],[f130,f293]) ).
fof(f130,plain,
! [X0,X1] : greatest_lower_bound(least_upper_bound(X0,X1),X0) = X0,
inference(superposition,[],[f80,f11]) ).
fof(f11,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',glb_absorbtion) ).
fof(f80,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f46,f4]) ).
fof(f4,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).
fof(f46,plain,
! [X0,X1] : greatest_lower_bound(X1,X0) = greatest_lower_bound(greatest_lower_bound(X1,X0),X0),
inference(superposition,[],[f33,f30]) ).
fof(f30,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f10,f4]) ).
fof(f10,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lub_absorbtion) ).
fof(f33,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[],[f11,f5]) ).
fof(f13608,plain,
! [X2,X0,X1] : least_upper_bound(X0,X2) = least_upper_bound(least_upper_bound(greatest_lower_bound(X0,X1),X2),X0),
inference(forward_demodulation,[],[f13536,f17]) ).
fof(f17,axiom,
! [X0] : inverse(inverse(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21x_2) ).
fof(f13536,plain,
! [X2,X0,X1] : least_upper_bound(least_upper_bound(greatest_lower_bound(X0,X1),X2),X0) = inverse(inverse(least_upper_bound(X0,X2))),
inference(superposition,[],[f2603,f8901]) ).
fof(f8901,plain,
! [X2,X0,X1] : least_upper_bound(X0,X2) = least_upper_bound(X0,least_upper_bound(greatest_lower_bound(X0,X1),X2)),
inference(superposition,[],[f7,f10]) ).
fof(f2603,plain,
! [X0,X1] : least_upper_bound(X1,X0) = inverse(inverse(least_upper_bound(X0,X1))),
inference(forward_demodulation,[],[f2602,f17]) ).
fof(f2602,plain,
! [X0,X1] : inverse(inverse(least_upper_bound(X0,X1))) = inverse(inverse(least_upper_bound(X1,X0))),
inference(forward_demodulation,[],[f2498,f20]) ).
fof(f20,axiom,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = greatest_lower_bound(inverse(X0),inverse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21x_5) ).
fof(f2498,plain,
! [X0,X1] : inverse(inverse(least_upper_bound(X0,X1))) = inverse(greatest_lower_bound(inverse(X1),inverse(X0))),
inference(superposition,[],[f2482,f20]) ).
fof(f2482,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = inverse(greatest_lower_bound(X1,X0)),
inference(forward_demodulation,[],[f2481,f261]) ).
fof(f261,plain,
! [X0] : multiply(X0,identity) = X0,
inference(forward_demodulation,[],[f256,f17]) ).
fof(f256,plain,
! [X0] : inverse(inverse(X0)) = multiply(X0,identity),
inference(superposition,[],[f17,f245]) ).
fof(f245,plain,
! [X0] : inverse(X0) = inverse(multiply(X0,identity)),
inference(forward_demodulation,[],[f237,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
fof(f237,plain,
! [X0] : inverse(multiply(X0,identity)) = multiply(identity,inverse(X0)),
inference(superposition,[],[f18,f16]) ).
fof(f18,axiom,
! [X0,X1] : inverse(multiply(X0,X1)) = multiply(inverse(X1),inverse(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p21x_3) ).
fof(f2481,plain,
! [X0,X1] : inverse(greatest_lower_bound(multiply(X0,identity),X1)) = inverse(greatest_lower_bound(X1,X0)),
inference(forward_demodulation,[],[f2440,f19]) ).
fof(f2440,plain,
! [X0,X1] : inverse(greatest_lower_bound(multiply(X0,identity),X1)) = least_upper_bound(inverse(X1),inverse(X0)),
inference(superposition,[],[f300,f245]) ).
fof(f300,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = least_upper_bound(inverse(X1),inverse(X0)),
inference(superposition,[],[f19,f5]) ).
fof(f66193,plain,
! [X0] : least_upper_bound(least_upper_bound(identity,X0),inverse(greatest_lower_bound(identity,X0))) = multiply(least_upper_bound(X0,identity),inverse(greatest_lower_bound(identity,X0))),
inference(superposition,[],[f65273,f24965]) ).
fof(f24965,plain,
! [X0] : least_upper_bound(identity,X0) = multiply(X0,inverse(greatest_lower_bound(identity,X0))),
inference(superposition,[],[f1958,f24725]) ).
fof(f24725,plain,
! [X0] : multiply(least_upper_bound(identity,X0),greatest_lower_bound(identity,X0)) = X0,
inference(superposition,[],[f24606,f5]) ).
fof(f24606,plain,
! [X0] : multiply(least_upper_bound(X0,identity),greatest_lower_bound(identity,X0)) = X0,
inference(superposition,[],[f1988,f23717]) ).
fof(f23717,plain,
! [X0] : least_upper_bound(X0,identity) = multiply(X0,inverse(greatest_lower_bound(identity,X0))),
inference(forward_demodulation,[],[f23716,f293]) ).
fof(f23716,plain,
! [X0] : least_upper_bound(X0,identity) = multiply(X0,least_upper_bound(identity,inverse(X0))),
inference(forward_demodulation,[],[f23584,f1891]) ).
fof(f1891,plain,
! [X0,X1] : inverse(X1) = multiply(X0,inverse(multiply(X1,X0))),
inference(forward_demodulation,[],[f1878,f17]) ).
fof(f1878,plain,
! [X0,X1] : inverse(X1) = multiply(inverse(inverse(X0)),inverse(multiply(X1,X0))),
inference(superposition,[],[f1845,f18]) ).
fof(f1845,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f1827,f1]) ).
fof(f1827,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
inference(superposition,[],[f3,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
fof(f3,axiom,
! [X2,X0,X1] : multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).
fof(f23584,plain,
! [X0,X1] : least_upper_bound(X0,identity) = multiply(X0,least_upper_bound(identity,multiply(X1,inverse(multiply(X0,X1))))),
inference(superposition,[],[f23336,f1837]) ).
fof(f1837,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,f17]) ).
fof(f23336,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f12,f261]) ).
fof(f12,axiom,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub1) ).
fof(f1988,plain,
! [X0,X1] : multiply(multiply(X1,inverse(X0)),X0) = X1,
inference(superposition,[],[f1958,f17]) ).
fof(f1958,plain,
! [X0,X1] : multiply(multiply(X0,X1),inverse(X1)) = X0,
inference(forward_demodulation,[],[f1934,f17]) ).
fof(f1934,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(multiply(X0,X1),inverse(X1)),
inference(superposition,[],[f1891,f1845]) ).
fof(f65273,plain,
! [X0,X1] : multiply(least_upper_bound(X1,identity),X0) = least_upper_bound(multiply(X1,X0),X0),
inference(superposition,[],[f14,f1]) ).
fof(f14,axiom,
! [X2,X0,X1] : multiply(least_upper_bound(X1,X2),X0) = least_upper_bound(multiply(X1,X0),multiply(X2,X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub2) ).
fof(f139098,plain,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(identity,a))) != least_upper_bound(identity,least_upper_bound(a,inverse(a))),
inference(forward_demodulation,[],[f139090,f62459]) ).
fof(f62459,plain,
! [X0] : least_upper_bound(identity,least_upper_bound(X0,inverse(X0))) = multiply(inverse(greatest_lower_bound(identity,X0)),least_upper_bound(X0,identity)),
inference(forward_demodulation,[],[f62458,f18548]) ).
fof(f62458,plain,
! [X0] : least_upper_bound(identity,least_upper_bound(inverse(X0),X0)) = multiply(inverse(greatest_lower_bound(identity,X0)),least_upper_bound(X0,identity)),
inference(forward_demodulation,[],[f62235,f13577]) ).
fof(f13577,plain,
! [X0,X1] : least_upper_bound(identity,least_upper_bound(inverse(X0),X1)) = least_upper_bound(inverse(greatest_lower_bound(identity,X0)),least_upper_bound(identity,X1)),
inference(forward_demodulation,[],[f13478,f8908]) ).
fof(f13478,plain,
! [X0,X1] : least_upper_bound(inverse(greatest_lower_bound(identity,X0)),X1) = least_upper_bound(inverse(greatest_lower_bound(identity,X0)),least_upper_bound(identity,X1)),
inference(superposition,[],[f8901,f324]) ).
fof(f62235,plain,
! [X0] : multiply(inverse(greatest_lower_bound(identity,X0)),least_upper_bound(X0,identity)) = least_upper_bound(inverse(greatest_lower_bound(identity,X0)),least_upper_bound(identity,X0)),
inference(superposition,[],[f39432,f42956]) ).
fof(f42956,plain,
! [X0] : least_upper_bound(identity,X0) = multiply(inverse(greatest_lower_bound(identity,X0)),X0),
inference(superposition,[],[f1845,f42599]) ).
fof(f42599,plain,
! [X0] : multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0)) = X0,
inference(superposition,[],[f42417,f4]) ).
fof(f42417,plain,
! [X0] : multiply(greatest_lower_bound(X0,identity),least_upper_bound(identity,X0)) = X0,
inference(superposition,[],[f1988,f40959]) ).
fof(f40959,plain,
! [X0] : greatest_lower_bound(X0,identity) = multiply(X0,inverse(least_upper_bound(identity,X0))),
inference(forward_demodulation,[],[f40958,f454]) ).
fof(f454,plain,
! [X0] : greatest_lower_bound(identity,inverse(X0)) = inverse(least_upper_bound(identity,X0)),
inference(superposition,[],[f17,f316]) ).
fof(f316,plain,
! [X0] : inverse(greatest_lower_bound(identity,inverse(X0))) = least_upper_bound(identity,X0),
inference(superposition,[],[f293,f17]) ).
fof(f40958,plain,
! [X0] : greatest_lower_bound(X0,identity) = multiply(X0,greatest_lower_bound(identity,inverse(X0))),
inference(forward_demodulation,[],[f40787,f1891]) ).
fof(f40787,plain,
! [X0,X1] : greatest_lower_bound(X0,identity) = multiply(X0,greatest_lower_bound(identity,multiply(X1,inverse(multiply(X0,X1))))),
inference(superposition,[],[f40509,f1837]) ).
fof(f40509,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f13,f261]) ).
fof(f13,axiom,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb1) ).
fof(f39432,plain,
! [X0,X1] : multiply(X0,least_upper_bound(X1,identity)) = least_upper_bound(X0,multiply(X0,X1)),
inference(superposition,[],[f23383,f5]) ).
fof(f23383,plain,
! [X0,X1] : multiply(X0,least_upper_bound(X1,identity)) = least_upper_bound(multiply(X0,X1),X0),
inference(superposition,[],[f12,f261]) ).
fof(f139090,plain,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(identity,a))) != multiply(inverse(greatest_lower_bound(identity,a)),least_upper_bound(a,identity)),
inference(superposition,[],[f21,f4]) ).
fof(f21,axiom,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p21x) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP184-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 30 04:15:11 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % (3202)Running in auto input_syntax mode. Trying TPTP
% 0.18/0.36 % (3205)WARNING: value z3 for option sas not known
% 0.18/0.36 % (3204)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.18/0.36 % (3207)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.18/0.36 % (3208)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.18/0.36 % (3206)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.18/0.36 % (3205)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.18/0.36 % (3209)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.18/0.36 TRYING [1]
% 0.18/0.36 % (3203)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.18/0.36 TRYING [2]
% 0.18/0.37 TRYING [3]
% 0.18/0.37 TRYING [1]
% 0.18/0.37 TRYING [2]
% 0.18/0.39 TRYING [4]
% 0.18/0.40 TRYING [3]
% 0.18/0.45 TRYING [4]
% 0.18/0.46 TRYING [5]
% 1.72/0.58 TRYING [5]
% 2.22/0.66 TRYING [6]
% 4.34/0.98 TRYING [6]
% 5.19/1.12 TRYING [7]
% 7.89/1.47 TRYING [1]
% 7.89/1.47 TRYING [2]
% 7.89/1.48 TRYING [3]
% 7.89/1.50 TRYING [4]
% 8.62/1.59 TRYING [5]
% 10.34/1.87 TRYING [6]
% 10.81/1.96 TRYING [7]
% 14.44/2.40 TRYING [8]
% 15.90/2.63 TRYING [7]
% 25.42/4.00 % (3209)First to succeed.
% 25.42/4.01 % (3209)Refutation found. Thanks to Tanya!
% 25.42/4.01 % SZS status Unsatisfiable for theBenchmark
% 25.42/4.01 % SZS output start Proof for theBenchmark
% See solution above
% 25.42/4.01 % (3209)------------------------------
% 25.42/4.01 % (3209)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 25.42/4.01 % (3209)Termination reason: Refutation
% 25.42/4.01
% 25.42/4.01 % (3209)Memory used [KB]: 30794
% 25.42/4.01 % (3209)Time elapsed: 3.642 s
% 25.42/4.01 % (3209)Instructions burned: 8397 (million)
% 25.42/4.01 % (3209)------------------------------
% 25.42/4.01 % (3209)------------------------------
% 25.42/4.01 % (3202)Success in time 3.642 s
%------------------------------------------------------------------------------