TSTP Solution File: GRP167-5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP167-5 : 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 : Sun May 5 05:53:50 EDT 2024
% Result : Unsatisfiable 0.22s 0.51s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 31 unt; 0 def)
% Number of atoms : 31 ( 30 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 : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 38 ( 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f6876,plain,
$false,
inference(trivial_inequality_removal,[],[f6860]) ).
fof(f6860,plain,
a != a,
inference(superposition,[],[f21,f6820]) ).
fof(f6820,plain,
! [X0] : multiply(positive_part(X0),negative_part(X0)) = X0,
inference(forward_demodulation,[],[f6796,f2266]) ).
fof(f2266,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f2235,f285]) ).
fof(f285,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f207,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
fof(f207,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f205,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f205,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/sandbox/benchmark/theBenchmark.p',associativity) ).
fof(f2235,plain,
! [X0] : multiply(X0,identity) = X0,
inference(superposition,[],[f287,f285]) ).
fof(f287,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(superposition,[],[f207,f207]) ).
fof(f6796,plain,
! [X0] : multiply(inverse(inverse(positive_part(X0))),negative_part(X0)) = X0,
inference(superposition,[],[f207,f6573]) ).
fof(f6573,plain,
! [X0] : negative_part(X0) = multiply(inverse(positive_part(X0)),X0),
inference(forward_demodulation,[],[f6572,f18]) ).
fof(f18,axiom,
! [X0] : negative_part(X0) = greatest_lower_bound(X0,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_2) ).
fof(f6572,plain,
! [X0] : greatest_lower_bound(X0,identity) = multiply(inverse(positive_part(X0)),X0),
inference(forward_demodulation,[],[f6525,f312]) ).
fof(f312,plain,
! [X0] : negative_part(inverse(X0)) = inverse(positive_part(X0)),
inference(forward_demodulation,[],[f311,f17]) ).
fof(f17,axiom,
! [X0] : positive_part(X0) = least_upper_bound(X0,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_1) ).
fof(f311,plain,
! [X0] : inverse(least_upper_bound(X0,identity)) = negative_part(inverse(X0)),
inference(forward_demodulation,[],[f307,f18]) ).
fof(f307,plain,
! [X0] : inverse(least_upper_bound(X0,identity)) = greatest_lower_bound(inverse(X0),identity),
inference(superposition,[],[f16,f297]) ).
fof(f297,plain,
identity = inverse(identity),
inference(superposition,[],[f292,f2]) ).
fof(f292,plain,
! [X0] : multiply(inverse(inverse(identity)),X0) = X0,
inference(superposition,[],[f207,f284]) ).
fof(f284,plain,
! [X0] : multiply(inverse(identity),X0) = X0,
inference(superposition,[],[f207,f1]) ).
fof(f16,axiom,
! [X3,X4] : inverse(least_upper_bound(X3,X4)) = greatest_lower_bound(inverse(X3),inverse(X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10) ).
fof(f6525,plain,
! [X0] : greatest_lower_bound(X0,identity) = multiply(negative_part(inverse(X0)),X0),
inference(superposition,[],[f1368,f2]) ).
fof(f1368,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(X1,X0)) = multiply(negative_part(X1),X0),
inference(forward_demodulation,[],[f1339,f26]) ).
fof(f26,plain,
! [X0] : negative_part(X0) = greatest_lower_bound(identity,X0),
inference(superposition,[],[f4,f18]) ).
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(f1339,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f15,f1]) ).
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/sandbox/benchmark/theBenchmark.p',monotony_glb2) ).
fof(f21,axiom,
a != multiply(positive_part(a),negative_part(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lat4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP167-5 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.08/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:55:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (24670)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (24675)WARNING: value z3 for option sas not known
% 0.15/0.38 % (24674)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (24673)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (24677)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (24675)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.38 % (24678)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.38 % (24679)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.38 % (24680)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.38 TRYING [1]
% 0.15/0.38 TRYING [2]
% 0.15/0.39 TRYING [3]
% 0.15/0.39 TRYING [1]
% 0.15/0.39 TRYING [2]
% 0.22/0.41 TRYING [3]
% 0.22/0.42 TRYING [4]
% 0.22/0.48 TRYING [4]
% 0.22/0.49 TRYING [5]
% 0.22/0.51 % (24675)First to succeed.
% 0.22/0.51 % (24675)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-24670"
% 0.22/0.51 % (24675)Refutation found. Thanks to Tanya!
% 0.22/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.22/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.51 % (24675)------------------------------
% 0.22/0.51 % (24675)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.51 % (24675)Termination reason: Refutation
% 0.22/0.51
% 0.22/0.51 % (24675)Memory used [KB]: 2927
% 0.22/0.51 % (24675)Time elapsed: 0.130 s
% 0.22/0.51 % (24675)Instructions burned: 316 (million)
% 0.22/0.51 % (24670)Success in time 0.146 s
%------------------------------------------------------------------------------