TSTP Solution File: GRP193-2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP193-2 : 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 : n015.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.33s 0.56s
% Output : Refutation 1.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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(f6752,plain,
$false,
inference(trivial_inequality_removal,[],[f6731]) ).
fof(f6731,plain,
greatest_lower_bound(a,c) != greatest_lower_bound(a,c),
inference(superposition,[],[f21,f6419]) ).
fof(f6419,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c),
inference(forward_demodulation,[],[f6418,f121]) ).
fof(f121,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(f6418,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(a,c)),
inference(backward_demodulation,[],[f1462,f6356]) ).
fof(f6356,plain,
! [X0] : greatest_lower_bound(X0,multiply(b,X0)) = X0,
inference(superposition,[],[f6282,f51]) ).
fof(f51,plain,
b = least_upper_bound(identity,b),
inference(superposition,[],[f43,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(f43,plain,
b = least_upper_bound(b,identity),
inference(superposition,[],[f29,f17]) ).
fof(f17,axiom,
identity = greatest_lower_bound(identity,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_9b_2) ).
fof(f29,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(f6282,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(least_upper_bound(identity,X1),X0)) = X0,
inference(superposition,[],[f11,f893]) ).
fof(f893,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(f1462,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,[],[f1461,f6]) ).
fof(f1461,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,greatest_lower_bound(greatest_lower_bound(a,c),multiply(b,c))),
inference(forward_demodulation,[],[f1446,f4]) ).
fof(f1446,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,[],[f23,f6]) ).
fof(f23,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)),
inference(backward_demodulation,[],[f22,f1]) ).
fof(f22,plain,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_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_9b_4) ).
fof(f20,axiom,
greatest_lower_bound(a,multiply(b,c)) = greatest_lower_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_9b_5) ).
fof(f21,axiom,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p8_9b) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP193-2 : 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 : n015.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:51:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % (18890)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (18893)WARNING: value z3 for option sas not known
% 0.14/0.37 % (18891)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37 % (18892)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37 % (18894)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37 % (18893)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.37 % (18895)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.37 % (18896)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.37 % (18897)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.37 TRYING [1]
% 0.14/0.37 TRYING [2]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [2]
% 0.14/0.39 TRYING [3]
% 0.20/0.40 TRYING [3]
% 0.20/0.40 TRYING [4]
% 0.20/0.42 TRYING [4]
% 0.20/0.45 TRYING [4]
% 0.20/0.46 TRYING [5]
% 1.20/0.51 TRYING [5]
% 1.33/0.56 TRYING [5]
% 1.33/0.56 % (18896)First to succeed.
% 1.33/0.56 % (18896)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18890"
% 1.33/0.56 % (18896)Refutation found. Thanks to Tanya!
% 1.33/0.56 % SZS status Unsatisfiable for theBenchmark
% 1.33/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 1.33/0.56 % (18896)------------------------------
% 1.33/0.56 % (18896)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 1.33/0.56 % (18896)Termination reason: Refutation
% 1.33/0.56
% 1.33/0.56 % (18896)Memory used [KB]: 3378
% 1.33/0.56 % (18896)Time elapsed: 0.192 s
% 1.33/0.56 % (18896)Instructions burned: 416 (million)
% 1.33/0.56 % (18890)Success in time 0.198 s
%------------------------------------------------------------------------------