%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP585-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:05 EDT 2022
% Result : Unsatisfiable 0.42s 1.08s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 3 RR)
% Number of literals : 28 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B))),C),
file('GRP585-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(double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2]),
[iquote('back_demod(1),demod([2,2])')] ).
cnf(4,plain,
~ equal(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(double_divide(A,multiply(B,multiply(multiply(C,D),double_divide(A,B)))),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(6,plain,
equal(multiply(multiply(A,multiply(inverse(B),double_divide(C,A))),C),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(7,plain,
equal(double_divide(A,multiply(multiply(B,multiply(inverse(C),double_divide(A,B))),multiply(inverse(D),C))),D),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(13,plain,
equal(double_divide(A,multiply(B,inverse(C))),double_divide(multiply(inverse(C),double_divide(double_divide(A,B),D)),D)),
inference(para,[status(thm),theory(equality)],[6,5]),
[iquote('para(6,5)')] ).
cnf(15,plain,
equal(multiply(A,multiply(inverse(B),double_divide(double_divide(C,D),A))),multiply(multiply(D,inverse(B)),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,2]),2]),
[iquote('para(13,2),demod([2])')] ).
cnf(23,plain,
equal(double_divide(multiply(inverse(A),B),inverse(B)),A),
inference(para,[status(thm),theory(equality)],[6,7]),
[iquote('para(6,7)')] ).
cnf(24,plain,
equal(multiply(inverse(A),multiply(inverse(B),A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,2]),1]),
[iquote('para(23,2),flip(1)')] ).
cnf(27,plain,
equal(double_divide(multiply(inverse(A),B),multiply(inverse(B),multiply(inverse(C),A))),C),
inference(para,[status(thm),theory(equality)],[23,3]),
[iquote('para(23,3)')] ).
cnf(33,plain,
equal(double_divide(multiply(inverse(A),A),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[24,27]),
[iquote('para(24,27)')] ).
cnf(34,plain,
equal(multiply(inverse(A),multiply(inverse(B),B)),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,2]),1]),
[iquote('para(33,2),flip(1)')] ).
cnf(35,plain,
equal(double_divide(multiply(inverse(A),A),multiply(B,C)),double_divide(C,B)),
inference(para,[status(thm),theory(equality)],[2,33]),
[iquote('para(2,33)')] ).
cnf(38,plain,
equal(multiply(multiply(A,B),multiply(inverse(C),C)),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,2]),2]),1]),
[iquote('para(35,2),demod([2]),flip(1)')] ).
cnf(85,plain,
equal(multiply(A,multiply(inverse(B),double_divide(C,A))),multiply(inverse(C),inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,15]),38]),
[iquote('para(33,15),demod([38])')] ).
cnf(95,plain,
equal(multiply(inverse(multiply(inverse(A),A)),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,85]),24]),1]),
[iquote('para(33,85),demod([24]),flip(1)')] ).
cnf(96,plain,
equal(multiply(inverse(multiply(inverse(A),A)),multiply(B,C)),multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,95]),2]),
[iquote('para(2,95),demod([2])')] ).
cnf(100,plain,
equal(double_divide(inverse(A),inverse(multiply(inverse(B),B))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[95,35]),33]),1]),
[iquote('para(95,35),demod([33]),flip(1)')] ).
cnf(101,plain,
equal(double_divide(inverse(A),multiply(inverse(B),A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[100,3]),96]),
[iquote('para(100,3),demod([96])')] ).
cnf(107,plain,
equal(double_divide(inverse(multiply(inverse(A),A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[34,101]),
[iquote('para(34,101)')] ).
cnf(108,plain,
equal(multiply(inverse(A),inverse(multiply(inverse(B),B))),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[107,2]),1]),
[iquote('para(107,2),flip(1)')] ).
cnf(126,plain,
equal(double_divide(inverse(inverse(A)),inverse(A)),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[95,101]),
[iquote('para(95,101)')] ).
cnf(127,plain,
equal(multiply(inverse(A),A),double_divide(inverse(inverse(B)),inverse(B))),
inference(flip,[status(thm),theory(equality)],[126]),
[iquote('flip(126)')] ).
cnf(144,plain,
equal(double_divide(inverse(inverse(multiply(inverse(A),A))),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[108,101]),
[iquote('para(108,101)')] ).
cnf(151,plain,
~ equal(double_divide(inverse(inverse(A)),inverse(A)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[127,4]),
[iquote('para(127,4)')] ).
cnf(152,plain,
$false,
inference(conflict,[status(thm)],[151,144]),
[iquote('conflict(151,144)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP585-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 14:43:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.42/1.08 ----- EQP 0.9e, May 2009 -----
% 0.42/1.08 The job began on n019.cluster.edu, Mon Jun 13 14:43:55 2022
% 0.42/1.08 The command was "./eqp09e".
% 0.42/1.08
% 0.42/1.08 set(prolog_style_variables).
% 0.42/1.08 set(lrpo).
% 0.42/1.08 set(basic_paramod).
% 0.42/1.08 set(functional_subsume).
% 0.42/1.08 set(ordered_paramod).
% 0.42/1.08 set(prime_paramod).
% 0.42/1.08 set(para_pairs).
% 0.42/1.08 assign(pick_given_ratio,4).
% 0.42/1.08 clear(print_kept).
% 0.42/1.08 clear(print_new_demod).
% 0.42/1.08 clear(print_back_demod).
% 0.42/1.08 clear(print_given).
% 0.42/1.08 assign(max_mem,64000).
% 0.42/1.08 end_of_commands.
% 0.42/1.08
% 0.42/1.08 Usable:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Sos:
% 0.42/1.08 0 (wt=-1) [] double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B))) = C.
% 0.42/1.08 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.42/1.08 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Demodulators:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Passive:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Starting to process input.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 1 (wt=14) [] double_divide(A,inverse(double_divide(inverse(double_divide(double_divide(A,B),inverse(C))),B))) = C.
% 0.42/1.08 1 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.42/1.08 2 is a new demodulator.
% 0.42/1.08 -> 2 back demodulating 1.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))) = C.
% 0.42/1.08 3 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.42/1.08 ---------------- PROOF FOUND ----------------
% 0.42/1.08 % SZS status Unsatisfiable
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 After processing input:
% 0.42/1.08
% 0.42/1.08 Usable:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Sos:
% 0.42/1.08 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.42/1.08 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.42/1.08 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))) = C.
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Demodulators:
% 0.42/1.08 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.42/1.08 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(A,multiply(B,multiply(inverse(C),double_divide(A,B)))) = C.
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Passive:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 UNIT CONFLICT from 151 and 144 at 0.01 seconds.
% 0.42/1.08
% 0.42/1.08 ---------------- PROOF ----------------
% 0.42/1.08 % SZS output start Refutation
% See solution above
% 0.42/1.08 ------------ end of proof -------------
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 ------------- memory usage ------------
% 0.42/1.08 Memory dynamically allocated (tp_alloc): 488.
% 0.42/1.08 type (bytes each) gets frees in use avail bytes
% 0.42/1.08 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.42/1.08 term ( 16) 7974 5068 2906 20 56.5 K
% 0.42/1.08 gen_ptr ( 8) 12970 633 12337 27 96.6 K
% 0.42/1.08 context ( 808) 6604 6602 2 2 3.2 K
% 0.42/1.08 trail ( 12) 410 410 0 8 0.1 K
% 0.42/1.08 bt_node ( 68) 2659 2655 4 15 1.3 K
% 0.42/1.08 ac_position (285432) 0 0 0 0 0.0 K
% 0.42/1.08 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.42/1.08 ac_match_free_vars_pos (4020)
% 0.42/1.08 0 0 0 0 0.0 K
% 0.42/1.08 discrim ( 12) 2260 44 2216 0 26.0 K
% 0.42/1.08 flat ( 40) 17395 17395 0 33 1.3 K
% 0.42/1.08 discrim_pos ( 12) 149 149 0 1 0.0 K
% 0.42/1.08 fpa_head ( 12) 903 0 903 0 10.6 K
% 0.42/1.08 fpa_tree ( 28) 454 454 0 17 0.5 K
% 0.42/1.08 fpa_pos ( 36) 235 235 0 1 0.0 K
% 0.42/1.08 literal ( 12) 458 307 151 0 1.8 K
% 0.42/1.08 clause ( 24) 458 307 151 0 3.5 K
% 0.42/1.08 list ( 12) 143 87 56 4 0.7 K
% 0.42/1.08 list_pos ( 20) 541 13 528 0 10.3 K
% 0.42/1.08 pair_index ( 40) 2 0 2 0 0.1 K
% 0.42/1.08
% 0.42/1.08 -------------- statistics -------------
% 0.42/1.08 Clauses input 3
% 0.42/1.08 Usable input 0
% 0.42/1.08 Sos input 3
% 0.42/1.08 Demodulators input 0
% 0.42/1.08 Passive input 0
% 0.42/1.08
% 0.42/1.08 Processed BS (before search) 4
% 0.42/1.08 Forward subsumed BS 0
% 0.42/1.08 Kept BS 4
% 0.42/1.08 New demodulators BS 3
% 0.42/1.08 Back demodulated BS 1
% 0.42/1.08
% 0.42/1.08 Clauses or pairs given 392
% 0.42/1.08 Clauses generated 264
% 0.42/1.08 Forward subsumed 117
% 0.42/1.08 Deleted by weight 0
% 0.42/1.08 Deleted by variable count 0
% 0.42/1.08 Kept 147
% 0.42/1.08 New demodulators 81
% 0.42/1.08 Back demodulated 1
% 0.42/1.08 Ordered paramod prunes 0
% 0.42/1.08 Basic paramod prunes 1905
% 0.42/1.08 Prime paramod prunes 4
% 0.42/1.08 Semantic prunes 0
% 0.42/1.08
% 0.42/1.08 Rewrite attmepts 2667
% 0.42/1.08 Rewrites 104
% 0.42/1.08
% 0.42/1.08 FPA overloads 0
% 0.42/1.08 FPA underloads 0
% 0.42/1.08
% 0.42/1.08 Usable size 0
% 0.42/1.08 Sos size 148
% 0.42/1.08 Demodulators size 82
% 0.42/1.08 Passive size 0
% 0.42/1.08 Disabled size 2
% 0.42/1.08
% 0.42/1.08 Proofs found 1
% 0.42/1.08
% 0.42/1.08 ----------- times (seconds) ----------- Mon Jun 13 14:43:55 2022
% 0.42/1.08
% 0.42/1.08 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.42/1.08 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.42/1.08 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.42/1.08 input time 0.00
% 0.42/1.08 paramodulation time 0.00
% 0.42/1.08 demodulation time 0.00
% 0.42/1.08 orient time 0.00
% 0.42/1.08 weigh time 0.00
% 0.42/1.08 forward subsume time 0.00
% 0.42/1.08 back demod find time 0.00
% 0.42/1.08 conflict time 0.00
% 0.42/1.08 LRPO time 0.00
% 0.42/1.08 store clause time 0.00
% 0.42/1.08 disable clause time 0.00
% 0.42/1.08 prime paramod time 0.00
% 0.42/1.08 semantics time 0.00
% 0.42/1.08
% 0.42/1.08 EQP interrupted
%------------------------------------------------------------------------------