TSTP Solution File: GRP175-3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP175-3 : 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 : n020.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:01 EDT 2024
% Result : Unsatisfiable 1.49s 0.61s
% Output : Refutation 1.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 14 ( 14 unt; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 17 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12686,plain,
$false,
inference(subsumption_resolution,[],[f12685,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
fof(f12685,plain,
identity != multiply(inverse(a),a),
inference(forward_demodulation,[],[f12581,f5212]) ).
fof(f5212,plain,
! [X0] : greatest_lower_bound(X0,multiply(b,X0)) = X0,
inference(superposition,[],[f5146,f16]) ).
fof(f16,axiom,
b = least_upper_bound(identity,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p06c_1) ).
fof(f5146,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(least_upper_bound(identity,X1),X0)) = X0,
inference(superposition,[],[f11,f870]) ).
fof(f870,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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',monotony_lub2) ).
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(f12581,plain,
identity != multiply(inverse(a),greatest_lower_bound(a,multiply(b,a))),
inference(superposition,[],[f17,f732]) ).
fof(f732,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/sandbox2/benchmark/theBenchmark.p',monotony_glb1) ).
fof(f17,axiom,
identity != greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p06c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP175-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.03/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n020.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 04:29:32 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (5670)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.38 % (5673)WARNING: value z3 for option sas not known
% 0.21/0.38 % (5674)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.38 % (5671)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.38 % (5672)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.38 % (5675)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.21/0.38 % (5676)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.21/0.38 % (5673)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 % (5677)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.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.45 TRYING [4]
% 0.21/0.47 TRYING [5]
% 0.21/0.50 TRYING [1]
% 0.21/0.50 TRYING [2]
% 0.21/0.50 TRYING [3]
% 0.21/0.51 TRYING [4]
% 1.49/0.56 TRYING [5]
% 1.49/0.57 TRYING [5]
% 1.49/0.61 % (5673)First to succeed.
% 1.49/0.61 % (5673)Refutation found. Thanks to Tanya!
% 1.49/0.61 % SZS status Unsatisfiable for theBenchmark
% 1.49/0.61 % SZS output start Proof for theBenchmark
% See solution above
% 1.49/0.61 % (5673)------------------------------
% 1.49/0.61 % (5673)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 1.49/0.61 % (5673)Termination reason: Refutation
% 1.49/0.61
% 1.49/0.61 % (5673)Memory used [KB]: 4919
% 1.49/0.61 % (5673)Time elapsed: 0.234 s
% 1.49/0.61 % (5673)Instructions burned: 698 (million)
% 1.49/0.61 % (5673)------------------------------
% 1.49/0.61 % (5673)------------------------------
% 1.49/0.61 % (5670)Success in time 0.222 s
%------------------------------------------------------------------------------