TSTP Solution File: GRP702-12 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP702-12 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n012.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:12 EDT 2022
% Result : Unsatisfiable 0.43s 0.61s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 12 RR)
% Number of literals : 23 ( 22 equ; 6 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 : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = mult(B,ld(B,A)),
file('/tmp/MaedMax_29194') ).
cnf(eq_1,axiom,
A = ld(B,mult(B,A)),
file('/tmp/MaedMax_29194') ).
cnf(eq_2,axiom,
A = mult(rd(A,B),B),
file('/tmp/MaedMax_29194') ).
cnf(eq_3,axiom,
A = mult(A,unit),
file('/tmp/MaedMax_29194') ).
cnf(eq_4,axiom,
A = mult(unit,A),
file('/tmp/MaedMax_29194') ).
cnf(eq_5,axiom,
mult(A,mult(op_c,B)) = mult(mult(A,op_c),B),
file('/tmp/MaedMax_29194') ).
cnf(eq_6,axiom,
ld(A,mult(op_c,A)) = op_d,
file('/tmp/MaedMax_29194') ).
cnf(eq_7,axiom,
mult(mult(rd(op_c,mult(A,B)),B),A) = op_e,
file('/tmp/MaedMax_29194') ).
cnf(eq_8,axiom,
mult(A,mult(B,ld(mult(A,B),op_c))) = op_f,
file('/tmp/MaedMax_29194') ).
cnf(eq_9,negated_conjecture,
mult(mult(x0,op_d),x1) != mult(x0,mult(op_d,x1)),
file('/tmp/MaedMax_29194') ).
cnf(eq_10,plain,
op_c = op_d,
inference(cp,[status(thm)],[eq_1,eq_6]) ).
cnf(eq_11,plain,
mult(A,mult(unit,ld(A,op_c))) = op_f,
inference(cp,[status(thm)],[eq_3,eq_8]) ).
cnf(eq_12,plain,
mult(mult(rd(op_c,A),A),unit) = op_e,
inference(cp,[status(thm)],[eq_4,eq_7]) ).
cnf(eq_13,plain,
op_c = op_e,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_12,eq_2]),eq_3]) ).
cnf(eq_14,plain,
op_c = op_f,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_11,eq_4]),eq_0]) ).
cnf(eq_15,plain,
op_f = op_e,
inference(cp,[status(thm)],[eq_14,eq_13]) ).
cnf(eq_16,plain,
op_d = op_f,
inference(cp,[status(thm)],[eq_10,eq_14]) ).
cnf(eq_17,negated_conjecture,
mult(x0,mult(op_c,x1)) != mult(mult(x0,op_d),x1),
inference(cp,[status(thm)],[eq_10,eq_9]) ).
cnf(eq_18,negated_conjecture,
mult(mult(x0,op_d),x1) != mult(x0,mult(op_c,x1)),
eq_17 ).
cnf(eq_19,negated_conjecture,
mult(mult(x0,op_f),x1) != mult(x0,mult(op_f,x1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_18,eq_16]),eq_14]) ).
cnf(eq_20,negated_conjecture,
mult(mult(x0,op_e),x1) != mult(x0,mult(op_e,x1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_19,eq_15]),eq_15]) ).
cnf(eq_21,negated_conjecture,
mult(x0,mult(op_c,x1)) != mult(x0,mult(op_c,x1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_20,eq_13]),eq_5]),eq_13]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP702-12 : TPTP v8.1.0. Released v8.1.0.
% 0.06/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n012.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:20:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/0.61 % SZS status Unsatisfiable
% 0.43/0.61 % SZS output start CNFRefutation for /tmp/MaedMax_29194
% See solution above
% 0.43/0.61
%------------------------------------------------------------------------------