TSTP Solution File: GRP609-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP609-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %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 : 600s
% DateTime : Sat Jul 16 08:48:12 EDT 2022
% Result : Unsatisfiable 0.74s 1.12s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 1
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 2 RR)
% Number of literals : 46 ( 0 equ; 1 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 : 128 ( 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('GRP609-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(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
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(24,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(27,plain,
equal(inverse(A),multiply(double_divide(B,multiply(A,C)),multiply(C,B))),
inference(para,[status(thm),theory(equality)],[24,2]),
[iquote('para(24,2)')] ).
cnf(28,plain,
equal(multiply(double_divide(A,multiply(B,C)),multiply(C,A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[27]),
[iquote('flip(27)')] ).
cnf(51,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(54,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,51]),
[iquote('para(3,51)')] ).
cnf(55,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),C),B)),C),
inference(para,[status(thm),theory(equality)],[6,51]),
[iquote('para(6,51)')] ).
cnf(65,plain,
equal(multiply(multiply(double_divide(A,B),C),A),multiply(multiply(double_divide(D,B),C),D)),
inference(para,[status(thm),theory(equality)],[55,51]),
[iquote('para(55,51)')] ).
cnf(67,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,51]),
[iquote('para(20,51)')] ).
cnf(70,plain,
equal(multiply(double_divide(A,double_divide(A,multiply(B,C))),inverse(B)),C),
inference(para,[status(thm),theory(equality)],[28,3]),
[iquote('para(28,3)')] ).
cnf(74,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)],[28,51]),54]),
[iquote('para(28,51),demod([54])')] ).
cnf(81,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,74]),2]),1]),
[iquote('para(3,74),demod([2]),flip(1)')] ).
cnf(142,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,67]),81]),
[iquote('para(2,67),demod([81])')] ).
cnf(242,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,65]),1]),
[iquote('para(18,65),flip(1)')] ).
cnf(243,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)],[142]),242]),
[iquote('back_demod(142),demod([242])')] ).
cnf(244,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[67]),242]),
[iquote('back_demod(67),demod([242])')] ).
cnf(249,plain,
equal(multiply(double_divide(A,B),multiply(B,A)),multiply(C,inverse(C))),
inference(para,[status(thm),theory(equality)],[244,3]),
[iquote('para(244,3)')] ).
cnf(292,plain,
equal(multiply(double_divide(A,B),A),multiply(double_divide(C,B),C)),
inference(para,[status(thm),theory(equality)],[243,3]),
[iquote('para(243,3)')] ).
cnf(303,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)],[24,292]),1]),
[iquote('para(24,292),flip(1)')] ).
cnf(331,plain,
equal(multiply(double_divide(A,double_divide(A,B)),multiply(C,inverse(C))),B),
inference(para,[status(thm),theory(equality)],[249,3]),
[iquote('para(249,3)')] ).
cnf(351,plain,
equal(multiply(A,multiply(B,inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[292,70]),303]),
[iquote('para(292,70),demod([303])')] ).
cnf(355,plain,
equal(multiply(A,inverse(A)),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[244,351]),
[iquote('para(244,351)')] ).
cnf(362,plain,
equal(multiply(A,multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[355,351]),
[iquote('para(355,351)')] ).
cnf(363,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[331]),362]),
[iquote('back_demod(331),demod([362])')] ).
cnf(373,plain,
equal(inverse(A),multiply(double_divide(B,A),B)),
inference(para,[status(thm),theory(equality)],[363,2]),
[iquote('para(363,2)')] ).
cnf(376,plain,
equal(multiply(double_divide(A,double_divide(B,C)),A),multiply(C,B)),
inference(para,[status(thm),theory(equality)],[373,2]),
[iquote('para(373,2)')] ).
cnf(377,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[303]),376]),
[iquote('back_demod(303),demod([376])')] ).
cnf(405,plain,
equal(multiply(A,multiply(inverse(A),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[244]),377]),
[iquote('back_demod(244),demod([377])')] ).
cnf(524,plain,
equal(multiply(A,B),multiply(B,inverse(inverse(A)))),
inference(para,[status(thm),theory(equality)],[351,405]),
[iquote('para(351,405)')] ).
cnf(525,plain,
equal(multiply(A,inverse(inverse(B))),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[524]),
[iquote('flip(524)')] ).
cnf(527,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[405,362]),
[iquote('para(405,362)')] ).
cnf(528,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[525]),527]),
[iquote('back_demod(525),demod([527])')] ).
cnf(536,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(para,[status(thm),theory(equality)],[527,405]),
[iquote('para(527,405)')] ).
cnf(544,plain,
equal(multiply(A,multiply(inverse(B),B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[528,351]),377]),
[iquote('para(528,351),demod([377])')] ).
cnf(575,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[544,536]),
[iquote('para(544,536)')] ).
cnf(576,plain,
$false,
inference(conflict,[status(thm)],[575,4]),
[iquote('conflict(575,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP609-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %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 : 600
% 0.12/0.33 % DateTime : Tue Jun 14 13:14:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.12 ----- EQP 0.9e, May 2009 -----
% 0.74/1.12 The job began on n010.cluster.edu, Tue Jun 14 13:14:10 2022
% 0.74/1.12 The command was "./eqp09e".
% 0.74/1.12
% 0.74/1.12 set(prolog_style_variables).
% 0.74/1.12 set(lrpo).
% 0.74/1.12 set(basic_paramod).
% 0.74/1.12 set(functional_subsume).
% 0.74/1.12 set(ordered_paramod).
% 0.74/1.12 set(prime_paramod).
% 0.74/1.12 set(para_pairs).
% 0.74/1.12 assign(pick_given_ratio,4).
% 0.74/1.12 clear(print_kept).
% 0.74/1.12 clear(print_new_demod).
% 0.74/1.12 clear(print_back_demod).
% 0.74/1.12 clear(print_given).
% 0.74/1.12 assign(max_mem,64000).
% 0.74/1.12 end_of_commands.
% 0.74/1.12
% 0.74/1.12 Usable:
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Sos:
% 0.74/1.12 0 (wt=-1) [] inverse(double_divide(inverse(double_divide(inverse(double_divide(A,B)),C)),double_divide(A,C))) = B.
% 0.74/1.12 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.74/1.12 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Demodulators:
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Passive:
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Starting to process input.
% 0.74/1.12
% 0.74/1.12 ** KEPT: 1 (wt=14) [] inverse(double_divide(inverse(double_divide(inverse(double_divide(A,B)),C)),double_divide(A,C))) = B.
% 0.74/1.12 1 is a new demodulator.
% 0.74/1.12
% 0.74/1.12 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.74/1.12 2 is a new demodulator.
% 0.74/1.12 -> 2 back demodulating 1.
% 0.74/1.12
% 0.74/1.12 ** KEPT: 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.74/1.12 3 is a new demodulator.
% 0.74/1.12
% 0.74/1.12 ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.74/1.12 ---------------- PROOF FOUND ----------------
% 0.74/1.12 % SZS status Unsatisfiable
% 0.74/1.12
% 0.74/1.12
% 0.74/1.12 After processing input:
% 0.74/1.12
% 0.74/1.12 Usable:
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Sos:
% 0.74/1.12 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.74/1.12 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.74/1.12 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Demodulators:
% 0.74/1.12 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.74/1.12 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(double_divide(A,B),multiply(B,multiply(C,A))) = C.
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Passive:
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 UNIT CONFLICT from 575 and 4 at 0.03 seconds.
% 0.74/1.12
% 0.74/1.12 ---------------- PROOF ----------------
% 0.74/1.12 % SZS output start Refutation
% See solution above
% 0.74/1.12 ------------ end of proof -------------
% 0.74/1.12
% 0.74/1.12
% 0.74/1.12 ------------- memory usage ------------
% 0.74/1.12 Memory dynamically allocated (tp_alloc): 976.
% 0.74/1.12 type (bytes each) gets frees in use avail bytes
% 0.74/1.12 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.74/1.12 term ( 16) 26714 16569 10145 22 196.3 K
% 0.74/1.12 gen_ptr ( 8) 48028 7463 40565 45 317.3 K
% 0.74/1.12 context ( 808) 17949 17947 2 3 3.9 K
% 0.74/1.12 trail ( 12) 5247 5247 0 8 0.1 K
% 0.74/1.12 bt_node ( 68) 5142 5139 3 16 1.3 K
% 0.74/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.12 ac_match_free_vars_pos (4020)
% 0.74/1.12 0 0 0 0 0.0 K
% 0.74/1.12 discrim ( 12) 7313 2875 4438 76 52.9 K
% 0.74/1.12 flat ( 40) 61459 61459 0 32 1.2 K
% 0.74/1.12 discrim_pos ( 12) 804 804 0 1 0.0 K
% 0.74/1.12 fpa_head ( 12) 2602 0 2602 0 30.5 K
% 0.74/1.12 fpa_tree ( 28) 2127 2127 0 25 0.7 K
% 0.74/1.12 fpa_pos ( 36) 816 816 0 1 0.0 K
% 0.74/1.12 literal ( 12) 1826 1251 575 1 6.8 K
% 0.74/1.12 clause ( 24) 1826 1251 575 1 13.5 K
% 0.74/1.12 list ( 12) 300 244 56 4 0.7 K
% 0.74/1.12 list_pos ( 20) 2405 992 1413 0 27.6 K
% 0.74/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.12
% 0.74/1.12 -------------- statistics -------------
% 0.74/1.12 Clauses input 3
% 0.74/1.12 Usable input 0
% 0.74/1.12 Sos input 3
% 0.74/1.12 Demodulators input 0
% 0.74/1.12 Passive input 0
% 0.74/1.12
% 0.74/1.12 Processed BS (before search) 4
% 0.74/1.12 Forward subsumed BS 0
% 0.74/1.12 Kept BS 4
% 0.74/1.12 New demodulators BS 3
% 0.74/1.12 Back demodulated BS 1
% 0.74/1.12
% 0.74/1.12 Clauses or pairs given 844
% 0.74/1.12 Clauses generated 1013
% 0.74/1.12 Forward subsumed 442
% 0.74/1.12 Deleted by weight 0
% 0.74/1.12 Deleted by variable count 0
% 0.74/1.12 Kept 571
% 0.74/1.12 New demodulators 238
% 0.74/1.12 Back demodulated 218
% 0.74/1.12 Ordered paramod prunes 0
% 0.74/1.12 Basic paramod prunes 2884
% 0.74/1.12 Prime paramod prunes 27
% 0.74/1.12 Semantic prunes 0
% 0.74/1.12
% 0.74/1.12 Rewrite attmepts 9300
% 0.74/1.12 Rewrites 508
% 0.74/1.12
% 0.74/1.12 FPA overloads 0
% 0.74/1.12 FPA underloads 0
% 0.74/1.12
% 0.74/1.12 Usable size 0
% 0.74/1.12 Sos size 355
% 0.74/1.12 Demodulators size 129
% 0.74/1.12 Passive size 0
% 0.74/1.12 Disabled size 219
% 0.74/1.12
% 0.74/1.12 Proofs found 1
% 0.74/1.12
% 0.74/1.12 ----------- times (seconds) ----------- Tue Jun 14 13:14:10 2022
% 0.74/1.12
% 0.74/1.12 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.74/1.12 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.74/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.12 input time 0.00
% 0.74/1.12 paramodulation time 0.00
% 0.74/1.12 demodulation time 0.00
% 0.74/1.12 orient time 0.01
% 0.74/1.12 weigh time 0.00
% 0.74/1.12 forward subsume time 0.00
% 0.74/1.12 back demod find time 0.00
% 0.74/1.12 conflict time 0.00
% 0.74/1.12 LRPO time 0.00
% 0.74/1.12 store clause time 0.00
% 0.74/1.12 disable clause time 0.00
% 0.74/1.12 prime paramod time 0.00
% 0.74/1.12 semantics time 0.00
% 0.74/1.12
% 0.74/1.12 EQP interrupted
%------------------------------------------------------------------------------