TSTP Solution File: GRP559-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP559-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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:47:58 EDT 2022
% Result : Unsatisfiable 0.79s 1.16s
% Output : Refutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of clauses : 51 ( 51 unt; 0 nHn; 3 RR)
% Number of literals : 51 ( 0 equ; 2 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,inverse(divide(divide(B,C),divide(A,C)))),B),
file('GRP559-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP559-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP559-1.p',unknown),
[] ).
cnf(6,plain,
~ equal(divide(multiply(a3,b3),inverse(c3)),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[2,4]),
[iquote('para(2,4)')] ).
cnf(7,plain,
equal(divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(D,C))))))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(9,plain,
equal(divide(A,inverse(divide(multiply(B,C),divide(A,inverse(C))))),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(10,plain,
equal(divide(A,inverse(divide(divide(B,inverse(C)),multiply(A,C)))),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(12,plain,
equal(divide(A,inverse(divide(multiply(B,C),multiply(A,C)))),B),
inference(para,[status(thm),theory(equality)],[3,9]),
[iquote('para(3,9)')] ).
cnf(14,plain,
equal(multiply(A,divide(multiply(B,C),multiply(A,C))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,3]),1]),
[iquote('para(12,3),flip(1)')] ).
cnf(15,plain,
equal(multiply(A,divide(divide(B,inverse(C)),multiply(A,C))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,3]),1]),
[iquote('para(10,3),flip(1)')] ).
cnf(22,plain,
equal(divide(A,inverse(divide(B,B))),A),
inference(para,[status(thm),theory(equality)],[1,7]),
[iquote('para(1,7)')] ).
cnf(23,plain,
equal(multiply(A,divide(B,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,3]),1]),
[iquote('para(22,3),flip(1)')] ).
cnf(24,plain,
equal(divide(A,inverse(multiply(inverse(B),B))),A),
inference(para,[status(thm),theory(equality)],[3,22]),
[iquote('para(3,22)')] ).
cnf(27,plain,
equal(multiply(A,multiply(inverse(B),B)),A),
inference(para,[status(thm),theory(equality)],[3,24]),
[iquote('para(3,24)')] ).
cnf(55,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,12]),23]),
[iquote('para(23,12),demod([23])')] ).
cnf(57,plain,
equal(divide(inverse(A),inverse(multiply(B,A))),B),
inference(para,[status(thm),theory(equality)],[3,55]),
[iquote('para(3,55)')] ).
cnf(58,plain,
equal(divide(inverse(divide(A,A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[22,55]),
[iquote('para(22,55)')] ).
cnf(59,plain,
equal(divide(inverse(divide(A,B)),inverse(A)),B),
inference(para,[status(thm),theory(equality)],[55,55]),
[iquote('para(55,55)')] ).
cnf(64,plain,
equal(multiply(inverse(A),multiply(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[57,3]),1]),
[iquote('para(57,3),flip(1)')] ).
cnf(66,plain,
equal(multiply(inverse(divide(A,A)),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[58,3]),1]),
[iquote('para(58,3),flip(1)')] ).
cnf(67,plain,
equal(divide(A,A),inverse(divide(B,B))),
inference(para,[status(thm),theory(equality)],[66,23]),
[iquote('para(66,23)')] ).
cnf(68,plain,
equal(inverse(divide(A,A)),divide(B,B)),
inference(flip,[status(thm),theory(equality)],[67]),
[iquote('flip(67)')] ).
cnf(72,plain,
equal(divide(A,divide(B,B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[68,3]),23]),
[iquote('para(68,3),demod([23])')] ).
cnf(73,plain,
equal(divide(divide(A,A),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[72,55]),
[iquote('para(72,55)')] ).
cnf(74,plain,
equal(multiply(divide(A,A),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[73,3]),1]),
[iquote('para(73,3),flip(1)')] ).
cnf(76,plain,
equal(multiply(inverse(A),A),divide(B,B)),
inference(para,[status(thm),theory(equality)],[74,27]),
[iquote('para(74,27)')] ).
cnf(77,plain,
equal(divide(A,A),multiply(inverse(B),B)),
inference(flip,[status(thm),theory(equality)],[76]),
[iquote('flip(76)')] ).
cnf(94,plain,
equal(multiply(inverse(divide(A,B)),A),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[59,3]),1]),
[iquote('para(59,3),flip(1)')] ).
cnf(95,plain,
equal(inverse(divide(divide(A,A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[94,23]),1]),
[iquote('para(94,23),flip(1)')] ).
cnf(98,plain,
equal(multiply(A,divide(divide(B,B),C)),divide(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[95,3]),1]),
[iquote('para(95,3),flip(1)')] ).
cnf(102,plain,
equal(inverse(divide(A,B)),divide(inverse(A),inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[59,55]),1]),
[iquote('para(59,55),flip(1)')] ).
cnf(105,plain,
equal(multiply(divide(inverse(A),inverse(B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[94]),102]),
[iquote('back_demod(94),demod([102])')] ).
cnf(117,plain,
equal(divide(A,divide(inverse(B),inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[55]),102]),
[iquote('back_demod(55),demod([102])')] ).
cnf(151,plain,
equal(multiply(multiply(inverse(A),B),A),B),
inference(para,[status(thm),theory(equality)],[3,105]),
[iquote('para(3,105)')] ).
cnf(154,plain,
equal(multiply(multiply(inverse(A),A),B),B),
inference(para,[status(thm),theory(equality)],[77,105]),
[iquote('para(77,105)')] ).
cnf(158,plain,
equal(divide(A,multiply(inverse(B),A)),B),
inference(para,[status(thm),theory(equality)],[3,117]),
[iquote('para(3,117)')] ).
cnf(160,plain,
equal(divide(multiply(A,B),A),B),
inference(para,[status(thm),theory(equality)],[64,158]),
[iquote('para(64,158)')] ).
cnf(193,plain,
equal(multiply(A,B),divide(multiply(A,C),multiply(inverse(B),C))),
inference(para,[status(thm),theory(equality)],[14,151]),
[iquote('para(14,151)')] ).
cnf(194,plain,
equal(divide(multiply(A,B),multiply(inverse(C),B)),multiply(A,C)),
inference(flip,[status(thm),theory(equality)],[193]),
[iquote('flip(193)')] ).
cnf(247,plain,
equal(divide(multiply(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[193,23]),102,74]),
[iquote('para(193,23),demod([102,74])')] ).
cnf(248,plain,
equal(multiply(multiply(A,inverse(B)),B),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[247,3]),1]),
[iquote('para(247,3),flip(1)')] ).
cnf(249,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[248,154]),
[iquote('para(248,154)')] ).
cnf(282,plain,
equal(multiply(A,inverse(B)),divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[249,3]),1]),
[iquote('para(249,3),flip(1)')] ).
cnf(288,plain,
equal(multiply(divide(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[248]),282]),
[iquote('back_demod(248),demod([282])')] ).
cnf(303,plain,
equal(multiply(A,B),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[160,288]),
[iquote('para(160,288)')] ).
cnf(319,plain,
equal(divide(A,multiply(A,B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[98,15]),
[iquote('para(98,15)')] ).
cnf(324,plain,
equal(multiply(inverse(A),B),divide(B,A)),
inference(para,[status(thm),theory(equality)],[303,282]),
[iquote('para(303,282)')] ).
cnf(337,plain,
equal(divide(multiply(A,B),divide(B,C)),multiply(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[194]),324]),
[iquote('back_demod(194),demod([324])')] ).
cnf(831,plain,
equal(divide(multiply(A,B),inverse(C)),multiply(A,multiply(B,C))),
inference(para,[status(thm),theory(equality)],[319,337]),
[iquote('para(319,337)')] ).
cnf(832,plain,
$false,
inference(conflict,[status(thm)],[831,6]),
[iquote('conflict(831,6)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP559-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n016.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 04:02:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.79/1.16 ----- EQP 0.9e, May 2009 -----
% 0.79/1.16 The job began on n016.cluster.edu, Tue Jun 14 04:02:01 2022
% 0.79/1.16 The command was "./eqp09e".
% 0.79/1.16
% 0.79/1.16 set(prolog_style_variables).
% 0.79/1.16 set(lrpo).
% 0.79/1.16 set(basic_paramod).
% 0.79/1.16 set(functional_subsume).
% 0.79/1.16 set(ordered_paramod).
% 0.79/1.16 set(prime_paramod).
% 0.79/1.16 set(para_pairs).
% 0.79/1.16 assign(pick_given_ratio,4).
% 0.79/1.16 clear(print_kept).
% 0.79/1.16 clear(print_new_demod).
% 0.79/1.16 clear(print_back_demod).
% 0.79/1.16 clear(print_given).
% 0.79/1.16 assign(max_mem,64000).
% 0.79/1.16 end_of_commands.
% 0.79/1.16
% 0.79/1.16 Usable:
% 0.79/1.16 end_of_list.
% 0.79/1.16
% 0.79/1.16 Sos:
% 0.79/1.16 0 (wt=-1) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.79/1.16 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.79/1.16 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.79/1.16 end_of_list.
% 0.79/1.16
% 0.79/1.16 Demodulators:
% 0.79/1.16 end_of_list.
% 0.79/1.16
% 0.79/1.16 Passive:
% 0.79/1.16 end_of_list.
% 0.79/1.16
% 0.79/1.16 Starting to process input.
% 0.79/1.16
% 0.79/1.16 ** KEPT: 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.79/1.16 1 is a new demodulator.
% 0.79/1.16
% 0.79/1.16 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.79/1.16
% 0.79/1.16 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.79/1.16 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.79/1.16
% 0.79/1.16 ** KEPT: 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.79/1.16 ---------------- PROOF FOUND ----------------
% 0.79/1.16 % SZS status Unsatisfiable
% 0.79/1.16
% 0.79/1.16
% 0.79/1.16 After processing input:
% 0.79/1.16
% 0.79/1.16 Usable:
% 0.79/1.16 end_of_list.
% 0.79/1.16
% 0.79/1.16 Sos:
% 0.79/1.16 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.79/1.16 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.79/1.16 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.79/1.16 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.79/1.16 end_of_list.
% 0.79/1.16
% 0.79/1.16 Demodulators:
% 0.79/1.16 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.79/1.16 end_of_list.
% 0.79/1.16
% 0.79/1.16 Passive:
% 0.79/1.16 end_of_list.
% 0.79/1.16
% 0.79/1.16 UNIT CONFLICT from 831 and 6 at 0.05 seconds.
% 0.79/1.16
% 0.79/1.16 ---------------- PROOF ----------------
% 0.79/1.16 % SZS output start Refutation
% See solution above
% 0.79/1.16 ------------ end of proof -------------
% 0.79/1.16
% 0.79/1.16
% 0.79/1.16 ------------- memory usage ------------
% 0.79/1.16 Memory dynamically allocated (tp_alloc): 976.
% 0.79/1.16 type (bytes each) gets frees in use avail bytes
% 0.79/1.16 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.79/1.16 term ( 16) 53436 41158 12278 18 236.9 K
% 0.79/1.16 gen_ptr ( 8) 74645 20592 54053 50 422.7 K
% 0.79/1.16 context ( 808) 43164 43162 2 7 7.1 K
% 0.79/1.16 trail ( 12) 6528 6528 0 5 0.1 K
% 0.79/1.16 bt_node ( 68) 18212 18209 3 14 1.1 K
% 0.79/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.79/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.79/1.16 ac_match_free_vars_pos (4020)
% 0.79/1.16 0 0 0 0 0.0 K
% 0.79/1.16 discrim ( 12) 9727 6167 3560 0 41.7 K
% 0.79/1.16 flat ( 40) 94371 94371 0 23 0.9 K
% 0.79/1.16 discrim_pos ( 12) 3075 3075 0 1 0.0 K
% 0.79/1.16 fpa_head ( 12) 4678 0 4678 0 54.8 K
% 0.79/1.16 fpa_tree ( 28) 3051 3051 0 25 0.7 K
% 0.79/1.16 fpa_pos ( 36) 1350 1350 0 1 0.0 K
% 0.79/1.16 literal ( 12) 3789 2958 831 1 9.8 K
% 0.79/1.16 clause ( 24) 3789 2958 831 1 19.5 K
% 0.79/1.16 list ( 12) 578 522 56 3 0.7 K
% 0.79/1.16 list_pos ( 20) 3864 2050 1814 0 35.4 K
% 0.79/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.79/1.16
% 0.79/1.16 -------------- statistics -------------
% 0.79/1.16 Clauses input 3
% 0.79/1.16 Usable input 0
% 0.79/1.16 Sos input 3
% 0.79/1.16 Demodulators input 0
% 0.79/1.16 Passive input 0
% 0.79/1.16
% 0.79/1.16 Processed BS (before search) 5
% 0.79/1.16 Forward subsumed BS 1
% 0.79/1.16 Kept BS 4
% 0.79/1.16 New demodulators BS 1
% 0.79/1.16 Back demodulated BS 0
% 0.79/1.16
% 0.79/1.16 Clauses or pairs given 4097
% 0.79/1.16 Clauses generated 2346
% 0.79/1.16 Forward subsumed 1519
% 0.79/1.16 Deleted by weight 0
% 0.79/1.16 Deleted by variable count 0
% 0.79/1.16 Kept 827
% 0.79/1.16 New demodulators 518
% 0.79/1.16 Back demodulated 426
% 0.79/1.16 Ordered paramod prunes 0
% 0.79/1.16 Basic paramod prunes 11548
% 0.79/1.16 Prime paramod prunes 185
% 0.79/1.16 Semantic prunes 0
% 0.79/1.16
% 0.79/1.16 Rewrite attmepts 17664
% 0.79/1.16 Rewrites 2299
% 0.79/1.16
% 0.79/1.16 FPA overloads 0
% 0.79/1.16 FPA underloads 0
% 0.79/1.16
% 0.79/1.16 Usable size 0
% 0.79/1.16 Sos size 404
% 0.79/1.16 Demodulators size 176
% 0.79/1.16 Passive size 0
% 0.79/1.16 Disabled size 426
% 0.79/1.16
% 0.79/1.16 Proofs found 1
% 0.79/1.16
% 0.79/1.16 ----------- times (seconds) ----------- Tue Jun 14 04:02:01 2022
% 0.79/1.16
% 0.79/1.16 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.79/1.16 system CPU time 0.08 (0 hr, 0 min, 0 sec)
% 0.79/1.16 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.79/1.16 input time 0.00
% 0.79/1.16 paramodulation time 0.01
% 0.79/1.16 demodulation time 0.01
% 0.79/1.16 orient time 0.01
% 0.79/1.16 weigh time 0.00
% 0.79/1.16 forward subsume time 0.00
% 0.79/1.16 back demod find time 0.00
% 0.79/1.16 conflict time 0.00
% 0.79/1.16 LRPO time 0.00
% 0.79/1.16 store clause time 0.01
% 0.79/1.16 disable clause time 0.00
% 0.79/1.16 prime paramod time 0.00
% 0.79/1.16 semantics time 0.00
% 0.79/1.16
% 0.79/1.16 EQP interrupted
%------------------------------------------------------------------------------