TSTP Solution File: GRP709-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP709-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n007.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 : 600s
% DateTime : Sat Jul 16 08:49:00 EDT 2022
% Result : Unsatisfiable 0.61s 1.04s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 8 RR)
% Number of literals : 41 ( 0 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP709-1.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP709-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP709-1.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP709-1.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP709-1.p',unknown),
[] ).
cnf(6,plain,
equal(mult(unit,A),A),
file('GRP709-1.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(A,mult(B,A)),C),mult(A,mult(B,mult(A,C)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(mult(op_c,A),mult(A,op_c)),
file('GRP709-1.p',unknown),
[] ).
cnf(9,plain,
equal(mult(A,op_c),mult(op_c,A)),
inference(flip,[status(thm),theory(equality)],[8]),
[iquote('flip(8)')] ).
cnf(10,plain,
equal(mult(mult(A,B),op_c),mult(A,mult(B,op_c))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(11,plain,
~ equal(mult(mult(mult(op_c,op_c),a),b),mult(mult(op_c,op_c),mult(a,b))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(12,plain,
equal(ld(A,A),unit),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(22,plain,
equal(rd(mult(A,mult(B,mult(A,C))),C),mult(A,mult(B,A))),
inference(para,[status(thm),theory(equality)],[7,4]),
[iquote('para(7,4)')] ).
cnf(23,plain,
equal(mult(mult(A,A),B),mult(A,mult(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,7]),6]),
[iquote('para(6,7),demod([6])')] ).
cnf(24,plain,
~ equal(mult(mult(op_c,mult(op_c,a)),b),mult(op_c,mult(op_c,mult(a,b)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),23,23]),
[iquote('back_demod(11),demod([23,23])')] ).
cnf(27,plain,
equal(mult(ld(op_c,A),op_c),A),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(28,plain,
equal(ld(op_c,mult(A,op_c)),A),
inference(para,[status(thm),theory(equality)],[8,2]),
[iquote('para(8,2)')] ).
cnf(35,plain,
equal(mult(mult(op_c,mult(op_c,A)),B),mult(op_c,mult(A,mult(op_c,B)))),
inference(para,[status(thm),theory(equality)],[9,7]),
[iquote('para(9,7)')] ).
cnf(36,plain,
~ equal(mult(op_c,mult(op_c,mult(a,b))),mult(op_c,mult(a,mult(op_c,b)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[24]),35]),1]),
[iquote('back_demod(24),demod([35]),flip(1)')] ).
cnf(39,plain,
equal(mult(A,mult(ld(A,B),op_c)),mult(B,op_c)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,10]),1]),
[iquote('para(1,10),flip(1)')] ).
cnf(47,plain,
equal(mult(A,mult(op_c,op_c)),mult(op_c,mult(A,op_c))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,10]),10]),
[iquote('para(8,10),demod([10])')] ).
cnf(48,plain,
equal(mult(op_c,mult(A,op_c)),mult(A,mult(op_c,op_c))),
inference(flip,[status(thm),theory(equality)],[47]),
[iquote('flip(47)')] ).
cnf(64,plain,
equal(mult(ld(op_c,A),mult(op_c,op_c)),mult(A,op_c)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,10]),1]),
[iquote('para(27,10),flip(1)')] ).
cnf(66,plain,
equal(rd(mult(A,B),C),mult(A,mult(rd(B,mult(A,C)),A))),
inference(para,[status(thm),theory(equality)],[3,22]),
[iquote('para(3,22)')] ).
cnf(68,plain,
equal(mult(A,mult(rd(B,mult(A,B)),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),66]),
[iquote('back_demod(4),demod([66])')] ).
cnf(72,plain,
equal(mult(ld(A,B),op_c),ld(A,mult(B,op_c))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[39,2]),1]),
[iquote('para(39,2),flip(1)')] ).
cnf(136,plain,
equal(ld(ld(op_c,A),mult(A,op_c)),mult(op_c,op_c)),
inference(para,[status(thm),theory(equality)],[64,2]),
[iquote('para(64,2)')] ).
cnf(138,plain,
equal(mult(op_c,op_c),ld(ld(op_c,unit),op_c)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,136]),1]),
[iquote('para(6,136),flip(1)')] ).
cnf(152,plain,
equal(mult(ld(op_c,A),ld(ld(op_c,unit),op_c)),mult(A,op_c)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[64]),138]),
[iquote('back_demod(64),demod([138])')] ).
cnf(154,plain,
equal(mult(op_c,mult(A,op_c)),mult(A,ld(ld(op_c,unit),op_c))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[48]),138]),
[iquote('back_demod(48),demod([138])')] ).
cnf(155,plain,
equal(mult(A,ld(ld(op_c,unit),op_c)),mult(op_c,mult(A,op_c))),
inference(flip,[status(thm),theory(equality)],[154]),
[iquote('flip(154)')] ).
cnf(168,plain,
~ equal(mult(op_c,mult(a,mult(op_c,b))),mult(op_c,mult(a,mult(b,op_c)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,36]),10]),1]),
[iquote('para(8,36),demod([10]),flip(1)')] ).
cnf(173,plain,
equal(mult(rd(A,mult(B,A)),B),unit),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[68,2]),12]),1]),
[iquote('para(68,2),demod([12]),flip(1)')] ).
cnf(176,plain,
equal(rd(A,mult(op_c,A)),ld(op_c,unit)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[173,28]),1]),
[iquote('para(173,28),flip(1)')] ).
cnf(179,plain,
equal(mult(ld(op_c,unit),mult(op_c,A)),A),
inference(para,[status(thm),theory(equality)],[176,3]),
[iquote('para(176,3)')] ).
cnf(182,plain,
equal(mult(op_c,A),ld(ld(op_c,unit),A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[179,2]),1]),
[iquote('para(179,2),flip(1)')] ).
cnf(187,plain,
~ equal(ld(ld(op_c,unit),mult(a,mult(b,op_c))),ld(ld(op_c,unit),mult(a,ld(ld(op_c,unit),b)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[168]),182,182,182]),1]),
[iquote('back_demod(168),demod([182,182,182]),flip(1)')] ).
cnf(196,plain,
equal(mult(A,ld(ld(op_c,unit),op_c)),ld(ld(op_c,unit),mult(A,op_c))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[155]),182]),
[iquote('back_demod(155),demod([182])')] ).
cnf(200,plain,
equal(mult(A,op_c),ld(ld(op_c,unit),A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[152]),196,72,28]),1]),
[iquote('back_demod(152),demod([196,72,28]),flip(1)')] ).
cnf(209,plain,
~ equal(ld(ld(op_c,unit),mult(a,ld(ld(op_c,unit),b))),ld(ld(op_c,unit),mult(a,ld(ld(op_c,unit),b)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[187]),200]),
[iquote('back_demod(187),demod([200])')] ).
cnf(210,plain,
$false,
inference(conflict,[status(thm)],[209]),
[iquote('xx_conflict(209)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : GRP709-1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.09 % Command : tptp2X_and_run_eqp %s
% 0.09/0.28 % Computer : n007.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Mon Jun 13 22:57:39 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.61/1.04 ----- EQP 0.9e, May 2009 -----
% 0.61/1.04 The job began on n007.cluster.edu, Mon Jun 13 22:57:40 2022
% 0.61/1.04 The command was "./eqp09e".
% 0.61/1.04
% 0.61/1.04 set(prolog_style_variables).
% 0.61/1.04 set(lrpo).
% 0.61/1.04 set(basic_paramod).
% 0.61/1.04 set(functional_subsume).
% 0.61/1.04 set(ordered_paramod).
% 0.61/1.04 set(prime_paramod).
% 0.61/1.04 set(para_pairs).
% 0.61/1.04 assign(pick_given_ratio,4).
% 0.61/1.04 clear(print_kept).
% 0.61/1.04 clear(print_new_demod).
% 0.61/1.04 clear(print_back_demod).
% 0.61/1.04 clear(print_given).
% 0.61/1.04 assign(max_mem,64000).
% 0.61/1.04 end_of_commands.
% 0.61/1.04
% 0.61/1.04 Usable:
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Sos:
% 0.61/1.04 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.61/1.04 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.61/1.04 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.61/1.04 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.61/1.04 0 (wt=-1) [] mult(A,unit) = A.
% 0.61/1.04 0 (wt=-1) [] mult(unit,A) = A.
% 0.61/1.04 0 (wt=-1) [] mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C).
% 0.61/1.04 0 (wt=-1) [] mult(op_c,A) = mult(A,op_c).
% 0.61/1.04 0 (wt=-1) [] mult(A,mult(B,op_c)) = mult(mult(A,B),op_c).
% 0.61/1.04 0 (wt=-1) [] -(mult(mult(op_c,op_c),mult(a,b)) = mult(mult(mult(op_c,op_c),a),b)).
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Demodulators:
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Passive:
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Starting to process input.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.61/1.04 1 is a new demodulator.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.61/1.04 2 is a new demodulator.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.61/1.04 3 is a new demodulator.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.61/1.04 4 is a new demodulator.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.61/1.04 5 is a new demodulator.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.61/1.04 6 is a new demodulator.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 0.61/1.04 7 is a new demodulator.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 8 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 0.61/1.04
% 0.61/1.04 ** KEPT: 9 (wt=7) [flip(8)] mult(A,op_c) = mult(op_c,A).
% 0.61/1.04 clause forward subsumed: 0 (wt=7) [flip(9)] mult(op_c,A) = mult(A,op_c).
% 0.61/1.04
% 0.61/1.04 ** KEPT: 10 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.61/1.04 10 is a new demodulator.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 11 (wt=15) [flip(1)] -(mult(mult(mult(op_c,op_c),a),b) = mult(mult(op_c,op_c),mult(a,b))).
% 0.61/1.04 ---------------- PROOF FOUND ----------------
% 0.61/1.04 % SZS status Unsatisfiable
% 0.61/1.04
% 0.61/1.04
% 0.61/1.04 After processing input:
% 0.61/1.04
% 0.61/1.04 Usable:
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Sos:
% 0.61/1.04 5 (wt=5) [] mult(A,unit) = A.
% 0.61/1.04 6 (wt=5) [] mult(unit,A) = A.
% 0.61/1.04 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.61/1.04 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.61/1.04 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.61/1.04 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.61/1.04 8 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 0.61/1.04 9 (wt=7) [flip(8)] mult(A,op_c) = mult(op_c,A).
% 0.61/1.04 10 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.61/1.04 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 0.61/1.04 11 (wt=15) [flip(1)] -(mult(mult(mult(op_c,op_c),a),b) = mult(mult(op_c,op_c),mult(a,b))).
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Demodulators:
% 0.61/1.04 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.61/1.04 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.61/1.04 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.61/1.04 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.61/1.04 5 (wt=5) [] mult(A,unit) = A.
% 0.61/1.04 6 (wt=5) [] mult(unit,A) = A.
% 0.61/1.04 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 0.61/1.04 10 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Passive:
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 UNIT CONFLICT from 209 and x=x at 0.01 seconds.
% 0.61/1.04
% 0.61/1.04 ---------------- PROOF ----------------
% 0.61/1.04 % SZS output start Refutation
% See solution above
% 0.61/1.04 ------------ end of proof -------------
% 0.61/1.04
% 0.61/1.04
% 0.61/1.04 ------------- memory usage ------------
% 0.61/1.04 Memory dynamically allocated (tp_alloc): 488.
% 0.61/1.04 type (bytes each) gets frees in use avail bytes
% 0.61/1.04 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.61/1.04 term ( 16) 15574 11585 3989 24 77.6 K
% 0.61/1.04 gen_ptr ( 8) 22645 4358 18287 40 143.2 K
% 0.61/1.04 context ( 808) 13766 13764 2 6 6.3 K
% 0.61/1.04 trail ( 12) 918 918 0 6 0.1 K
% 0.61/1.04 bt_node ( 68) 4472 4469 3 11 0.9 K
% 0.61/1.04 ac_position (285432) 0 0 0 0 0.0 K
% 0.61/1.04 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.61/1.04 ac_match_free_vars_pos (4020)
% 0.61/1.04 0 0 0 0 0.0 K
% 0.61/1.04 discrim ( 12) 3833 1635 2198 131 27.3 K
% 0.61/1.04 flat ( 40) 32222 32222 0 31 1.2 K
% 0.61/1.04 discrim_pos ( 12) 648 648 0 1 0.0 K
% 0.61/1.04 fpa_head ( 12) 1598 0 1598 0 18.7 K
% 0.61/1.04 fpa_tree ( 28) 917 917 0 33 0.9 K
% 0.61/1.04 fpa_pos ( 36) 379 379 0 1 0.0 K
% 0.61/1.04 literal ( 12) 739 530 209 0 2.4 K
% 0.61/1.04 clause ( 24) 739 530 209 0 4.9 K
% 0.61/1.04 list ( 12) 230 171 59 2 0.7 K
% 0.61/1.04 list_pos ( 20) 1085 452 633 13 12.6 K
% 0.61/1.04 pair_index ( 40) 2 0 2 0 0.1 K
% 0.61/1.04
% 0.61/1.04 -------------- statistics -------------
% 0.61/1.04 Clauses input 10
% 0.61/1.04 Usable input 0
% 0.61/1.04 Sos input 10
% 0.61/1.04 Demodulators input 0
% 0.61/1.04 Passive input 0
% 0.61/1.04
% 0.61/1.04 Processed BS (before search) 12
% 0.61/1.04 Forward subsumed BS 1
% 0.61/1.04 Kept BS 11
% 0.61/1.04 New demodulators BS 8
% 0.61/1.04 Back demodulated BS 0
% 0.61/1.04
% 0.61/1.04 Clauses or pairs given 904
% 0.61/1.04 Clauses generated 468
% 0.61/1.04 Forward subsumed 270
% 0.61/1.04 Deleted by weight 0
% 0.61/1.04 Deleted by variable count 0
% 0.61/1.04 Kept 198
% 0.61/1.04 New demodulators 163
% 0.61/1.04 Back demodulated 92
% 0.61/1.04 Ordered paramod prunes 0
% 0.61/1.04 Basic paramod prunes 1660
% 0.61/1.04 Prime paramod prunes 45
% 0.61/1.04 Semantic prunes 0
% 0.61/1.04
% 0.61/1.04 Rewrite attmepts 6487
% 0.61/1.04 Rewrites 564
% 0.61/1.04
% 0.61/1.04 FPA overloads 0
% 0.61/1.04 FPA underloads 0
% 0.61/1.04
% 0.61/1.04 Usable size 0
% 0.61/1.04 Sos size 116
% 0.61/1.04 Demodulators size 99
% 0.61/1.04 Passive size 0
% 0.61/1.04 Disabled size 92
% 0.61/1.04
% 0.61/1.04 Proofs found 1
% 0.61/1.04
% 0.61/1.04 ----------- times (seconds) ----------- Mon Jun 13 22:57:40 2022
% 0.61/1.04
% 0.61/1.04 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.61/1.04 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.61/1.04 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.61/1.04 input time 0.00
% 0.61/1.04 paramodulation time 0.00
% 0.61/1.04 demodulation time 0.00
% 0.61/1.04 orient time 0.00
% 0.61/1.04 weigh time 0.00
% 0.61/1.04 forward subsume time 0.00
% 0.61/1.04 back demod find time 0.00
% 0.61/1.04 conflict time 0.00
% 0.61/1.04 LRPO time 0.00
% 0.61/1.04 store clause time 0.00
% 0.61/1.04 disable clause time 0.00
% 0.61/1.04 prime paramod time 0.00
% 0.61/1.04 semantics time 0.00
% 0.61/1.04
% 0.61/1.04 EQP interrupted
%------------------------------------------------------------------------------