%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP531-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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:50 EDT 2022
% Result : Unsatisfiable 0.71s 1.16s
% Output : Refutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 4
% Syntax : Number of clauses : 56 ( 56 unt; 0 nHn; 3 RR)
% Number of literals : 56 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 138 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,divide(B,C)),divide(A,B)),C),
file('GRP531-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP531-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,divide(divide(B,B),C)),multiply(A,C)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
equal(inverse(A),divide(divide(B,B),A)),
file('GRP531-1.p',unknown),
[] ).
cnf(5,plain,
equal(divide(divide(A,A),B),inverse(B)),
inference(flip,[status(thm),theory(equality)],[4]),
[iquote('flip(4)')] ).
cnf(6,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP531-1.p',unknown),
[] ).
cnf(8,plain,
equal(divide(inverse(divide(A,A)),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[5,5]),
[iquote('para(5,5)')] ).
cnf(10,plain,
equal(divide(divide(divide(A,A),divide(B,B)),C),inverse(C)),
inference(para,[status(thm),theory(equality)],[4,8]),
[iquote('para(4,8)')] ).
cnf(12,plain,
equal(divide(divide(A,B),divide(A,divide(C,divide(D,B)))),divide(C,D)),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(15,plain,
equal(divide(inverse(inverse(divide(A,A))),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[8,5]),
[iquote('para(8,5)')] ).
cnf(30,plain,
equal(divide(divide(A,multiply(B,C)),divide(A,B)),divide(divide(D,D),C)),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(31,plain,
equal(divide(divide(A,A),B),divide(divide(C,multiply(D,B)),divide(C,D))),
inference(flip,[status(thm),theory(equality)],[30]),
[iquote('flip(30)')] ).
cnf(32,plain,
equal(divide(multiply(A,B),divide(A,divide(C,C))),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(43,plain,
equal(inverse(divide(divide(A,B),A)),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(44,plain,
equal(divide(divide(A,A),divide(divide(B,C),B)),C),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[43,4]),1]),
[iquote('para(43,4),flip(1)')] ).
cnf(53,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(59,plain,
equal(divide(multiply(inverse(A),A),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[53,5]),
[iquote('para(53,5)')] ).
cnf(66,plain,
equal(multiply(inverse(divide(A,A)),B),inverse(inverse(B))),
inference(para,[status(thm),theory(equality)],[53,8]),
[iquote('para(53,8)')] ).
cnf(67,plain,
equal(inverse(inverse(A)),multiply(inverse(divide(B,B)),A)),
inference(flip,[status(thm),theory(equality)],[66]),
[iquote('flip(66)')] ).
cnf(68,plain,
equal(multiply(multiply(inverse(A),A),B),inverse(inverse(B))),
inference(para,[status(thm),theory(equality)],[53,59]),
[iquote('para(53,59)')] ).
cnf(69,plain,
equal(inverse(inverse(A)),multiply(multiply(inverse(B),B),A)),
inference(flip,[status(thm),theory(equality)],[68]),
[iquote('flip(68)')] ).
cnf(106,plain,
equal(multiply(inverse(inverse(divide(A,A))),B),inverse(inverse(B))),
inference(para,[status(thm),theory(equality)],[53,15]),
[iquote('para(53,15)')] ).
cnf(107,plain,
equal(inverse(inverse(A)),multiply(inverse(inverse(divide(B,B))),A)),
inference(flip,[status(thm),theory(equality)],[106]),
[iquote('flip(106)')] ).
cnf(112,plain,
equal(inverse(divide(divide(A,A),B)),multiply(inverse(divide(C,C)),B)),
inference(para,[status(thm),theory(equality)],[8,3]),
[iquote('para(8,3)')] ).
cnf(113,plain,
equal(multiply(inverse(divide(A,A)),B),inverse(divide(divide(C,C),B))),
inference(flip,[status(thm),theory(equality)],[112]),
[iquote('flip(112)')] ).
cnf(119,plain,
equal(multiply(inverse(divide(A,A)),B),divide(divide(C,C),inverse(B))),
inference(para,[status(thm),theory(equality)],[67,4]),
[iquote('para(67,4)')] ).
cnf(120,plain,
equal(divide(divide(A,A),inverse(B)),multiply(inverse(divide(C,C)),B)),
inference(flip,[status(thm),theory(equality)],[119]),
[iquote('flip(119)')] ).
cnf(123,plain,
equal(multiply(multiply(inverse(A),A),B),divide(divide(C,C),inverse(B))),
inference(para,[status(thm),theory(equality)],[69,4]),
[iquote('para(69,4)')] ).
cnf(124,plain,
equal(divide(divide(A,A),inverse(B)),multiply(multiply(inverse(C),C),B)),
inference(flip,[status(thm),theory(equality)],[123]),
[iquote('flip(123)')] ).
cnf(129,plain,
equal(divide(divide(A,inverse(B)),divide(A,divide(divide(C,C),divide(D,D)))),B),
inference(para,[status(thm),theory(equality)],[10,1]),
[iquote('para(10,1)')] ).
cnf(132,plain,
equal(inverse(divide(divide(A,A),B)),B),
inference(para,[status(thm),theory(equality)],[10,1]),
[iquote('para(10,1)')] ).
cnf(133,plain,
equal(multiply(inverse(divide(A,A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[113]),132]),
[iquote('back_demod(113),demod([132])')] ).
cnf(138,plain,
equal(divide(divide(A,A),inverse(B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[120]),133]),
[iquote('back_demod(120),demod([133])')] ).
cnf(139,plain,
equal(multiply(multiply(inverse(A),A),B),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[124]),138]),1]),
[iquote('back_demod(124),demod([138]),flip(1)')] ).
cnf(140,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[69]),139]),
[iquote('back_demod(69),demod([139])')] ).
cnf(142,plain,
equal(multiply(divide(A,A),B),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[107]),140,140]),1]),
[iquote('back_demod(107),demod([140,140]),flip(1)')] ).
cnf(157,plain,
equal(divide(divide(A,B),divide(divide(C,D),C)),divide(A,divide(B,D))),
inference(para,[status(thm),theory(equality)],[12,1]),
[iquote('para(12,1)')] ).
cnf(158,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[44]),157]),
[iquote('back_demod(44),demod([157])')] ).
cnf(162,plain,
equal(divide(A,multiply(A,B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[53,158]),
[iquote('para(53,158)')] ).
cnf(163,plain,
equal(inverse(A),divide(B,multiply(B,A))),
inference(flip,[status(thm),theory(equality)],[162]),
[iquote('flip(162)')] ).
cnf(178,plain,
equal(divide(A,divide(B,multiply(B,C))),multiply(A,C)),
inference(para,[status(thm),theory(equality)],[163,53]),
[iquote('para(163,53)')] ).
cnf(179,plain,
equal(multiply(A,B),divide(A,divide(C,multiply(C,B)))),
inference(flip,[status(thm),theory(equality)],[178]),
[iquote('flip(178)')] ).
cnf(180,plain,
equal(divide(A,divide(B,divide(C,C))),divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,10]),132]),1]),
[iquote('para(12,10),demod([132]),flip(1)')] ).
cnf(181,plain,
equal(divide(divide(A,inverse(B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[129]),180,180]),
[iquote('back_demod(129),demod([180,180])')] ).
cnf(183,plain,
equal(divide(multiply(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),180]),
[iquote('back_demod(32),demod([180])')] ).
cnf(186,plain,
equal(divide(divide(A,B),A),inverse(B)),
inference(para,[status(thm),theory(equality)],[140,181]),
[iquote('para(140,181)')] ).
cnf(188,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[142,183]),
[iquote('para(142,183)')] ).
cnf(216,plain,
equal(inverse(divide(A,B)),divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[158,186]),1]),
[iquote('para(158,186),flip(1)')] ).
cnf(253,plain,
equal(divide(divide(A,divide(divide(B,multiply(C,D)),divide(B,C))),A),D),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,1]),188]),
[iquote('para(31,1),demod([188])')] ).
cnf(318,plain,
equal(divide(divide(A,divide(B,C)),A),divide(C,B)),
inference(para,[status(thm),theory(equality)],[216,181]),
[iquote('para(216,181)')] ).
cnf(321,plain,
equal(divide(divide(A,B),divide(A,multiply(B,C))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[253]),318]),
[iquote('back_demod(253),demod([318])')] ).
cnf(618,plain,
equal(divide(A,divide(multiply(B,A),multiply(B,C))),C),
inference(para,[status(thm),theory(equality)],[183,321]),
[iquote('para(183,321)')] ).
cnf(665,plain,
equal(divide(multiply(A,B),multiply(A,C)),divide(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[618,158]),1]),
[iquote('para(618,158),flip(1)')] ).
cnf(686,plain,
equal(divide(multiply(A,B),divide(B,C)),multiply(A,C)),
inference(para,[status(thm),theory(equality)],[665,158]),
[iquote('para(665,158)')] ).
cnf(696,plain,
~ equal(divide(multiply(a3,b3),divide(A,multiply(A,c3))),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[179,6]),
[iquote('para(179,6)')] ).
cnf(697,plain,
$false,
inference(conflict,[status(thm)],[696,686]),
[iquote('conflict(696,686)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP531-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n011.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 09:33:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.16 ----- EQP 0.9e, May 2009 -----
% 0.71/1.16 The job began on n011.cluster.edu, Tue Jun 14 09:33:05 2022
% 0.71/1.16 The command was "./eqp09e".
% 0.71/1.16
% 0.71/1.16 set(prolog_style_variables).
% 0.71/1.16 set(lrpo).
% 0.71/1.16 set(basic_paramod).
% 0.71/1.16 set(functional_subsume).
% 0.71/1.16 set(ordered_paramod).
% 0.71/1.16 set(prime_paramod).
% 0.71/1.16 set(para_pairs).
% 0.71/1.16 assign(pick_given_ratio,4).
% 0.71/1.16 clear(print_kept).
% 0.71/1.16 clear(print_new_demod).
% 0.71/1.16 clear(print_back_demod).
% 0.71/1.16 clear(print_given).
% 0.71/1.16 assign(max_mem,64000).
% 0.71/1.16 end_of_commands.
% 0.71/1.16
% 0.71/1.16 Usable:
% 0.71/1.16 end_of_list.
% 0.71/1.16
% 0.71/1.16 Sos:
% 0.71/1.16 0 (wt=-1) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.71/1.16 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.71/1.16 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.71/1.16 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.71/1.16 end_of_list.
% 0.71/1.16
% 0.71/1.16 Demodulators:
% 0.71/1.16 end_of_list.
% 0.71/1.16
% 0.71/1.16 Passive:
% 0.71/1.16 end_of_list.
% 0.71/1.16
% 0.71/1.16 Starting to process input.
% 0.71/1.16
% 0.71/1.16 ** KEPT: 1 (wt=11) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.71/1.16 1 is a new demodulator.
% 0.71/1.16
% 0.71/1.16 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.71/1.16
% 0.71/1.16 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.71/1.16 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.71/1.16
% 0.71/1.16 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.71/1.16
% 0.71/1.16 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.71/1.16 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.71/1.16
% 0.71/1.16 ** KEPT: 6 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.71/1.16 ---------------- PROOF FOUND ----------------
% 0.71/1.16 % SZS status Unsatisfiable
% 0.71/1.16
% 0.71/1.16
% 0.71/1.16 After processing input:
% 0.71/1.16
% 0.71/1.16 Usable:
% 0.71/1.16 end_of_list.
% 0.71/1.16
% 0.71/1.16 Sos:
% 0.71/1.16 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.71/1.16 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.71/1.16 1 (wt=11) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.71/1.16 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.71/1.16 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.71/1.16 6 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.71/1.16 end_of_list.
% 0.71/1.16
% 0.71/1.16 Demodulators:
% 0.71/1.16 1 (wt=11) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.71/1.16 end_of_list.
% 0.71/1.16
% 0.71/1.16 Passive:
% 0.71/1.16 end_of_list.
% 0.71/1.16
% 0.71/1.16 UNIT CONFLICT from 696 and 686 at 0.04 seconds.
% 0.71/1.16
% 0.71/1.16 ---------------- PROOF ----------------
% 0.71/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) 47417 36768 10649 19 205.6 K
% 0.79/1.16 gen_ptr ( 8) 54378 14820 39558 55 309.5 K
% 0.79/1.16 context ( 808) 29613 29611 2 5 5.5 K
% 0.79/1.16 trail ( 12) 5601 5601 0 7 0.1 K
% 0.79/1.16 bt_node ( 68) 9742 9739 3 12 1.0 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) 6688 3812 2876 0 33.7 K
% 0.79/1.16 flat ( 40) 93500 93500 0 27 1.1 K
% 0.79/1.16 discrim_pos ( 12) 2462 2462 0 1 0.0 K
% 0.79/1.16 fpa_head ( 12) 1486 0 1486 0 17.4 K
% 0.79/1.16 fpa_tree ( 28) 1234 1234 0 25 0.7 K
% 0.79/1.16 fpa_pos ( 36) 938 938 0 1 0.0 K
% 0.79/1.16 literal ( 12) 3510 2814 696 0 8.2 K
% 0.79/1.16 clause ( 24) 3510 2814 696 0 16.3 K
% 0.79/1.16 list ( 12) 301 245 56 7 0.7 K
% 0.79/1.16 list_pos ( 20) 3081 1630 1451 0 28.3 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 4
% 0.79/1.16 Usable input 0
% 0.79/1.16 Sos input 4
% 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) 8
% 0.79/1.16 Forward subsumed BS 2
% 0.79/1.16 Kept BS 6
% 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 2125
% 0.79/1.16 Clauses generated 2057
% 0.79/1.16 Forward subsumed 1367
% 0.79/1.16 Deleted by weight 0
% 0.79/1.16 Deleted by variable count 0
% 0.79/1.16 Kept 690
% 0.79/1.16 New demodulators 241
% 0.79/1.16 Back demodulated 365
% 0.79/1.16 Ordered paramod prunes 0
% 0.79/1.16 Basic paramod prunes 3804
% 0.79/1.16 Prime paramod prunes 105
% 0.79/1.16 Semantic prunes 0
% 0.79/1.16
% 0.79/1.16 Rewrite attmepts 15224
% 0.79/1.16 Rewrites 1618
% 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 330
% 0.79/1.16 Demodulators size 96
% 0.79/1.16 Passive size 0
% 0.79/1.16 Disabled size 365
% 0.79/1.16
% 0.79/1.16 Proofs found 1
% 0.79/1.16
% 0.79/1.16 ----------- times (seconds) ----------- Tue Jun 14 09:33:05 2022
% 0.79/1.16
% 0.79/1.16 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.79/1.16 system CPU time 0.06 (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.00
% 0.79/1.16 orient time 0.00
% 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.00
% 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
%------------------------------------------------------------------------------