TSTP Solution File: GRP190-1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP190-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 : n014.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:59 EDT 2024
% Result : Unsatisfiable 14.26s 2.39s
% Output : Refutation 14.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 35 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 : 53 ( 53 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f76368,plain,
$false,
inference(subsumption_resolution,[],[f76312,f17]) ).
fof(f17,axiom,
inverse(b) != least_upper_bound(inverse(a),inverse(b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p39a) ).
fof(f76312,plain,
inverse(b) = least_upper_bound(inverse(a),inverse(b)),
inference(superposition,[],[f824,f76168]) ).
fof(f76168,plain,
inverse(a) = greatest_lower_bound(inverse(a),inverse(b)),
inference(forward_demodulation,[],[f75882,f201]) ).
fof(f201,plain,
! [X0] : multiply(X0,identity) = X0,
inference(superposition,[],[f57,f55]) ).
fof(f55,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f43,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_inverse) ).
fof(f43,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f41,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_identity) ).
fof(f41,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,[],[f43,f43]) ).
fof(f75882,plain,
inverse(a) = greatest_lower_bound(inverse(a),multiply(inverse(b),identity)),
inference(superposition,[],[f11977,f32776]) ).
fof(f32776,plain,
identity = least_upper_bound(multiply(b,inverse(a)),identity),
inference(superposition,[],[f424,f32531]) ).
fof(f32531,plain,
identity = least_upper_bound(identity,multiply(b,inverse(a))),
inference(superposition,[],[f20123,f46]) ).
fof(f46,plain,
b = greatest_lower_bound(a,b),
inference(superposition,[],[f32,f4]) ).
fof(f4,axiom,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).
fof(f32,plain,
b = greatest_lower_bound(b,a),
inference(superposition,[],[f23,f16]) ).
fof(f16,axiom,
a = least_upper_bound(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p39a_1) ).
fof(f23,plain,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X1,X0)) = X0,
inference(superposition,[],[f11,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(f11,axiom,
! [X0,X1] : greatest_lower_bound(X0,least_upper_bound(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',glb_absorbtion) ).
fof(f20123,plain,
! [X0,X1] : identity = least_upper_bound(identity,multiply(greatest_lower_bound(X0,X1),inverse(X0))),
inference(superposition,[],[f999,f200]) ).
fof(f200,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f57,f2]) ).
fof(f999,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(f424,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(X0,least_upper_bound(X1,X0)),
inference(superposition,[],[f237,f5]) ).
fof(f237,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(f11977,plain,
! [X2,X0,X1] : greatest_lower_bound(X1,multiply(inverse(X0),least_upper_bound(multiply(X0,X1),X2))) = X1,
inference(superposition,[],[f355,f43]) ).
fof(f355,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(f824,plain,
! [X0,X1] : least_upper_bound(greatest_lower_bound(X1,X0),X0) = X0,
inference(superposition,[],[f424,f19]) ).
fof(f19,plain,
! [X0,X1] : least_upper_bound(X0,greatest_lower_bound(X1,X0)) = X0,
inference(superposition,[],[f10,f4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP190-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n014.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:42:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (11377)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (11381)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 % (11382)WARNING: value z3 for option sas not known
% 0.14/0.38 % (11380)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (11383)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (11382)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 % (11384)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 % (11385)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 % (11387)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 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.38 TRYING [3]
% 0.14/0.38 TRYING [1]
% 0.14/0.38 TRYING [2]
% 0.14/0.40 TRYING [3]
% 0.14/0.40 TRYING [4]
% 0.20/0.45 TRYING [4]
% 0.20/0.47 TRYING [5]
% 0.20/0.56 TRYING [5]
% 1.66/0.61 TRYING [6]
% 4.10/0.93 TRYING [6]
% 4.21/0.98 TRYING [7]
% 7.81/1.47 TRYING [1]
% 7.81/1.47 TRYING [2]
% 7.81/1.47 TRYING [3]
% 8.05/1.49 TRYING [4]
% 8.33/1.56 TRYING [5]
% 10.33/1.82 TRYING [6]
% 13.79/2.34 TRYING [8]
% 14.26/2.38 % (11382)First to succeed.
% 14.26/2.38 % (11382)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11377"
% 14.26/2.39 % (11382)Refutation found. Thanks to Tanya!
% 14.26/2.39 % SZS status Unsatisfiable for theBenchmark
% 14.26/2.39 % SZS output start Proof for theBenchmark
% See solution above
% 14.26/2.39 % (11382)------------------------------
% 14.26/2.39 % (11382)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 14.26/2.39 % (11382)Termination reason: Refutation
% 14.26/2.39
% 14.26/2.39 % (11382)Memory used [KB]: 25761
% 14.26/2.39 % (11382)Time elapsed: 2.005 s
% 14.26/2.39 % (11382)Instructions burned: 6368 (million)
% 14.26/2.39 % (11377)Success in time 1.999 s
%------------------------------------------------------------------------------