TSTP Solution File: GRP185-2 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP185-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n005.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:22 EDT 2022
% Result : Unsatisfiable 31.14s 31.36s
% Output : CNFRefutation 31.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 6 RR)
% Number of literals : 15 ( 14 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_8031') ).
cnf(eq_1,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_8031') ).
cnf(eq_2,axiom,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
file('/tmp/MaedMax_8031') ).
cnf(eq_3,axiom,
X = least_upper_bound(X,X),
file('/tmp/MaedMax_8031') ).
cnf(eq_4,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_8031') ).
cnf(eq_5,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_8031') ).
cnf(eq_6,negated_conjecture,
multiply(least_upper_bound(a,identity),least_upper_bound(b,identity)) != least_upper_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))),
file('/tmp/MaedMax_8031') ).
cnf(eq_7,negated_conjecture,
least_upper_bound(identity,least_upper_bound(identity,least_upper_bound(b,least_upper_bound(multiply(a,identity),multiply(a,b))))) != least_upper_bound(identity,least_upper_bound(b,least_upper_bound(multiply(a,identity),multiply(a,b)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_6,eq_1]),eq_1]),eq_5]),eq_0]),eq_4]),eq_2]),eq_1]),eq_1]),eq_1]),eq_5]),eq_0]),eq_4]),eq_2]),eq_2]),eq_11]),eq_11]),eq_11]),eq_3]) ).
cnf(eq_8,plain,
least_upper_bound(least_upper_bound(Y,X),x102) = least_upper_bound(X,least_upper_bound(Y,x102)),
inference(cp,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_9,plain,
least_upper_bound(x101,x102) = least_upper_bound(x101,least_upper_bound(least_upper_bound(x101,x102),x102)),
inference(cp,[status(thm)],[eq_3,eq_11]) ).
cnf(eq_10,plain,
least_upper_bound(X,Y) = least_upper_bound(X,least_upper_bound(X,Y)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_9,eq_2]),eq_3]) ).
cnf(eq_11,plain,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(Y,least_upper_bound(X,Z)),
inference(rw,[status(thm)],[eq_8,eq_2]) ).
cnf(eq_12,negated_conjecture,
least_upper_bound(identity,least_upper_bound(identity,least_upper_bound(b,multiply(a,least_upper_bound(identity,b))))) != least_upper_bound(identity,least_upper_bound(b,multiply(a,least_upper_bound(identity,b)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_7,eq_4]),eq_4]) ).
cnf(eq_13,negated_conjecture,
least_upper_bound(identity,least_upper_bound(b,multiply(a,least_upper_bound(identity,b)))) != least_upper_bound(identity,least_upper_bound(b,multiply(a,least_upper_bound(identity,b)))),
inference(cp,[status(thm)],[eq_10,eq_12]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : GRP185-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.09/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n005.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:09:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 31.14/31.36 % SZS status Unsatisfiable
% 31.14/31.36 % SZS output start CNFRefutation for /tmp/MaedMax_8031
% See solution above
% 31.14/31.36
%------------------------------------------------------------------------------