TSTP Solution File: GRP191-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP191-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 : n019.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 17.56s 2.86s
% Output : Refutation 17.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 28 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f78174,plain,
$false,
inference(subsumption_resolution,[],[f78173,f17]) ).
fof(f17,axiom,
inverse(a) != greatest_lower_bound(inverse(a),inverse(b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p39b) ).
fof(f78173,plain,
inverse(a) = greatest_lower_bound(inverse(a),inverse(b)),
inference(forward_demodulation,[],[f77884,f320]) ).
fof(f320,plain,
! [X0] : multiply(X0,identity) = X0,
inference(superposition,[],[f57,f55]) ).
fof(f55,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f37,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
fof(f37,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f35,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
fof(f35,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f3,f2]) ).
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(f57,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(superposition,[],[f37,f37]) ).
fof(f77884,plain,
inverse(a) = greatest_lower_bound(inverse(a),multiply(inverse(b),identity)),
inference(superposition,[],[f12153,f27126]) ).
fof(f27126,plain,
identity = least_upper_bound(multiply(b,inverse(a)),identity),
inference(superposition,[],[f281,f27027]) ).
fof(f27027,plain,
identity = least_upper_bound(identity,multiply(b,inverse(a))),
inference(superposition,[],[f19748,f319]) ).
fof(f319,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f57,f2]) ).
fof(f19748,plain,
! [X0] : multiply(a,X0) = least_upper_bound(multiply(a,X0),multiply(b,X0)),
inference(superposition,[],[f1058,f16]) ).
fof(f16,axiom,
b = greatest_lower_bound(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p39b_1) ).
fof(f1058,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/sandbox2/benchmark/theBenchmark.p',monotony_glb2) ).
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(f281,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X0,least_upper_bound(X1,X0)),
inference(superposition,[],[f247,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(f247,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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f12153,plain,
! [X2,X0,X1] : greatest_lower_bound(X1,multiply(inverse(X0),least_upper_bound(multiply(X0,X1),X2))) = X1,
inference(superposition,[],[f412,f37]) ).
fof(f412,plain,
! [X2,X0,X1] : multiply(X0,X1) = greatest_lower_bound(multiply(X0,X1),multiply(X0,least_upper_bound(X1,X2))),
inference(superposition,[],[f11,f12]) ).
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(f11,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',glb_absorbtion) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GRP191-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.09/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 20:46:37 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 % (21682)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.33 % (21685)WARNING: value z3 for option sas not known
% 0.15/0.33 % (21685)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.15/0.33 % (21683)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.33 % (21687)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.33 % (21686)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.33 % (21684)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.33 % (21688)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.33 % (21689)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.33 TRYING [1]
% 0.15/0.33 TRYING [2]
% 0.15/0.33 TRYING [3]
% 0.15/0.33 TRYING [1]
% 0.15/0.33 TRYING [2]
% 0.15/0.35 TRYING [3]
% 0.15/0.35 TRYING [4]
% 0.15/0.39 TRYING [4]
% 0.15/0.41 TRYING [5]
% 0.15/0.53 TRYING [5]
% 0.15/0.59 TRYING [6]
% 5.31/1.16 TRYING [6]
% 6.10/1.18 TRYING [7]
% 7.54/1.43 TRYING [1]
% 7.54/1.43 TRYING [2]
% 7.54/1.43 TRYING [3]
% 7.99/1.46 TRYING [4]
% 8.45/1.54 TRYING [5]
% 10.31/1.83 TRYING [6]
% 14.88/2.45 TRYING [8]
% 16.98/2.75 TRYING [7]
% 17.56/2.86 % (21685)First to succeed.
% 17.56/2.86 % (21685)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21682"
% 17.56/2.86 % (21685)Refutation found. Thanks to Tanya!
% 17.56/2.86 % SZS status Unsatisfiable for theBenchmark
% 17.56/2.86 % SZS output start Proof for theBenchmark
% See solution above
% 17.56/2.86 % (21685)------------------------------
% 17.56/2.86 % (21685)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 17.56/2.86 % (21685)Termination reason: Refutation
% 17.56/2.86
% 17.56/2.86 % (21685)Memory used [KB]: 26167
% 17.56/2.86 % (21685)Time elapsed: 2.533 s
% 17.56/2.86 % (21685)Instructions burned: 6526 (million)
% 17.56/2.86 % (21682)Success in time 2.541 s
%------------------------------------------------------------------------------