TSTP Solution File: GRP162-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP162-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n026.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.48s 0.64s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 9 RR)
% Number of literals : 14 ( 13 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_3003') ).
cnf(eq_1,axiom,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
file('/tmp/MaedMax_3003') ).
cnf(eq_2,axiom,
least_upper_bound(a,b) = b,
file('/tmp/MaedMax_3003') ).
cnf(eq_3,axiom,
least_upper_bound(b,c) = c,
file('/tmp/MaedMax_3003') ).
cnf(eq_4,negated_conjecture,
least_upper_bound(a,c) != c,
file('/tmp/MaedMax_3003') ).
cnf(eq_5,plain,
least_upper_bound(b,x102) = least_upper_bound(a,least_upper_bound(b,x102)),
inference(cp,[status(thm)],[eq_2,eq_1]) ).
cnf(eq_6,plain,
least_upper_bound(least_upper_bound(Y,X),x102) = least_upper_bound(X,least_upper_bound(Y,x102)),
inference(cp,[status(thm)],[eq_0,eq_1]) ).
cnf(eq_7,plain,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(Y,least_upper_bound(X,Z)),
inference(rw,[status(thm)],[eq_6,eq_1]) ).
cnf(eq_8,plain,
least_upper_bound(b,X) = least_upper_bound(b,least_upper_bound(a,X)),
inference(rw,[status(thm)],[eq_5,eq_7]) ).
cnf(eq_9,plain,
least_upper_bound(b,least_upper_bound(a,c)) = c,
inference(cp,[status(thm)],[eq_8,eq_3]) ).
cnf(eq_10,plain,
least_upper_bound(a,least_upper_bound(b,c)) = c,
inference(cp,[status(thm)],[eq_7,eq_9]) ).
cnf(eq_11,plain,
least_upper_bound(a,c) = c,
inference(rw,[status(thm)],[eq_10,eq_3]) ).
cnf(eq_12,negated_conjecture,
c != c,
inference(cp,[status(thm)],[eq_11,eq_4]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP162-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.14/0.13 % Command : run_maedmax %d %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Jul 26 04:23:08 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.48/0.64 % SZS status Unsatisfiable
% 0.48/0.64 % SZS output start CNFRefutation for /tmp/MaedMax_3003
% See solution above
% 0.48/0.64
%------------------------------------------------------------------------------