TSTP Solution File: GRP698-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP698-1 : TPTP v8.1.0. Released v4.0.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:11 EDT 2022
% Result : Unsatisfiable 0.84s 1.04s
% Output : CNFRefutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 6 RR)
% Number of literals : 19 ( 18 equ; 5 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 : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = ld(B,mult(B,A)),
file('/tmp/MaedMax_1990') ).
cnf(eq_1,axiom,
A = mult(rd(A,B),B),
file('/tmp/MaedMax_1990') ).
cnf(eq_2,axiom,
A = rd(mult(A,B),B),
file('/tmp/MaedMax_1990') ).
cnf(eq_3,axiom,
A = mult(A,unit),
file('/tmp/MaedMax_1990') ).
cnf(eq_4,axiom,
mult(A,mult(mult(mult(B,A),A),C)) = mult(mult(mult(A,B),A),mult(A,C)),
file('/tmp/MaedMax_1990') ).
cnf(eq_5,negated_conjecture,
mult(rd(mult(a,b),a),mult(a,c)) != mult(a,mult(b,c)),
file('/tmp/MaedMax_1990') ).
cnf(eq_6,plain,
ld(mult(mult(A,B),A),mult(A,mult(mult(mult(B,A),A),C))) = mult(A,C),
inference(cp,[status(thm)],[eq_4,eq_0]) ).
cnf(eq_7,plain,
mult(mult(mult(A,x101),A),A) = mult(A,mult(mult(mult(x101,A),A),unit)),
inference(cp,[status(thm)],[eq_3,eq_4]) ).
cnf(eq_8,plain,
mult(A,mult(mult(B,A),A)) = mult(mult(mult(A,B),A),A),
inference(rw,[status(thm)],[eq_7,eq_3]) ).
cnf(eq_9,plain,
rd(mult(A,mult(mult(B,A),A)),A) = mult(mult(A,B),A),
inference(cp,[status(thm)],[eq_8,eq_2]) ).
cnf(eq_10,plain,
rd(mult(B,mult(A,B)),B) = mult(mult(B,rd(A,B)),B),
inference(cp,[status(thm)],[eq_1,eq_9]) ).
cnf(eq_11,plain,
mult(mult(A,rd(B,A)),A) = rd(mult(A,mult(B,A)),A),
eq_10 ).
cnf(eq_12,plain,
rd(mult(B,A),B) = mult(mult(B,rd(rd(A,B),B)),B),
inference(cp,[status(thm)],[eq_1,eq_11]) ).
cnf(eq_13,plain,
mult(mult(A,rd(rd(B,A),A)),A) = rd(mult(A,B),A),
eq_12 ).
cnf(eq_14,negated_conjecture,
ld(mult(mult(a,B),a),mult(a,mult(mult(mult(B,a),a),mult(b,c)))) != mult(rd(mult(a,b),a),mult(a,c)),
inference(cp,[status(thm)],[eq_6,eq_5]) ).
cnf(eq_15,negated_conjecture,
ld(mult(mult(a,A),a),mult(a,mult(mult(mult(A,a),a),mult(b,c)))) != mult(rd(mult(a,b),a),mult(a,c)),
eq_14 ).
cnf(eq_16,negated_conjecture,
mult(mult(mult(a,rd(rd(b,a),a)),a),mult(a,c)) != ld(mult(mult(a,x100),a),mult(a,mult(mult(mult(x100,a),a),mult(b,c)))),
inference(cp,[status(thm)],[eq_13,eq_15]) ).
cnf(eq_17,negated_conjecture,
mult(a,mult(b,c)) != mult(a,mult(b,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_16,eq_4]),eq_1]),eq_1]),eq_6]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP698-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n010.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:14:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.84/1.04 % SZS status Unsatisfiable
% 0.84/1.04 % SZS output start CNFRefutation for /tmp/MaedMax_1990
% See solution above
% 0.84/1.04
%------------------------------------------------------------------------------