TSTP Solution File: GRP610-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP610-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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:48:12 EDT 2022
% Result : Unsatisfiable 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 4 RR)
% Number of literals : 39 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 116 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(inverse(double_divide(inverse(double_divide(inverse(double_divide(A,B)),C)),double_divide(A,C))),B),
file('GRP610-1.p',unknown),
[] ).
cnf(2,plain,
equal(inverse(double_divide(A,B)),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(multiply(double_divide(A,B),multiply(B,multiply(C,A))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2,2]),
[iquote('back_demod(1),demod([2,2,2])')] ).
cnf(4,plain,
~ equal(multiply(multiply(inverse(b2),b2),a2),a2),
file('GRP610-1.p',unknown),
[] ).
cnf(5,plain,
equal(multiply(double_divide(multiply(A,multiply(B,C)),D),multiply(D,B)),double_divide(C,A)),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(6,plain,
equal(multiply(double_divide(multiply(A,B),double_divide(B,C)),A),C),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(7,plain,
equal(multiply(double_divide(A,B),multiply(B,C)),double_divide(multiply(A,D),double_divide(D,C))),
inference(para,[status(thm),theory(equality)],[6,3]),
[iquote('para(6,3)')] ).
cnf(8,plain,
equal(double_divide(multiply(A,B),double_divide(B,C)),multiply(double_divide(A,D),multiply(D,C))),
inference(flip,[status(thm),theory(equality)],[7]),
[iquote('flip(7)')] ).
cnf(18,plain,
equal(double_divide(A,multiply(double_divide(multiply(B,A),C),B)),C),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,5]),1]),
[iquote('para(6,5),flip(1)')] ).
cnf(19,plain,
equal(inverse(A),multiply(multiply(double_divide(multiply(B,C),A),B),C)),
inference(para,[status(thm),theory(equality)],[18,2]),
[iquote('para(18,2)')] ).
cnf(20,plain,
equal(multiply(multiply(double_divide(multiply(A,B),C),A),B),inverse(C)),
inference(flip,[status(thm),theory(equality)],[19]),
[iquote('flip(19)')] ).
cnf(25,plain,
equal(double_divide(multiply(A,B),double_divide(B,multiply(C,A))),C),
inference(para,[status(thm),theory(equality)],[7,3]),
[iquote('para(7,3)')] ).
cnf(28,plain,
equal(inverse(A),multiply(double_divide(B,multiply(A,C)),multiply(C,B))),
inference(para,[status(thm),theory(equality)],[25,2]),
[iquote('para(25,2)')] ).
cnf(29,plain,
equal(multiply(double_divide(A,multiply(B,C)),multiply(C,A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[28]),
[iquote('flip(28)')] ).
cnf(35,plain,
~ equal(multiply(multiply(multiply(double_divide(A,multiply(b2,B)),multiply(B,A)),b2),a2),a2),
inference(para,[status(thm),theory(equality)],[28,4]),
[iquote('para(28,4)')] ).
cnf(49,plain,
equal(multiply(multiply(double_divide(A,B),multiply(B,C)),A),C),
inference(para,[status(thm),theory(equality)],[8,6]),
[iquote('para(8,6)')] ).
cnf(52,plain,
equal(multiply(multiply(double_divide(A,double_divide(B,C)),D),A),multiply(C,multiply(D,B))),
inference(para,[status(thm),theory(equality)],[3,49]),
[iquote('para(3,49)')] ).
cnf(53,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),C),B)),C),
inference(para,[status(thm),theory(equality)],[6,49]),
[iquote('para(6,49)')] ).
cnf(63,plain,
equal(multiply(multiply(double_divide(A,B),C),A),multiply(multiply(double_divide(D,B),C),D)),
inference(para,[status(thm),theory(equality)],[53,49]),
[iquote('para(53,49)')] ).
cnf(65,plain,
equal(multiply(multiply(double_divide(A,multiply(double_divide(multiply(B,C),D),B)),inverse(D)),A),C),
inference(para,[status(thm),theory(equality)],[20,49]),
[iquote('para(20,49)')] ).
cnf(68,plain,
equal(multiply(double_divide(A,double_divide(A,multiply(B,C))),inverse(B)),C),
inference(para,[status(thm),theory(equality)],[29,3]),
[iquote('para(29,3)')] ).
cnf(69,plain,
equal(multiply(double_divide(A,double_divide(A,multiply(double_divide(B,C),D))),multiply(C,B)),D),
inference(para,[status(thm),theory(equality)],[2,68]),
[iquote('para(2,68)')] ).
cnf(72,plain,
equal(multiply(multiply(A,B),multiply(inverse(A),C)),multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,49]),52]),
[iquote('para(29,49),demod([52])')] ).
cnf(80,plain,
equal(multiply(multiply(A,multiply(B,C)),D),multiply(B,multiply(multiply(A,C),D))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,72]),2]),1]),
[iquote('para(3,72),demod([2]),flip(1)')] ).
cnf(87,plain,
~ equal(multiply(multiply(double_divide(A,multiply(b2,B)),A),multiply(multiply(B,b2),a2)),a2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[35]),80,80]),
[iquote('back_demod(35),demod([80,80])')] ).
cnf(137,plain,
equal(multiply(A,multiply(multiply(double_divide(B,multiply(double_divide(multiply(C,D),double_divide(E,A)),C)),E),B)),D),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,65]),80]),
[iquote('para(2,65),demod([80])')] ).
cnf(246,plain,
equal(multiply(multiply(double_divide(A,multiply(double_divide(multiply(B,C),D),B)),E),A),multiply(multiply(D,E),C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,63]),1]),
[iquote('para(18,63),flip(1)')] ).
cnf(247,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),B),C)),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[137]),246]),
[iquote('back_demod(137),demod([246])')] ).
cnf(248,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[65]),246]),
[iquote('back_demod(65),demod([246])')] ).
cnf(255,plain,
equal(multiply(double_divide(A,B),multiply(B,A)),multiply(C,inverse(C))),
inference(para,[status(thm),theory(equality)],[248,3]),
[iquote('para(248,3)')] ).
cnf(293,plain,
equal(multiply(double_divide(A,B),A),multiply(double_divide(C,B),C)),
inference(para,[status(thm),theory(equality)],[247,3]),
[iquote('para(247,3)')] ).
cnf(307,plain,
equal(multiply(double_divide(A,double_divide(B,multiply(C,D))),A),multiply(C,multiply(D,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[25,293]),1]),
[iquote('para(25,293),flip(1)')] ).
cnf(336,plain,
equal(multiply(double_divide(A,double_divide(A,B)),multiply(C,inverse(C))),B),
inference(para,[status(thm),theory(equality)],[255,3]),
[iquote('para(255,3)')] ).
cnf(351,plain,
equal(multiply(A,multiply(B,inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[293,68]),307]),
[iquote('para(293,68),demod([307])')] ).
cnf(355,plain,
equal(multiply(A,inverse(A)),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[248,351]),
[iquote('para(248,351)')] ).
cnf(361,plain,
equal(multiply(A,multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[355,351]),
[iquote('para(355,351)')] ).
cnf(362,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[336]),361]),
[iquote('back_demod(336),demod([361])')] ).
cnf(369,plain,
equal(multiply(multiply(double_divide(A,B),C),multiply(B,A)),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[69]),362]),
[iquote('back_demod(69),demod([362])')] ).
cnf(370,plain,
$false,
inference(conflict,[status(thm)],[369,87]),
[iquote('conflict(369,87)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP610-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n022.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 : 600
% 0.12/0.33 % DateTime : Mon Jun 13 07:57:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.10 ----- EQP 0.9e, May 2009 -----
% 0.71/1.10 The job began on n022.cluster.edu, Mon Jun 13 07:57:49 2022
% 0.71/1.10 The command was "./eqp09e".
% 0.71/1.10
% 0.71/1.10 set(prolog_style_variables).
% 0.71/1.10 set(lrpo).
% 0.71/1.10 set(basic_paramod).
% 0.71/1.10 set(functional_subsume).
% 0.71/1.10 set(ordered_paramod).
% 0.71/1.10 set(prime_paramod).
% 0.71/1.10 set(para_pairs).
% 0.71/1.10 assign(pick_given_ratio,4).
% 0.71/1.10 clear(print_kept).
% 0.71/1.10 clear(print_new_demod).
% 0.71/1.10 clear(print_back_demod).
% 0.71/1.10 clear(print_given).
% 0.71/1.10 assign(max_mem,64000).
% 0.71/1.10 end_of_commands.
% 0.71/1.10
% 0.71/1.10 Usable:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Sos:
% 0.71/1.10 0 (wt=-1) [] inverse(double_divide(inverse(double_divide(inverse(double_divide(A,B)),C)),double_divide(A,C))) = B.
% 0.71/1.10 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.71/1.10 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Demodulators:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Passive:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Starting to process input.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 1 (wt=14) [] inverse(double_divide(inverse(double_divide(inverse(double_divide(A,B)),C)),double_divide(A,C))) = B.
% 0.71/1.10 1 is a new demodulator.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.71/1.10 2 is a new demodulator.
% 0.71/1.10 -> 2 back demodulating 1.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.71/1.10 3 is a new demodulator.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.71/1.10 ---------------- PROOF FOUND ----------------
% 0.71/1.10 % SZS status Unsatisfiable
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 After processing input:
% 0.71/1.10
% 0.71/1.10 Usable:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Sos:
% 0.71/1.10 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.71/1.10 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.71/1.10 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Demodulators:
% 0.71/1.10 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.71/1.10 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Passive:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 UNIT CONFLICT from 369 and 87 at 0.01 seconds.
% 0.71/1.10
% 0.71/1.10 ---------------- PROOF ----------------
% 0.71/1.10 % SZS output start Refutation
% See solution above
% 0.71/1.10 ------------ end of proof -------------
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 ------------- memory usage ------------
% 0.71/1.10 Memory dynamically allocated (tp_alloc): 976.
% 0.71/1.10 type (bytes each) gets frees in use avail bytes
% 0.71/1.10 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.71/1.10 term ( 16) 16373 9812 6561 22 127.1 K
% 0.71/1.10 gen_ptr ( 8) 28287 1834 26453 38 207.0 K
% 0.71/1.10 context ( 808) 13039 13037 2 3 3.9 K
% 0.71/1.10 trail ( 12) 1716 1716 0 8 0.1 K
% 0.71/1.10 bt_node ( 68) 5099 5095 4 15 1.3 K
% 0.71/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.10 ac_match_free_vars_pos (4020)
% 0.71/1.10 0 0 0 0 0.0 K
% 0.71/1.10 discrim ( 12) 4975 520 4455 54 52.8 K
% 0.71/1.10 flat ( 40) 37009 37009 0 32 1.2 K
% 0.71/1.10 discrim_pos ( 12) 308 308 0 1 0.0 K
% 0.71/1.10 fpa_head ( 12) 2184 0 2184 0 25.6 K
% 0.71/1.10 fpa_tree ( 28) 1088 1088 0 21 0.6 K
% 0.71/1.10 fpa_pos ( 36) 529 529 0 1 0.0 K
% 0.71/1.10 literal ( 12) 1089 720 369 1 4.3 K
% 0.71/1.10 clause ( 24) 1089 720 369 1 8.7 K
% 0.71/1.10 list ( 12) 219 161 58 2 0.7 K
% 0.71/1.10 list_pos ( 20) 1333 152 1181 11 23.3 K
% 0.71/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.10
% 0.71/1.10 -------------- statistics -------------
% 0.71/1.10 Clauses input 3
% 0.71/1.10 Usable input 0
% 0.71/1.10 Sos input 3
% 0.71/1.10 Demodulators input 0
% 0.71/1.10 Passive input 0
% 0.71/1.10
% 0.71/1.10 Processed BS (before search) 4
% 0.71/1.10 Forward subsumed BS 0
% 0.71/1.10 Kept BS 4
% 0.71/1.10 New demodulators BS 3
% 0.71/1.10 Back demodulated BS 1
% 0.71/1.10
% 0.71/1.10 Clauses or pairs given 756
% 0.71/1.10 Clauses generated 593
% 0.71/1.10 Forward subsumed 228
% 0.71/1.10 Deleted by weight 0
% 0.71/1.10 Deleted by variable count 0
% 0.71/1.10 Kept 365
% 0.71/1.10 New demodulators 157
% 0.71/1.10 Back demodulated 30
% 0.71/1.10 Ordered paramod prunes 0
% 0.71/1.10 Basic paramod prunes 2726
% 0.71/1.10 Prime paramod prunes 18
% 0.71/1.10 Semantic prunes 0
% 0.71/1.10
% 0.71/1.10 Rewrite attmepts 5295
% 0.71/1.10 Rewrites 157
% 0.71/1.10
% 0.71/1.10 FPA overloads 0
% 0.71/1.10 FPA underloads 0
% 0.71/1.10
% 0.71/1.10 Usable size 0
% 0.71/1.10 Sos size 337
% 0.71/1.10 Demodulators size 136
% 0.71/1.10 Passive size 0
% 0.71/1.10 Disabled size 31
% 0.71/1.10
% 0.71/1.10 Proofs found 1
% 0.71/1.10
% 0.71/1.10 ----------- times (seconds) ----------- Mon Jun 13 07:57:49 2022
% 0.71/1.10
% 0.71/1.10 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.71/1.10 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.10 input time 0.00
% 0.71/1.10 paramodulation time 0.00
% 0.71/1.10 demodulation time 0.00
% 0.71/1.10 orient time 0.00
% 0.71/1.10 weigh time 0.00
% 0.71/1.10 forward subsume time 0.00
% 0.71/1.10 back demod find time 0.00
% 0.71/1.10 conflict time 0.00
% 0.71/1.10 LRPO time 0.00
% 0.71/1.10 store clause time 0.00
% 0.71/1.10 disable clause time 0.00
% 0.71/1.10 prime paramod time 0.00
% 0.71/1.10 semantics time 0.00
% 0.71/1.10
% 0.71/1.10 EQP interrupted
%------------------------------------------------------------------------------