TSTP Solution File: GRP699-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP699-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n008.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:03:11 EDT 2022
% Result : Unsatisfiable 1.29s 1.46s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 5 RR)
% Number of literals : 20 ( 19 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = mult(B,ld(B,A)),
file('/tmp/MaedMax_13565') ).
cnf(eq_1,axiom,
A = ld(B,mult(B,A)),
file('/tmp/MaedMax_13565') ).
cnf(eq_2,axiom,
A = mult(rd(A,B),B),
file('/tmp/MaedMax_13565') ).
cnf(eq_3,axiom,
A = rd(mult(A,B),B),
file('/tmp/MaedMax_13565') ).
cnf(eq_4,axiom,
A = mult(unit,A),
file('/tmp/MaedMax_13565') ).
cnf(eq_5,axiom,
mult(mult(A,B),mult(B,mult(C,B))) = mult(mult(A,mult(B,mult(B,C))),B),
file('/tmp/MaedMax_13565') ).
cnf(eq_6,negated_conjecture,
mult(mult(a,b),c) != mult(mult(a,c),ld(c,mult(b,c))),
file('/tmp/MaedMax_13565') ).
cnf(eq_7,plain,
mult(mult(x101,mult(x101,x102)),x101) = mult(mult(unit,x101),mult(x101,mult(x102,x101))),
inference(cp,[status(thm)],[eq_4,eq_5]) ).
cnf(eq_8,plain,
mult(A,mult(A,mult(B,A))) = mult(mult(A,mult(A,B)),A),
inference(rw,[status(thm)],[eq_7,eq_4]) ).
cnf(eq_9,plain,
rd(mult(A,mult(A,mult(B,A))),A) = mult(A,mult(A,B)),
inference(cp,[status(thm)],[eq_8,eq_3]) ).
cnf(eq_10,plain,
rd(mult(B,mult(B,A)),B) = mult(B,mult(B,rd(A,B))),
inference(cp,[status(thm)],[eq_2,eq_9]) ).
cnf(eq_11,plain,
mult(A,mult(A,rd(B,A))) = rd(mult(A,mult(A,B)),A),
eq_10 ).
cnf(eq_12,plain,
ld(A,rd(mult(A,mult(A,B)),A)) = mult(A,rd(B,A)),
inference(cp,[status(thm)],[eq_11,eq_1]) ).
cnf(eq_13,plain,
ld(B,rd(mult(B,A),B)) = mult(B,rd(ld(B,A),B)),
inference(cp,[status(thm)],[eq_0,eq_12]) ).
cnf(eq_14,plain,
ld(A,rd(mult(A,B),A)) = mult(A,rd(ld(A,B),A)),
eq_13 ).
cnf(eq_15,plain,
mult(mult(x100,mult(A,ld(A,rd(mult(A,B),A)))),A) = mult(mult(x100,A),mult(A,mult(rd(ld(A,B),A),A))),
inference(cp,[status(thm)],[eq_14,eq_5]) ).
cnf(eq_16,plain,
mult(mult(A,B),C) = mult(mult(A,rd(mult(B,C),B)),B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_15,eq_0]),eq_2]),eq_0]) ).
cnf(eq_17,negated_conjecture,
mult(mult(a,rd(mult(c,ld(c,mult(b,c))),c)),c) != mult(mult(a,b),c),
inference(cp,[status(thm)],[eq_16,eq_6]) ).
cnf(eq_18,negated_conjecture,
mult(mult(a,b),c) != mult(mult(a,b),c),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_17,eq_0]),eq_3]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP699-1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : run_maedmax %d %s
% 0.13/0.34 % Computer : n008.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 : 300
% 0.13/0.34 % DateTime : Tue Jul 26 04:25:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.29/1.46 % SZS status Unsatisfiable
% 1.29/1.46 % SZS output start CNFRefutation for /tmp/MaedMax_13565
% See solution above
% 1.29/1.46
%------------------------------------------------------------------------------