TSTP Solution File: GRP159-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP159-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n016.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 : Tue Jul 26 07:02:14 EDT 2022
% Result : Unsatisfiable 0.39s 0.58s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 5 RR)
% Number of literals : 11 ( 10 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_4260') ).
cnf(eq_1,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_4260') ).
cnf(eq_2,axiom,
X = least_upper_bound(X,greatest_lower_bound(X,Y)),
file('/tmp/MaedMax_4260') ).
cnf(eq_3,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_4260') ).
cnf(eq_4,axiom,
greatest_lower_bound(a,b) = a,
file('/tmp/MaedMax_4260') ).
cnf(eq_5,negated_conjecture,
multiply(c,b) != least_upper_bound(multiply(c,a),multiply(c,b)),
file('/tmp/MaedMax_4260') ).
cnf(eq_6,plain,
least_upper_bound(Y,greatest_lower_bound(X,Y)) = Y,
inference(cp,[status(thm)],[eq_0,eq_2]) ).
cnf(eq_7,plain,
X = least_upper_bound(X,greatest_lower_bound(Y,X)),
eq_6 ).
cnf(eq_8,plain,
least_upper_bound(b,a) = b,
inference(cp,[status(thm)],[eq_4,eq_7]) ).
cnf(eq_9,negated_conjecture,
multiply(c,b) != multiply(c,b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_5,eq_3]),eq_1]),eq_8]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP159-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jul 26 04:38:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.39/0.58 % SZS status Unsatisfiable
% 0.39/0.58 % SZS output start CNFRefutation for /tmp/MaedMax_4260
% See solution above
% 0.39/0.58
%------------------------------------------------------------------------------