TSTP Solution File: GRP158-1 by Metis---2.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Metis---2.4
% Problem : GRP158-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : metis --show proof --show saturation %s
% Computer : n009.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 : 600s
% DateTime : Sat Jul 16 10:37:05 EDT 2022
% Result : Unsatisfiable 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 23 ( 12 unt; 0 nHn; 20 RR)
% Number of literals : 40 ( 39 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(monotony_glb1,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ).
cnf(ax_mono2b_1,hypothesis,
greatest_lower_bound(a,b) = a ).
cnf(prove_ax_mono2b,negated_conjecture,
greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,a) ).
cnf(refute_0_0,plain,
multiply(c,greatest_lower_bound(a,b)) = multiply(c,greatest_lower_bound(a,b)),
introduced(tautology,[refl,[$fot(multiply(c,greatest_lower_bound(a,b)))]]) ).
cnf(refute_0_1,plain,
( multiply(c,greatest_lower_bound(a,b)) != multiply(c,greatest_lower_bound(a,b))
| greatest_lower_bound(a,b) != a
| multiply(c,greatest_lower_bound(a,b)) = multiply(c,a) ),
introduced(tautology,[equality,[$cnf( $equal(multiply(c,greatest_lower_bound(a,b)),multiply(c,greatest_lower_bound(a,b))) ),[1,1],$fot(a)]]) ).
cnf(refute_0_2,plain,
( greatest_lower_bound(a,b) != a
| multiply(c,greatest_lower_bound(a,b)) = multiply(c,a) ),
inference(resolve,[$cnf( $equal(multiply(c,greatest_lower_bound(a,b)),multiply(c,greatest_lower_bound(a,b))) )],[refute_0_0,refute_0_1]) ).
cnf(refute_0_3,plain,
multiply(c,greatest_lower_bound(a,b)) = multiply(c,a),
inference(resolve,[$cnf( $equal(greatest_lower_bound(a,b),a) )],[ax_mono2b_1,refute_0_2]) ).
cnf(refute_0_4,plain,
X0 = X0,
introduced(tautology,[refl,[$fot(X0)]]) ).
cnf(refute_0_5,plain,
( X0 != X0
| X0 != Y0
| Y0 = X0 ),
introduced(tautology,[equality,[$cnf( $equal(X0,X0) ),[0],$fot(Y0)]]) ).
cnf(refute_0_6,plain,
( X0 != Y0
| Y0 = X0 ),
inference(resolve,[$cnf( $equal(X0,X0) )],[refute_0_4,refute_0_5]) ).
cnf(refute_0_7,plain,
( multiply(X,greatest_lower_bound(Y,Z)) != greatest_lower_bound(multiply(X,Y),multiply(X,Z))
| greatest_lower_bound(multiply(X,Y),multiply(X,Z)) = multiply(X,greatest_lower_bound(Y,Z)) ),
inference(subst,[],[refute_0_6:[bind(X0,$fot(multiply(X,greatest_lower_bound(Y,Z)))),bind(Y0,$fot(greatest_lower_bound(multiply(X,Y),multiply(X,Z))))]]) ).
cnf(refute_0_8,plain,
greatest_lower_bound(multiply(X,Y),multiply(X,Z)) = multiply(X,greatest_lower_bound(Y,Z)),
inference(resolve,[$cnf( $equal(multiply(X,greatest_lower_bound(Y,Z)),greatest_lower_bound(multiply(X,Y),multiply(X,Z))) )],[monotony_glb1,refute_0_7]) ).
cnf(refute_0_9,plain,
greatest_lower_bound(multiply(c,a),multiply(c,b)) = multiply(c,greatest_lower_bound(a,b)),
inference(subst,[],[refute_0_8:[bind(X,$fot(c)),bind(Y,$fot(a)),bind(Z,$fot(b))]]) ).
cnf(refute_0_10,plain,
( Y0 != X0
| Y0 != Z0
| X0 = Z0 ),
introduced(tautology,[equality,[$cnf( $equal(Y0,Z0) ),[0],$fot(X0)]]) ).
cnf(refute_0_11,plain,
( X0 != Y0
| Y0 != Z0
| X0 = Z0 ),
inference(resolve,[$cnf( $equal(Y0,X0) )],[refute_0_6,refute_0_10]) ).
cnf(refute_0_12,plain,
( multiply(c,greatest_lower_bound(a,b)) != multiply(c,a)
| greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,greatest_lower_bound(a,b))
| greatest_lower_bound(multiply(c,a),multiply(c,b)) = multiply(c,a) ),
inference(subst,[],[refute_0_11:[bind(X0,$fot(greatest_lower_bound(multiply(c,a),multiply(c,b)))),bind(Y0,$fot(multiply(c,greatest_lower_bound(a,b)))),bind(Z0,$fot(multiply(c,a)))]]) ).
cnf(refute_0_13,plain,
( multiply(c,greatest_lower_bound(a,b)) != multiply(c,a)
| greatest_lower_bound(multiply(c,a),multiply(c,b)) = multiply(c,a) ),
inference(resolve,[$cnf( $equal(greatest_lower_bound(multiply(c,a),multiply(c,b)),multiply(c,greatest_lower_bound(a,b))) )],[refute_0_9,refute_0_12]) ).
cnf(refute_0_14,plain,
greatest_lower_bound(multiply(c,a),multiply(c,b)) = multiply(c,a),
inference(resolve,[$cnf( $equal(multiply(c,greatest_lower_bound(a,b)),multiply(c,a)) )],[refute_0_3,refute_0_13]) ).
cnf(refute_0_15,plain,
( multiply(c,a) != multiply(c,a)
| greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,a)
| greatest_lower_bound(multiply(c,a),multiply(c,b)) = multiply(c,a) ),
introduced(tautology,[equality,[$cnf( $equal(greatest_lower_bound(multiply(c,a),multiply(c,b)),multiply(c,a)) ),[0,0],$fot(multiply(c,a))]]) ).
cnf(refute_0_16,plain,
( multiply(c,a) != multiply(c,a)
| greatest_lower_bound(multiply(c,a),multiply(c,b)) = multiply(c,a) ),
inference(resolve,[$cnf( $equal(greatest_lower_bound(multiply(c,a),multiply(c,b)),multiply(c,a)) )],[refute_0_14,refute_0_15]) ).
cnf(refute_0_17,plain,
multiply(c,a) != multiply(c,a),
inference(resolve,[$cnf( $equal(greatest_lower_bound(multiply(c,a),multiply(c,b)),multiply(c,a)) )],[refute_0_16,prove_ax_mono2b]) ).
cnf(refute_0_18,plain,
multiply(c,a) = multiply(c,a),
introduced(tautology,[refl,[$fot(multiply(c,a))]]) ).
cnf(refute_0_19,plain,
$false,
inference(resolve,[$cnf( $equal(multiply(c,a),multiply(c,a)) )],[refute_0_18,refute_0_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP158-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : metis --show proof --show saturation %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 08:18:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 0.13/0.36 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.36
% 0.13/0.36 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 0.13/0.36
%------------------------------------------------------------------------------