TSTP Solution File: GRP193-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP193-1 : 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 : n007.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:54:00 EDT 2024
% Result : Unsatisfiable 1.74s 0.60s
% Output : Refutation 1.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 24 ( 24 unt; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 1 ( 1 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 25 ( 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f11955,plain,
$false,
inference(subsumption_resolution,[],[f11954,f21]) ).
fof(f21,axiom,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p8_9a) ).
fof(f11954,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
inference(forward_demodulation,[],[f11953,f184]) ).
fof(f184,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(f11953,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(a,c)),
inference(forward_demodulation,[],[f11952,f8799]) ).
fof(f8799,plain,
! [X0] : greatest_lower_bound(X0,multiply(b,X0)) = X0,
inference(superposition,[],[f8711,f17]) ).
fof(f17,axiom,
b = least_upper_bound(identity,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9a_2) ).
fof(f8711,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(least_upper_bound(identity,X1),X0)) = X0,
inference(superposition,[],[f11,f815]) ).
fof(f815,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f14,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
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/sandbox/benchmark/theBenchmark.p',monotony_lub2) ).
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(f11952,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(a,greatest_lower_bound(c,multiply(b,c)))),
inference(forward_demodulation,[],[f11951,f199]) ).
fof(f199,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X2,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f6,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(f11951,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(c,greatest_lower_bound(multiply(b,c),a))),
inference(forward_demodulation,[],[f11755,f199]) ).
fof(f11755,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,c))),
inference(superposition,[],[f201,f1198]) ).
fof(f1198,plain,
greatest_lower_bound(a,c) = least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)),
inference(forward_demodulation,[],[f1197,f1]) ).
fof(f1197,plain,
multiply(identity,greatest_lower_bound(a,c)) = least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(identity,greatest_lower_bound(a,c))),
inference(forward_demodulation,[],[f20,f19]) ).
fof(f19,axiom,
identity = greatest_lower_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9a_4) ).
fof(f20,axiom,
multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)) = least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9a_5) ).
fof(f201,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X1,least_upper_bound(greatest_lower_bound(X0,X1),X2))),
inference(superposition,[],[f6,f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP193-1 : 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.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 20:38:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (23643)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (23647)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37 TRYING [1]
% 0.14/0.37 TRYING [2]
% 0.14/0.37 TRYING [3]
% 0.14/0.37 % (23646)WARNING: value z3 for option sas not known
% 0.14/0.38 % (23645)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (23646)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.14/0.38 % (23648)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.14/0.38 % (23649)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.14/0.38 % (23650)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.14/0.38 % (23644)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [4]
% 0.14/0.39 TRYING [2]
% 0.21/0.41 TRYING [3]
% 0.21/0.43 TRYING [5]
% 0.21/0.46 TRYING [4]
% 0.21/0.46 TRYING [1]
% 0.21/0.46 TRYING [2]
% 0.21/0.47 TRYING [3]
% 0.21/0.49 TRYING [4]
% 0.21/0.56 TRYING [5]
% 0.21/0.56 TRYING [6]
% 0.21/0.58 TRYING [5]
% 1.74/0.59 % (23646)First to succeed.
% 1.74/0.59 % (23646)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-23643"
% 1.74/0.60 % (23646)Refutation found. Thanks to Tanya!
% 1.74/0.60 % SZS status Unsatisfiable for theBenchmark
% 1.74/0.60 % SZS output start Proof for theBenchmark
% See solution above
% 1.74/0.60 % (23646)------------------------------
% 1.74/0.60 % (23646)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.74/0.60 % (23646)Termination reason: Refutation
% 1.74/0.60
% 1.74/0.60 % (23646)Memory used [KB]: 4587
% 1.74/0.60 % (23646)Time elapsed: 0.220 s
% 1.74/0.60 % (23646)Instructions burned: 607 (million)
% 1.74/0.60 % (23643)Success in time 0.219 s
%------------------------------------------------------------------------------