TSTP Solution File: GRP594-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP594-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n015.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:07 EDT 2022
% Result : Unsatisfiable 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 4 RR)
% Number of literals : 38 ( 0 equ; 3 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 : 125 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))),C),
file('GRP594-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(multiply(multiply(A,B),C),double_divide(C,A)),B),
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('GRP594-1.p',unknown),
[] ).
cnf(5,plain,
equal(multiply(multiply(A,B),double_divide(B,multiply(multiply(C,A),D))),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(6,plain,
equal(multiply(A,double_divide(double_divide(B,C),multiply(C,A))),B),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(7,plain,
equal(multiply(multiply(A,B),double_divide(B,C)),double_divide(double_divide(A,D),multiply(D,C))),
inference(para,[status(thm),theory(equality)],[6,3]),
[iquote('para(6,3)')] ).
cnf(8,plain,
equal(double_divide(double_divide(A,B),multiply(B,C)),multiply(multiply(A,D),double_divide(D,C))),
inference(flip,[status(thm),theory(equality)],[7]),
[iquote('flip(7)')] ).
cnf(18,plain,
equal(double_divide(multiply(A,double_divide(B,multiply(C,A))),C),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,5]),1]),
[iquote('para(6,5),flip(1)')] ).
cnf(26,plain,
equal(double_divide(double_divide(multiply(A,B),C),multiply(C,A)),B),
inference(para,[status(thm),theory(equality)],[7,3]),
[iquote('para(7,3)')] ).
cnf(29,plain,
equal(inverse(A),multiply(multiply(B,C),double_divide(multiply(C,A),B))),
inference(para,[status(thm),theory(equality)],[26,2]),
[iquote('para(26,2)')] ).
cnf(30,plain,
equal(multiply(multiply(A,B),double_divide(multiply(B,C),A)),inverse(C)),
inference(flip,[status(thm),theory(equality)],[29]),
[iquote('flip(29)')] ).
cnf(32,plain,
equal(double_divide(double_divide(A,B),multiply(B,multiply(multiply(C,A),D))),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[7,5]),
[iquote('para(7,5)')] ).
cnf(37,plain,
~ equal(multiply(multiply(multiply(multiply(A,B),double_divide(multiply(B,b2),A)),b2),a2),a2),
inference(para,[status(thm),theory(equality)],[29,4]),
[iquote('para(29,4)')] ).
cnf(41,plain,
equal(multiply(multiply(multiply(A,B),multiply(C,double_divide(D,multiply(A,C)))),D),B),
inference(para,[status(thm),theory(equality)],[18,3]),
[iquote('para(18,3)')] ).
cnf(42,plain,
equal(multiply(multiply(multiply(multiply(A,B),C),double_divide(multiply(B,D),A)),D),C),
inference(para,[status(thm),theory(equality)],[26,3]),
[iquote('para(26,3)')] ).
cnf(51,plain,
equal(multiply(A,multiply(multiply(B,C),double_divide(C,A))),B),
inference(para,[status(thm),theory(equality)],[8,6]),
[iquote('para(8,6)')] ).
cnf(57,plain,
equal(multiply(multiply(A,multiply(B,double_divide(C,A))),C),B),
inference(para,[status(thm),theory(equality)],[6,51]),
[iquote('para(6,51)')] ).
cnf(72,plain,
equal(multiply(inverse(A),double_divide(double_divide(multiply(B,A),C),C)),B),
inference(para,[status(thm),theory(equality)],[30,3]),
[iquote('para(30,3)')] ).
cnf(73,plain,
equal(multiply(multiply(A,B),double_divide(double_divide(multiply(C,double_divide(B,A)),D),D)),C),
inference(para,[status(thm),theory(equality)],[2,72]),
[iquote('para(2,72)')] ).
cnf(78,plain,
equal(multiply(multiply(A,B),double_divide(B,inverse(C))),double_divide(double_divide(multiply(A,C),D),D)),
inference(para,[status(thm),theory(equality)],[72,3]),
[iquote('para(72,3)')] ).
cnf(79,plain,
equal(double_divide(double_divide(multiply(A,B),C),C),multiply(multiply(A,D),double_divide(D,inverse(B)))),
inference(flip,[status(thm),theory(equality)],[78]),
[iquote('flip(78)')] ).
cnf(86,plain,
equal(multiply(multiply(A,multiply(multiply(B,C),D)),double_divide(C,A)),multiply(B,D)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,2]),2]),1]),
[iquote('para(32,2),demod([2]),flip(1)')] ).
cnf(165,plain,
equal(multiply(multiply(A,double_divide(multiply(B,C),multiply(D,A))),C),double_divide(B,D)),
inference(para,[status(thm),theory(equality)],[26,5]),
[iquote('para(26,5)')] ).
cnf(238,plain,
equal(multiply(multiply(A,double_divide(multiply(B,C),D)),C),multiply(multiply(A,E),double_divide(E,multiply(D,B)))),
inference(para,[status(thm),theory(equality)],[51,42]),
[iquote('para(51,42)')] ).
cnf(239,plain,
equal(multiply(multiply(A,B),double_divide(B,multiply(C,D))),multiply(multiply(A,double_divide(multiply(D,E),C)),E)),
inference(flip,[status(thm),theory(equality)],[238]),
[iquote('flip(238)')] ).
cnf(308,plain,
equal(multiply(multiply(A,B),double_divide(B,multiply(C,D))),double_divide(double_divide(multiply(A,double_divide(D,C)),E),E)),
inference(para,[status(thm),theory(equality)],[73,3]),
[iquote('para(73,3)')] ).
cnf(309,plain,
equal(double_divide(double_divide(multiply(A,double_divide(B,C)),D),D),multiply(multiply(A,E),double_divide(E,multiply(C,B)))),
inference(flip,[status(thm),theory(equality)],[308]),
[iquote('flip(308)')] ).
cnf(326,plain,
equal(multiply(A,double_divide(double_divide(B,C),C)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[86,57]),
[iquote('para(86,57)')] ).
cnf(337,plain,
equal(multiply(inverse(A),multiply(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[72]),326]),
[iquote('back_demod(72),demod([326])')] ).
cnf(396,plain,
equal(multiply(multiply(A,B),double_divide(B,inverse(C))),multiply(A,C)),
inference(para,[status(thm),theory(equality)],[337,3]),
[iquote('para(337,3)')] ).
cnf(397,plain,
equal(double_divide(double_divide(multiply(A,B),C),C),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[79]),396]),
[iquote('back_demod(79),demod([396])')] ).
cnf(398,plain,
equal(multiply(multiply(A,B),double_divide(B,multiply(C,D))),multiply(A,double_divide(D,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[309]),397]),1]),
[iquote('back_demod(309),demod([397]),flip(1)')] ).
cnf(406,plain,
equal(multiply(multiply(A,double_divide(multiply(B,C),D)),C),multiply(A,double_divide(B,D))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[239]),398]),1]),
[iquote('back_demod(239),demod([398]),flip(1)')] ).
cnf(412,plain,
equal(multiply(A,double_divide(B,multiply(C,A))),double_divide(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[165]),406]),
[iquote('back_demod(165),demod([406])')] ).
cnf(463,plain,
equal(multiply(multiply(multiply(A,B),double_divide(C,A)),C),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[41]),412]),
[iquote('back_demod(41),demod([412])')] ).
cnf(470,plain,
~ equal(multiply(multiply(multiply(A,B),double_divide(B,A)),a2),a2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[37]),406]),
[iquote('back_demod(37),demod([406])')] ).
cnf(471,plain,
$false,
inference(conflict,[status(thm)],[470,463]),
[iquote('conflict(470,463)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP594-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n015.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 07:55:52 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.71/1.10 ----- EQP 0.9e, May 2009 -----
% 0.71/1.10 The job began on n015.cluster.edu, Mon Jun 13 07:55:53 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(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))) = C.
% 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(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))) = C.
% 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(multiply(multiply(A,B),C),double_divide(C,A)) = B.
% 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(multiply(multiply(A,B),C),double_divide(C,A)) = B.
% 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(multiply(multiply(A,B),C),double_divide(C,A)) = B.
% 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 470 and 463 at 0.02 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) 21381 12636 8745 22 169.4 K
% 0.71/1.10 gen_ptr ( 8) 40730 5031 35699 37 279.2 K
% 0.71/1.10 context ( 808) 14396 14394 2 5 5.5 K
% 0.71/1.10 trail ( 12) 3919 3919 0 8 0.1 K
% 0.71/1.10 bt_node ( 68) 4349 4346 3 16 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) 6666 2081 4585 461 59.1 K
% 0.71/1.10 flat ( 40) 50996 50996 0 32 1.2 K
% 0.71/1.10 discrim_pos ( 12) 540 540 0 1 0.0 K
% 0.71/1.10 fpa_head ( 12) 2522 0 2522 0 29.6 K
% 0.71/1.10 fpa_tree ( 28) 2279 2279 0 25 0.7 K
% 0.71/1.10 fpa_pos ( 36) 662 662 0 1 0.0 K
% 0.71/1.10 literal ( 12) 1398 928 470 0 5.5 K
% 0.71/1.10 clause ( 24) 1398 928 470 0 11.0 K
% 0.71/1.10 list ( 12) 251 191 60 3 0.7 K
% 0.71/1.10 list_pos ( 20) 1932 669 1263 44 25.5 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 589
% 0.71/1.11 Clauses generated 753
% 0.71/1.11 Forward subsumed 287
% 0.71/1.11 Deleted by weight 0
% 0.71/1.11 Deleted by variable count 0
% 0.71/1.11 Kept 466
% 0.71/1.11 New demodulators 189
% 0.71/1.11 Back demodulated 149
% 0.71/1.11 Ordered paramod prunes 0
% 0.71/1.11 Basic paramod prunes 2044
% 0.71/1.11 Prime paramod prunes 7
% 0.71/1.11 Semantic prunes 0
% 0.71/1.11
% 0.71/1.11 Rewrite attmepts 7375
% 0.71/1.11 Rewrites 339
% 0.71/1.11
% 0.71/1.11 FPA overloads 0
% 0.71/1.11 FPA underloads 0
% 0.71/1.11
% 0.71/1.11 Usable size 0
% 0.71/1.11 Sos size 319
% 0.71/1.11 Demodulators size 128
% 0.71/1.11 Passive size 0
% 0.71/1.11 Disabled size 150
% 0.71/1.11
% 0.71/1.11 Proofs found 1
% 0.71/1.11
% 0.71/1.11 ----------- times (seconds) ----------- Mon Jun 13 07:55:53 2022
% 0.71/1.11
% 0.71/1.11 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.11 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.11 input time 0.00
% 0.71/1.11 paramodulation time 0.00
% 0.71/1.11 demodulation time 0.00
% 0.71/1.11 orient time 0.00
% 0.71/1.11 weigh time 0.00
% 0.71/1.11 forward subsume time 0.00
% 0.71/1.11 back demod find time 0.00
% 0.71/1.11 conflict time 0.00
% 0.71/1.11 LRPO time 0.00
% 0.71/1.11 store clause time 0.01
% 0.71/1.11 disable clause time 0.00
% 0.71/1.11 prime paramod time 0.00
% 0.71/1.11 semantics time 0.00
% 0.71/1.11
% 0.71/1.11 EQP interrupted
%------------------------------------------------------------------------------