TSTP Solution File: GRP679-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP679-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n014.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:09 EDT 2022
% Result : Unsatisfiable 0.48s 0.67s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 5 RR)
% Number of literals : 20 ( 19 equ; 4 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = rd(mult(A,B),B),
file('/tmp/MaedMax_21157') ).
cnf(eq_1,axiom,
A = mult(A,unit),
file('/tmp/MaedMax_21157') ).
cnf(eq_2,axiom,
A = mult(unit,A),
file('/tmp/MaedMax_21157') ).
cnf(eq_3,axiom,
mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C),
file('/tmp/MaedMax_21157') ).
cnf(eq_4,axiom,
mult(A,op_c) = mult(op_c,A),
file('/tmp/MaedMax_21157') ).
cnf(eq_5,negated_conjecture,
mult(mult(op_c,op_c),a) != mult(a,mult(op_c,op_c)),
file('/tmp/MaedMax_21157') ).
cnf(eq_6,plain,
mult(mult(A,A),x102) = mult(A,mult(unit,mult(A,x102))),
inference(cp,[status(thm)],[eq_2,eq_3]) ).
cnf(eq_7,plain,
mult(mult(op_c,mult(op_c,A)),x102) = mult(op_c,mult(A,mult(op_c,x102))),
inference(cp,[status(thm)],[eq_4,eq_3]) ).
cnf(eq_8,plain,
rd(mult(A,mult(B,mult(A,C))),C) = mult(A,mult(B,A)),
inference(cp,[status(thm)],[eq_3,eq_0]) ).
cnf(eq_9,plain,
rd(mult(op_c,A),op_c) = A,
inference(cp,[status(thm)],[eq_4,eq_0]) ).
cnf(eq_10,plain,
mult(A,mult(A,B)) = mult(mult(A,A),B),
inference(rw,[status(thm)],[eq_6,eq_2]) ).
cnf(eq_11,plain,
mult(mult(op_c,mult(op_c,A)),B) = mult(op_c,mult(A,mult(op_c,B))),
eq_7 ).
cnf(eq_12,plain,
mult(op_c,mult(A,mult(op_c,unit))) = mult(op_c,mult(op_c,A)),
inference(cp,[status(thm)],[eq_11,eq_1]) ).
cnf(eq_13,plain,
mult(op_c,mult(B,op_c)) = mult(B,mult(op_c,op_c)),
inference(cp,[status(thm)],[eq_8,eq_9]) ).
cnf(eq_14,plain,
mult(op_c,mult(A,op_c)) = mult(op_c,mult(op_c,A)),
inference(rw,[status(thm)],[eq_12,eq_1]) ).
cnf(eq_15,plain,
mult(A,mult(op_c,op_c)) = mult(op_c,mult(A,op_c)),
eq_13 ).
cnf(eq_16,negated_conjecture,
mult(op_c,mult(op_c,a)) != mult(a,mult(op_c,op_c)),
inference(cp,[status(thm)],[eq_10,eq_5]) ).
cnf(eq_17,negated_conjecture,
mult(op_c,mult(a,op_c)) != mult(a,mult(op_c,op_c)),
inference(cp,[status(thm)],[eq_14,eq_16]) ).
cnf(eq_18,negated_conjecture,
mult(a,mult(op_c,op_c)) != mult(a,mult(op_c,op_c)),
inference(cp,[status(thm)],[eq_15,eq_17]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP679-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_maedmax %d %s
% 0.13/0.34 % Computer : n014.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:18:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.48/0.67 % SZS status Unsatisfiable
% 0.48/0.67 % SZS output start CNFRefutation for /tmp/MaedMax_21157
% See solution above
% 0.48/0.67
%------------------------------------------------------------------------------