TSTP Solution File: GRP179-2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : GRP179-2 : TPTP v8.2.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n029.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 : Mon May 20 21:15:37 EDT 2024
% Result : Unsatisfiable 265.42s 38.31s
% Output : Refutation 265.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 14
% Syntax : Number of formulae : 123 ( 123 unt; 0 def)
% Number of atoms : 123 ( 122 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 242 ( 242 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1790788,plain,
$false,
inference(subsumption_resolution,[],[f1789958,f158987]) ).
fof(f158987,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = inverse(greatest_lower_bound(X1,X0)),
inference(forward_demodulation,[],[f158465,f1099]) ).
fof(f1099,plain,
! [X0,X1] : greatest_lower_bound(X1,X0) = least_upper_bound(greatest_lower_bound(X1,X0),greatest_lower_bound(X0,X1)),
inference(superposition,[],[f18,f1013]) ).
fof(f1013,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X1,X0)),
inference(superposition,[],[f6,f33]) ).
fof(f33,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(greatest_lower_bound(X0,X1),X0),
inference(superposition,[],[f21,f10]) ).
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(f21,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/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
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(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(f18,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(f158465,plain,
! [X0,X1] : inverse(greatest_lower_bound(X0,X1)) = inverse(least_upper_bound(greatest_lower_bound(X1,X0),greatest_lower_bound(X0,X1))),
inference(superposition,[],[f158122,f1099]) ).
fof(f158122,plain,
! [X0,X1] : inverse(least_upper_bound(X0,X1)) = inverse(least_upper_bound(X1,X0)),
inference(superposition,[],[f282,f157608]) ).
fof(f157608,plain,
! [X0,X1] : least_upper_bound(X1,X0) = inverse(inverse(least_upper_bound(X0,X1))),
inference(superposition,[],[f154314,f282]) ).
fof(f154314,plain,
! [X0,X1] : least_upper_bound(X0,inverse(X1)) = inverse(inverse(least_upper_bound(inverse(X1),X0))),
inference(forward_demodulation,[],[f153932,f235]) ).
fof(f235,plain,
! [X0] : multiply(inverse(identity),X0) = X0,
inference(superposition,[],[f232,f1]) ).
fof(f1,axiom,
! [X0] : multiply(identity,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).
fof(f232,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f230,f1]) ).
fof(f230,plain,
! [X0,X1] : multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
inference(superposition,[],[f3,f2]) ).
fof(f2,axiom,
! [X0] : identity = multiply(inverse(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_inverse) ).
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(f153932,plain,
! [X0,X1] : inverse(inverse(least_upper_bound(inverse(X1),X0))) = multiply(inverse(identity),least_upper_bound(X0,inverse(X1))),
inference(superposition,[],[f559,f104032]) ).
fof(f104032,plain,
! [X0,X1] : identity = multiply(least_upper_bound(X0,inverse(X1)),inverse(least_upper_bound(inverse(X1),X0))),
inference(forward_demodulation,[],[f103839,f71492]) ).
fof(f71492,plain,
! [X0,X1] : inverse(least_upper_bound(inverse(X0),X1)) = multiply(X0,inverse(least_upper_bound(identity,multiply(X1,X0)))),
inference(superposition,[],[f499,f25223]) ).
fof(f25223,plain,
! [X0,X1] : least_upper_bound(identity,multiply(X1,X0)) = multiply(least_upper_bound(inverse(X0),X1),X0),
inference(superposition,[],[f14,f2]) ).
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(f499,plain,
! [X0,X1] : inverse(X0) = multiply(X1,inverse(multiply(X0,X1))),
inference(forward_demodulation,[],[f451,f236]) ).
fof(f236,plain,
! [X0] : multiply(inverse(inverse(X0)),identity) = X0,
inference(superposition,[],[f232,f2]) ).
fof(f451,plain,
! [X0,X1] : multiply(inverse(inverse(inverse(X0))),identity) = multiply(X1,inverse(multiply(X0,X1))),
inference(superposition,[],[f266,f317]) ).
fof(f317,plain,
! [X0,X1] : identity = multiply(X0,multiply(X1,inverse(multiply(X0,X1)))),
inference(superposition,[],[f270,f3]) ).
fof(f270,plain,
! [X0] : identity = multiply(X0,inverse(X0)),
inference(superposition,[],[f238,f2]) ).
fof(f238,plain,
! [X0,X1] : multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
inference(superposition,[],[f232,f232]) ).
fof(f266,plain,
! [X0,X1] : multiply(inverse(inverse(inverse(X0))),multiply(X0,X1)) = X1,
inference(forward_demodulation,[],[f264,f1]) ).
fof(f264,plain,
! [X0,X1] : multiply(identity,X1) = multiply(inverse(inverse(inverse(X0))),multiply(X0,X1)),
inference(superposition,[],[f3,f245]) ).
fof(f245,plain,
! [X0] : identity = multiply(inverse(inverse(inverse(X0))),X0),
inference(superposition,[],[f232,f236]) ).
fof(f103839,plain,
! [X0,X1] : identity = multiply(least_upper_bound(X0,inverse(X1)),multiply(X1,inverse(least_upper_bound(identity,multiply(X0,X1))))),
inference(superposition,[],[f317,f25409]) ).
fof(f25409,plain,
! [X0,X1] : least_upper_bound(identity,multiply(X1,X0)) = multiply(least_upper_bound(X1,inverse(X0)),X0),
inference(forward_demodulation,[],[f25265,f5]) ).
fof(f25265,plain,
! [X0,X1] : multiply(least_upper_bound(X1,inverse(X0)),X0) = least_upper_bound(multiply(X1,X0),identity),
inference(superposition,[],[f14,f2]) ).
fof(f559,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(multiply(X1,X0)),X1),
inference(forward_demodulation,[],[f523,f282]) ).
fof(f523,plain,
! [X0,X1] : inverse(X0) = multiply(inverse(multiply(X1,X0)),inverse(inverse(X1))),
inference(superposition,[],[f499,f499]) ).
fof(f282,plain,
! [X0] : inverse(inverse(X0)) = X0,
inference(superposition,[],[f271,f236]) ).
fof(f271,plain,
! [X0] : multiply(X0,identity) = X0,
inference(superposition,[],[f238,f236]) ).
fof(f1789958,plain,
inverse(greatest_lower_bound(a,identity)) != inverse(greatest_lower_bound(identity,a)),
inference(superposition,[],[f16,f1787659]) ).
fof(f1787659,plain,
! [X0] : least_upper_bound(inverse(X0),identity) = inverse(greatest_lower_bound(identity,X0)),
inference(forward_demodulation,[],[f1787658,f271]) ).
fof(f1787658,plain,
! [X0] : least_upper_bound(inverse(X0),identity) = inverse(multiply(greatest_lower_bound(identity,X0),identity)),
inference(forward_demodulation,[],[f1787657,f45745]) ).
fof(f45745,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(f1787657,plain,
! [X0] : least_upper_bound(inverse(X0),identity) = inverse(greatest_lower_bound(identity,multiply(X0,identity))),
inference(forward_demodulation,[],[f1786807,f14438]) ).
fof(f14438,plain,
! [X2,X0] : greatest_lower_bound(identity,multiply(X0,X2)) = multiply(X0,greatest_lower_bound(X2,inverse(X0))),
inference(forward_demodulation,[],[f14437,f499]) ).
fof(f14437,plain,
! [X2,X0,X1] : greatest_lower_bound(identity,multiply(X0,X2)) = multiply(X0,greatest_lower_bound(X2,multiply(X1,inverse(multiply(X0,X1))))),
inference(forward_demodulation,[],[f14323,f4]) ).
fof(f14323,plain,
! [X2,X0,X1] : multiply(X0,greatest_lower_bound(X2,multiply(X1,inverse(multiply(X0,X1))))) = greatest_lower_bound(multiply(X0,X2),identity),
inference(superposition,[],[f13,f317]) ).
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/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).
fof(f1786807,plain,
! [X0] : least_upper_bound(inverse(X0),identity) = inverse(multiply(X0,greatest_lower_bound(identity,inverse(X0)))),
inference(superposition,[],[f1780273,f568]) ).
fof(f568,plain,
! [X0,X1] : inverse(multiply(X1,X0)) = multiply(inverse(X0),inverse(X1)),
inference(forward_demodulation,[],[f534,f282]) ).
fof(f534,plain,
! [X0,X1] : inverse(multiply(X1,X0)) = multiply(inverse(inverse(inverse(X0))),inverse(X1)),
inference(superposition,[],[f266,f499]) ).
fof(f1780273,plain,
! [X0] : least_upper_bound(X0,identity) = multiply(inverse(greatest_lower_bound(identity,X0)),X0),
inference(superposition,[],[f76558,f1778845]) ).
fof(f1778845,plain,
! [X0] : multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0)) = X0,
inference(forward_demodulation,[],[f1778844,f18]) ).
fof(f1778844,plain,
! [X0] : least_upper_bound(X0,greatest_lower_bound(identity,X0)) = multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0)),
inference(forward_demodulation,[],[f1777220,f1628575]) ).
fof(f1628575,plain,
! [X0,X1] : least_upper_bound(X1,greatest_lower_bound(identity,X0)) = least_upper_bound(X1,multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X1))),
inference(superposition,[],[f46148,f5683]) ).
fof(f5683,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(multiply(X0,X1),X0),
inference(forward_demodulation,[],[f5635,f2395]) ).
fof(f2395,plain,
! [X2,X0,X1] : multiply(X0,least_upper_bound(X1,X2)) = least_upper_bound(multiply(X0,X2),multiply(X0,least_upper_bound(X1,X2))),
inference(superposition,[],[f86,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/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
fof(f86,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X1,least_upper_bound(X0,X1)),
inference(superposition,[],[f35,f5]) ).
fof(f35,plain,
! [X0,X1] : least_upper_bound(X1,X0) = least_upper_bound(least_upper_bound(X1,X0),X0),
inference(superposition,[],[f18,f21]) ).
fof(f5635,plain,
! [X0,X1] : least_upper_bound(multiply(X0,X1),X0) = least_upper_bound(multiply(X0,X1),multiply(X0,least_upper_bound(identity,X1))),
inference(superposition,[],[f1249,f2420]) ).
fof(f2420,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f2419,f238]) ).
fof(f2419,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f2350,f238]) ).
fof(f2350,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),least_upper_bound(identity,X1)) = least_upper_bound(X0,multiply(inverse(inverse(X0)),X1)),
inference(superposition,[],[f12,f236]) ).
fof(f1249,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(X0,least_upper_bound(X1,X0)),
inference(superposition,[],[f7,f28]) ).
fof(f28,plain,
! [X0,X1] : least_upper_bound(X0,X1) = least_upper_bound(least_upper_bound(X0,X1),X0),
inference(superposition,[],[f18,f11]) ).
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/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
fof(f46148,plain,
! [X2,X0,X1] : least_upper_bound(X0,X2) = least_upper_bound(X0,least_upper_bound(multiply(greatest_lower_bound(identity,X1),X0),X2)),
inference(superposition,[],[f1236,f45745]) ).
fof(f1236,plain,
! [X2,X0,X1] : least_upper_bound(X0,X2) = least_upper_bound(X0,least_upper_bound(greatest_lower_bound(X0,X1),X2)),
inference(superposition,[],[f7,f10]) ).
fof(f1777220,plain,
! [X0] : multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0)) = least_upper_bound(X0,multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0))),
inference(superposition,[],[f171,f1775998]) ).
fof(f1775998,plain,
! [X0] : greatest_lower_bound(X0,multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0))) = X0,
inference(forward_demodulation,[],[f1774060,f86255]) ).
fof(f86255,plain,
! [X0] : multiply(least_upper_bound(X0,identity),greatest_lower_bound(X0,identity)) = multiply(greatest_lower_bound(identity,X0),least_upper_bound(identity,X0)),
inference(forward_demodulation,[],[f86085,f65287]) ).
fof(f65287,plain,
! [X2,X0,X1] : multiply(greatest_lower_bound(identity,X0),least_upper_bound(X1,X2)) = greatest_lower_bound(multiply(X0,least_upper_bound(X1,X2)),least_upper_bound(X2,X1)),
inference(superposition,[],[f8964,f46308]) ).
fof(f46308,plain,
! [X0,X1] : multiply(greatest_lower_bound(identity,X1),X0) = greatest_lower_bound(multiply(X1,X0),X0),
inference(forward_demodulation,[],[f46126,f45876]) ).
fof(f45876,plain,
! [X2,X0,X1] : multiply(greatest_lower_bound(X0,X2),X1) = greatest_lower_bound(multiply(X2,X1),multiply(greatest_lower_bound(X0,X2),X1)),
inference(superposition,[],[f72,f15]) ).
fof(f72,plain,
! [X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X1,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f34,f4]) ).
fof(f34,plain,
! [X0,X1] : greatest_lower_bound(X1,X0) = greatest_lower_bound(greatest_lower_bound(X1,X0),X0),
inference(superposition,[],[f21,f18]) ).
fof(f46126,plain,
! [X0,X1] : greatest_lower_bound(multiply(X1,X0),X0) = greatest_lower_bound(multiply(X1,X0),multiply(greatest_lower_bound(identity,X1),X0)),
inference(superposition,[],[f1013,f45745]) ).
fof(f8964,plain,
! [X2,X0,X1] : greatest_lower_bound(X2,least_upper_bound(X0,X1)) = greatest_lower_bound(X2,least_upper_bound(X1,X0)),
inference(forward_demodulation,[],[f8881,f1354]) ).
fof(f1354,plain,
! [X0,X1] : least_upper_bound(X1,X0) = greatest_lower_bound(least_upper_bound(X1,X0),least_upper_bound(X0,X1)),
inference(superposition,[],[f21,f1249]) ).
fof(f8881,plain,
! [X2,X0,X1] : greatest_lower_bound(X2,least_upper_bound(X0,X1)) = greatest_lower_bound(X2,greatest_lower_bound(least_upper_bound(X1,X0),least_upper_bound(X0,X1))),
inference(superposition,[],[f2769,f1354]) ).
fof(f2769,plain,
! [X2,X0,X1] : greatest_lower_bound(X1,greatest_lower_bound(X0,X2)) = greatest_lower_bound(X1,greatest_lower_bound(X2,X0)),
inference(superposition,[],[f1557,f1016]) ).
fof(f1016,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X2,greatest_lower_bound(X0,X1)),
inference(superposition,[],[f6,f4]) ).
fof(f1557,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,greatest_lower_bound(X0,X2)),
inference(superposition,[],[f1002,f6]) ).
fof(f1002,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(X1,X2)) = greatest_lower_bound(greatest_lower_bound(X1,X0),X2),
inference(superposition,[],[f6,f4]) ).
fof(f86085,plain,
! [X0] : greatest_lower_bound(multiply(X0,least_upper_bound(identity,X0)),least_upper_bound(X0,identity)) = multiply(least_upper_bound(X0,identity),greatest_lower_bound(X0,identity)),
inference(superposition,[],[f14430,f27054]) ).
fof(f27054,plain,
! [X0] : multiply(X0,least_upper_bound(identity,X0)) = multiply(least_upper_bound(X0,identity),X0),
inference(superposition,[],[f25264,f5683]) ).
fof(f25264,plain,
! [X0,X1] : multiply(least_upper_bound(X1,identity),X0) = least_upper_bound(multiply(X1,X0),X0),
inference(superposition,[],[f14,f1]) ).
fof(f14430,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(X1,identity)) = greatest_lower_bound(multiply(X0,X1),X0),
inference(forward_demodulation,[],[f14429,f238]) ).
fof(f14429,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),greatest_lower_bound(X1,identity)) = greatest_lower_bound(multiply(X0,X1),X0),
inference(forward_demodulation,[],[f14317,f238]) ).
fof(f14317,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),greatest_lower_bound(X1,identity)) = greatest_lower_bound(multiply(inverse(inverse(X0)),X1),X0),
inference(superposition,[],[f13,f236]) ).
fof(f1774060,plain,
! [X0] : greatest_lower_bound(X0,multiply(least_upper_bound(X0,identity),greatest_lower_bound(X0,identity))) = X0,
inference(superposition,[],[f188592,f17499]) ).
fof(f17499,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(X0,X1)) = multiply(X0,greatest_lower_bound(X1,identity)),
inference(forward_demodulation,[],[f17498,f16478]) ).
fof(f16478,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(X1,identity)) = multiply(multiply(X0,X1),greatest_lower_bound(identity,inverse(X1))),
inference(forward_demodulation,[],[f16377,f14430]) ).
fof(f16377,plain,
! [X0,X1] : greatest_lower_bound(multiply(X0,X1),X0) = multiply(multiply(X0,X1),greatest_lower_bound(identity,inverse(X1))),
inference(superposition,[],[f14406,f553]) ).
fof(f553,plain,
! [X0,X1] : multiply(multiply(X0,X1),inverse(X1)) = X0,
inference(forward_demodulation,[],[f518,f282]) ).
fof(f518,plain,
! [X0,X1] : inverse(inverse(X0)) = multiply(multiply(X0,X1),inverse(X1)),
inference(superposition,[],[f499,f232]) ).
fof(f14406,plain,
! [X0,X1] : multiply(X0,greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f14405,f238]) ).
fof(f14405,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(X0,X1)),
inference(forward_demodulation,[],[f14293,f238]) ).
fof(f14293,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),greatest_lower_bound(identity,X1)) = greatest_lower_bound(X0,multiply(inverse(inverse(X0)),X1)),
inference(superposition,[],[f13,f236]) ).
fof(f17498,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(X0,X1)) = multiply(multiply(X0,X1),greatest_lower_bound(identity,inverse(X1))),
inference(forward_demodulation,[],[f17368,f4]) ).
fof(f17368,plain,
! [X0,X1] : greatest_lower_bound(X0,multiply(X0,X1)) = multiply(multiply(X0,X1),greatest_lower_bound(inverse(X1),identity)),
inference(superposition,[],[f14430,f553]) ).
fof(f188592,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X0,X2),multiply(least_upper_bound(X1,identity),X0))) = X0,
inference(superposition,[],[f177795,f27211]) ).
fof(f27211,plain,
! [X0,X1] : multiply(least_upper_bound(X0,identity),X1) = least_upper_bound(X1,multiply(X0,X1)),
inference(forward_demodulation,[],[f27210,f25860]) ).
fof(f25860,plain,
! [X0,X1] : multiply(least_upper_bound(X0,identity),X1) = multiply(least_upper_bound(identity,inverse(X0)),multiply(X0,X1)),
inference(forward_demodulation,[],[f25719,f25264]) ).
fof(f25719,plain,
! [X0,X1] : least_upper_bound(multiply(X0,X1),X1) = multiply(least_upper_bound(identity,inverse(X0)),multiply(X0,X1)),
inference(superposition,[],[f25222,f232]) ).
fof(f25222,plain,
! [X0,X1] : multiply(least_upper_bound(identity,X1),X0) = least_upper_bound(X0,multiply(X1,X0)),
inference(superposition,[],[f14,f1]) ).
fof(f27210,plain,
! [X0,X1] : least_upper_bound(X1,multiply(X0,X1)) = multiply(least_upper_bound(identity,inverse(X0)),multiply(X0,X1)),
inference(forward_demodulation,[],[f27026,f5]) ).
fof(f27026,plain,
! [X0,X1] : least_upper_bound(X1,multiply(X0,X1)) = multiply(least_upper_bound(inverse(X0),identity),multiply(X0,X1)),
inference(superposition,[],[f25264,f232]) ).
fof(f177795,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X0,X1),least_upper_bound(X0,X2))) = X0,
inference(superposition,[],[f1020,f11]) ).
fof(f1020,plain,
! [X2,X0,X1] : greatest_lower_bound(X0,X1) = greatest_lower_bound(X0,greatest_lower_bound(X1,least_upper_bound(greatest_lower_bound(X0,X1),X2))),
inference(superposition,[],[f6,f11]) ).
fof(f171,plain,
! [X0,X1] : least_upper_bound(greatest_lower_bound(X1,X0),X0) = X0,
inference(superposition,[],[f86,f18]) ).
fof(f76558,plain,
! [X0,X1] : least_upper_bound(X1,identity) = multiply(inverse(X0),multiply(X0,least_upper_bound(identity,X1))),
inference(superposition,[],[f232,f17572]) ).
fof(f17572,plain,
! [X0,X1] : multiply(X0,least_upper_bound(identity,X1)) = multiply(X0,least_upper_bound(X1,identity)),
inference(superposition,[],[f5683,f2444]) ).
fof(f2444,plain,
! [X0,X1] : multiply(X0,least_upper_bound(X1,identity)) = least_upper_bound(multiply(X0,X1),X0),
inference(forward_demodulation,[],[f2443,f238]) ).
fof(f2443,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),least_upper_bound(X1,identity)) = least_upper_bound(multiply(X0,X1),X0),
inference(forward_demodulation,[],[f2371,f238]) ).
fof(f2371,plain,
! [X0,X1] : multiply(inverse(inverse(X0)),least_upper_bound(X1,identity)) = least_upper_bound(multiply(inverse(inverse(X0)),X1),X0),
inference(superposition,[],[f12,f236]) ).
fof(f16,axiom,
least_upper_bound(inverse(a),identity) != inverse(greatest_lower_bound(a,identity)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p18) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP179-2 : TPTP v8.2.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n029.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % 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 : Sun May 19 05:41:08 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.37 % (814)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.38 % (817)WARNING: value z3 for option sas not known
% 0.21/0.38 % (818)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.38 % (820)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 % (817)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 % (816)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.39 % (821)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.39 TRYING [1]
% 0.21/0.39 TRYING [2]
% 0.21/0.39 TRYING [3]
% 0.21/0.39 % (819)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.40 % (815)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.40 TRYING [1]
% 0.21/0.40 TRYING [2]
% 0.21/0.41 TRYING [4]
% 0.21/0.42 TRYING [3]
% 0.21/0.47 TRYING [4]
% 0.21/0.47 TRYING [5]
% 1.28/0.58 TRYING [5]
% 1.28/0.59 TRYING [6]
% 3.39/0.87 TRYING [6]
% 3.39/0.92 TRYING [7]
% 7.63/1.49 TRYING [1]
% 7.63/1.49 TRYING [2]
% 7.63/1.49 TRYING [3]
% 7.63/1.50 TRYING [4]
% 8.17/1.55 TRYING [5]
% 8.51/1.59 TRYING [8]
% 9.74/1.75 TRYING [6]
% 11.11/1.96 TRYING [7]
% 14.27/2.42 TRYING [7]
% 18.49/3.05 TRYING [9]
% 34.85/5.39 TRYING [8]
% 40.57/6.19 TRYING [8]
% 47.39/7.15 TRYING [10]
% 106.05/15.63 TRYING [11]
% 132.05/19.32 TRYING [9]
% 233.37/33.70 TRYING [12]
% 239.57/34.60 TRYING [9]
% 265.14/38.24 % (821)First to succeed.
% 265.42/38.28 % (821)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-814"
% 265.42/38.31 % (821)Refutation found. Thanks to Tanya!
% 265.42/38.31 % SZS status Unsatisfiable for theBenchmark
% 265.42/38.31 % SZS output start Proof for theBenchmark
% See solution above
% 265.42/38.31 % (821)------------------------------
% 265.42/38.31 % (821)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 265.42/38.31 % (821)Termination reason: Refutation
% 265.42/38.31
% 265.42/38.31 % (821)Memory used [KB]: 462676
% 265.42/38.31 % (821)Time elapsed: 37.897 s
% 265.42/38.31 % (821)Instructions burned: 125205 (million)
% 265.42/38.31 % (814)Success in time 37.796 s
%------------------------------------------------------------------------------