TSTP Solution File: GRP170-4 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP170-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 : n028.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 : Sun May 5 05:53:52 EDT 2024
% Result : Unsatisfiable 36.70s 5.57s
% Output : Refutation 36.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 17
% Syntax : Number of formulae : 46 ( 46 unt; 0 def)
% Number of atoms : 46 ( 45 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 1 ( 1 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 72 ( 72 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f215519,plain,
$false,
inference(subsumption_resolution,[],[f215518,f18]) ).
fof(f18,axiom,
multiply(b,d) != least_upper_bound(multiply(a,c),multiply(b,d)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p03d) ).
fof(f215518,plain,
multiply(b,d) = least_upper_bound(multiply(a,c),multiply(b,d)),
inference(forward_demodulation,[],[f215099,f114]) ).
fof(f114,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(superposition,[],[f108,f108]) ).
fof(f108,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f106,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f106,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f3,f2]) ).
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(f215099,plain,
multiply(inverse(inverse(b)),d) = least_upper_bound(multiply(a,c),multiply(inverse(inverse(b)),d)),
inference(superposition,[],[f429,f105327]) ).
fof(f105327,plain,
d = least_upper_bound(multiply(inverse(b),multiply(a,c)),d),
inference(forward_demodulation,[],[f105191,f37]) ).
fof(f37,plain,
d = least_upper_bound(c,d),
inference(superposition,[],[f30,f5]) ).
fof(f5,axiom,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
fof(f30,plain,
d = least_upper_bound(d,c),
inference(superposition,[],[f21,f17]) ).
fof(f17,axiom,
c = greatest_lower_bound(c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03d_2) ).
fof(f21,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f10,f4]) ).
fof(f4,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
fof(f10,axiom,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
fof(f105191,plain,
least_upper_bound(c,d) = least_upper_bound(multiply(inverse(b),multiply(a,c)),d),
inference(superposition,[],[f6160,f96482]) ).
fof(f96482,plain,
! [X0] : least_upper_bound(X0,multiply(inverse(b),multiply(a,X0))) = X0,
inference(superposition,[],[f19029,f782]) ).
fof(f782,plain,
a = greatest_lower_bound(b,a),
inference(superposition,[],[f395,f23]) ).
fof(f23,plain,
a = greatest_lower_bound(a,b),
inference(superposition,[],[f11,f16]) ).
fof(f16,axiom,
b = least_upper_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p03d_1) ).
fof(f11,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
fof(f395,plain,
! [X0,X1] : greatest_lower_bound(X1,X0) = greatest_lower_bound(X0,greatest_lower_bound(X1,X0)),
inference(superposition,[],[f200,f4]) ).
fof(f200,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f6,f9]) ).
fof(f9,axiom,
! [X0] : greatest_lower_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_gld) ).
fof(f6,axiom,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X0,X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_glb) ).
fof(f19029,plain,
! [X2,X0,X1] : least_upper_bound(X2,multiply(inverse(X0),multiply(greatest_lower_bound(X0,X1),X2))) = X2,
inference(forward_demodulation,[],[f19028,f1]) ).
fof(f19028,plain,
! [X2,X0,X1] : multiply(identity,X2) = least_upper_bound(multiply(identity,X2),multiply(inverse(X0),multiply(greatest_lower_bound(X0,X1),X2))),
inference(forward_demodulation,[],[f18874,f3]) ).
fof(f18874,plain,
! [X2,X0,X1] : multiply(identity,X2) = least_upper_bound(multiply(identity,X2),multiply(multiply(inverse(X0),greatest_lower_bound(X0,X1)),X2)),
inference(superposition,[],[f1092,f659]) ).
fof(f659,plain,
! [X0,X1] : multiply(inverse(X0),greatest_lower_bound(X0,X1)) = greatest_lower_bound(identity,multiply(inverse(X0),X1)),
inference(superposition,[],[f13,f2]) ).
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/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).
fof(f1092,plain,
! [X2,X0,X1] : multiply(X0,X1) = least_upper_bound(multiply(X0,X1),multiply(greatest_lower_bound(X0,X2),X1)),
inference(superposition,[],[f10,f15]) ).
fof(f15,axiom,
! [X2,X0,X1] : multiply(greatest_lower_bound(X1,X2),X0) = greatest_lower_bound(multiply(X1,X0),multiply(X2,X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb2) ).
fof(f6160,plain,
! [X0] : least_upper_bound(X0,d) = least_upper_bound(least_upper_bound(c,X0),d),
inference(forward_demodulation,[],[f6140,f483]) ).
fof(f483,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X0,least_upper_bound(X1,X0)),
inference(superposition,[],[f289,f5]) ).
fof(f289,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X0,least_upper_bound(X0,X1)),
inference(superposition,[],[f7,f8]) ).
fof(f8,axiom,
! [X0] : least_upper_bound(X0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_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/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f6140,plain,
! [X0] : least_upper_bound(least_upper_bound(c,X0),d) = least_upper_bound(d,least_upper_bound(X0,d)),
inference(superposition,[],[f5403,f5447]) ).
fof(f5447,plain,
! [X0] : least_upper_bound(d,least_upper_bound(c,X0)) = least_upper_bound(X0,d),
inference(superposition,[],[f304,f30]) ).
fof(f304,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(f5403,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X0,least_upper_bound(X0,X1)),
inference(superposition,[],[f304,f8]) ).
fof(f429,plain,
! [X2,X0,X1] : multiply(inverse(X0),least_upper_bound(multiply(X0,X1),X2)) = least_upper_bound(X1,multiply(inverse(X0),X2)),
inference(superposition,[],[f12,f108]) ).
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/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP170-4 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 20:46:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.36 % (24225)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (24228)WARNING: value z3 for option sas not known
% 0.15/0.38 % (24229)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (24226)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (24231)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 % (24232)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 % (24230)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 % (24227)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 % (24228)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.21/0.38 TRYING [1]
% 0.21/0.38 TRYING [2]
% 0.21/0.38 TRYING [3]
% 0.21/0.38 TRYING [1]
% 0.21/0.38 TRYING [2]
% 0.21/0.40 TRYING [3]
% 0.21/0.40 TRYING [4]
% 0.21/0.46 TRYING [4]
% 0.21/0.47 TRYING [5]
% 1.47/0.59 TRYING [6]
% 2.03/0.67 TRYING [5]
% 3.57/0.92 TRYING [7]
% 7.88/1.48 TRYING [1]
% 7.88/1.48 TRYING [2]
% 7.88/1.48 TRYING [3]
% 7.88/1.49 TRYING [4]
% 8.35/1.54 TRYING [5]
% 9.39/1.72 TRYING [6]
% 9.39/1.74 TRYING [8]
% 14.10/2.37 TRYING [7]
% 14.77/2.48 TRYING [6]
% 27.15/4.22 TRYING [9]
% 32.50/4.99 TRYING [8]
% 36.28/5.56 % (24228)First to succeed.
% 36.28/5.56 % (24228)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-24225"
% 36.70/5.57 % (24228)Refutation found. Thanks to Tanya!
% 36.70/5.57 % SZS status Unsatisfiable for theBenchmark
% 36.70/5.57 % SZS output start Proof for theBenchmark
% See solution above
% 36.70/5.57 % (24228)------------------------------
% 36.70/5.57 % (24228)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 36.70/5.57 % (24228)Termination reason: Refutation
% 36.70/5.57
% 36.70/5.57 % (24228)Memory used [KB]: 73377
% 36.70/5.57 % (24228)Time elapsed: 5.184 s
% 36.70/5.57 % (24228)Instructions burned: 25923 (million)
% 36.70/5.57 % (24225)Success in time 5.144 s
%------------------------------------------------------------------------------