TSTP Solution File: GRP685-11 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP685-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n010.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:10 EDT 2022
% Result : Unsatisfiable 0.47s 0.65s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 17 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = rd(mult(A,A),A),
file('/tmp/MaedMax_6725') ).
cnf(eq_1,axiom,
mult(rd(A,B),B) = rd(mult(A,B),B),
file('/tmp/MaedMax_6725') ).
cnf(eq_2,axiom,
mult(A,rd(mult(B,C),C)) = rd(mult(mult(A,B),rd(D,C)),rd(D,C)),
file('/tmp/MaedMax_6725') ).
cnf(eq_3,negated_conjecture,
rd(mult(x6,rd(x7,x8)),rd(x7,x8)) != rd(mult(x6,x8),x8),
file('/tmp/MaedMax_6725') ).
cnf(eq_4,plain,
A = mult(rd(A,A),A),
inference(rw,[status(thm)],[eq_0,eq_1]) ).
cnf(eq_5,plain,
mult(A,mult(rd(B,C),C)) = mult(rd(mult(A,B),rd(D,C)),rd(D,C)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_2,eq_1]),eq_1]) ).
cnf(eq_6,negated_conjecture,
mult(rd(x6,rd(x7,x8)),rd(x7,x8)) != mult(rd(x6,x8),x8),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_3,eq_1]),eq_1]) ).
cnf(eq_7,plain,
rd(mult(mult(x100,x101),rd(mult(A,A),A)),A) = mult(x100,rd(mult(x101,A),A)),
inference(cp,[status(thm)],[eq_0,eq_2]) ).
cnf(eq_8,plain,
mult(A,rd(mult(B,C),C)) = rd(mult(mult(A,B),C),C),
inference(rw,[status(thm)],[eq_7,eq_0]) ).
cnf(eq_9,plain,
mult(A,mult(rd(B,C),C)) = mult(rd(mult(A,B),C),C),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_8,eq_1]),eq_1]) ).
cnf(eq_10,plain,
mult(rd(A,x102),x102) = mult(rd(A,A),mult(rd(A,x102),x102)),
inference(cp,[status(thm)],[eq_4,eq_9]) ).
cnf(eq_11,plain,
mult(rd(A,B),B) = mult(rd(A,A),mult(rd(A,B),B)),
eq_10 ).
cnf(eq_12,plain,
mult(A,rd(mult(B,C),C)) = mult(A,rd(mult(B,rd(D,C)),rd(D,C))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_5,eq_1]),eq_1]),eq_8]) ).
cnf(eq_13,plain,
mult(rd(A,A),rd(mult(A,B),B)) = rd(mult(A,B),B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_11,eq_1]),eq_1]) ).
cnf(eq_14,plain,
mult(rd(B,B),rd(mult(B,rd(D,C)),rd(D,C))) = rd(mult(B,C),C),
inference(cp,[status(thm)],[eq_12,eq_13]) ).
cnf(eq_15,plain,
rd(mult(A,B),B) = rd(mult(A,rd(C,B)),rd(C,B)),
inference(rw,[status(thm)],[eq_14,eq_13]) ).
cnf(eq_16,negated_conjecture,
rd(mult(x6,x8),x8) != rd(mult(x6,x8),x8),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_6,eq_1]),eq_15]),eq_1]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP685-11 : TPTP v8.1.0. Released v8.1.0.
% 0.00/0.11 % Command : run_maedmax %d %s
% 0.11/0.31 % Computer : n010.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Jul 26 04:16:10 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.47/0.65 % SZS status Unsatisfiable
% 0.47/0.65 % SZS output start CNFRefutation for /tmp/MaedMax_6725
% See solution above
% 0.47/0.65
%------------------------------------------------------------------------------