%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP449-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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:28 EDT 2022
% Result : Unsatisfiable 1.28s 1.65s
% Output : Refutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 3 RR)
% Number of literals : 47 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,divide(divide(divide(divide(B,B),B),C),divide(divide(divide(B,B),A),C))),B),
file('GRP449-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP449-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('GRP449-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(inverse(b2),b2),a2),a2),
file('GRP449-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(52,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(53,plain,
equal(multiply(A,B),divide(A,inverse(B))),
inference(flip,[status(thm),theory(equality)],[52]),
[iquote('flip(52)')] ).
cnf(58,plain,
equal(divide(multiply(inverse(A),A),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[52,5]),
[iquote('para(52,5)')] ).
cnf(63,plain,
equal(divide(A,divide(divide(inverse(B),C),divide(divide(divide(B,B),A),C))),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(76,plain,
equal(inverse(inverse(A)),multiply(multiply(inverse(B),B),A)),
inference(para,[status(thm),theory(equality)],[58,52]),
[iquote('para(58,52)')] ).
cnf(77,plain,
equal(multiply(multiply(inverse(A),A),B),inverse(inverse(B))),
inference(flip,[status(thm),theory(equality)],[76]),
[iquote('flip(76)')] ).
cnf(151,plain,
~ equal(inverse(inverse(a2)),a2),
inference(para,[status(thm),theory(equality)],[77,6]),
[iquote('para(77,6)')] ).
cnf(1708,plain,
equal(divide(A,divide(divide(inverse(B),C),divide(inverse(A),C))),B),
inference(para,[status(thm),theory(equality)],[5,63]),
[iquote('para(5,63)')] ).
cnf(1709,plain,
equal(divide(divide(A,A),divide(divide(inverse(A),B),inverse(B))),A),
inference(para,[status(thm),theory(equality)],[5,63]),
[iquote('para(5,63)')] ).
cnf(1962,plain,
equal(divide(A,inverse(divide(inverse(A),inverse(B)))),B),
inference(para,[status(thm),theory(equality)],[5,1708]),
[iquote('para(5,1708)')] ).
cnf(1965,plain,
equal(multiply(A,divide(inverse(A),inverse(B))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1962,52]),1]),
[iquote('para(1962,52),flip(1)')] ).
cnf(2031,plain,
equal(divide(divide(A,A),inverse(inverse(inverse(A)))),A),
inference(para,[status(thm),theory(equality)],[5,1709]),
[iquote('para(5,1709)')] ).
cnf(2038,plain,
equal(inverse(inverse(inverse(inverse(A)))),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2031,5]),1]),
[iquote('para(2031,5),flip(1)')] ).
cnf(3930,plain,
equal(divide(A,divide(inverse(B),divide(inverse(A),B))),divide(C,C)),
inference(para,[status(thm),theory(equality)],[8,1708]),
[iquote('para(8,1708)')] ).
cnf(4173,plain,
equal(divide(divide(A,A),divide(inverse(B),inverse(B))),divide(C,C)),
inference(para,[status(thm),theory(equality)],[8,3930]),
[iquote('para(8,3930)')] ).
cnf(4175,plain,
equal(divide(A,inverse(divide(inverse(A),divide(B,B)))),divide(C,C)),
inference(para,[status(thm),theory(equality)],[8,3930]),
[iquote('para(8,3930)')] ).
cnf(4176,plain,
equal(divide(A,A),divide(B,inverse(divide(inverse(B),divide(C,C))))),
inference(flip,[status(thm),theory(equality)],[4175]),
[iquote('flip(4175)')] ).
cnf(4177,plain,
equal(divide(divide(A,A),divide(B,B)),divide(C,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2038,4173]),2038]),
[iquote('para(2038,4173),demod([2038])')] ).
cnf(4179,plain,
equal(divide(A,A),inverse(divide(B,B))),
inference(para,[status(thm),theory(equality)],[4177,5]),
[iquote('para(4177,5)')] ).
cnf(4180,plain,
equal(inverse(divide(A,A)),divide(B,B)),
inference(flip,[status(thm),theory(equality)],[4179]),
[iquote('flip(4179)')] ).
cnf(4183,plain,
equal(inverse(divide(A,A)),inverse(divide(B,B))),
inference(para,[status(thm),theory(equality)],[4179,5]),
[iquote('para(4179,5)')] ).
cnf(4186,plain,
equal(divide(A,divide(B,B)),multiply(A,divide(C,C))),
inference(para,[status(thm),theory(equality)],[4180,52]),
[iquote('para(4180,52)')] ).
cnf(4187,plain,
equal(multiply(A,divide(B,B)),divide(A,divide(C,C))),
inference(flip,[status(thm),theory(equality)],[4186]),
[iquote('flip(4186)')] ).
cnf(4200,plain,
equal(divide(A,inverse(divide(B,B))),multiply(A,divide(C,C))),
inference(para,[status(thm),theory(equality)],[4183,52]),
[iquote('para(4183,52)')] ).
cnf(4201,plain,
equal(multiply(A,divide(B,B)),divide(A,inverse(divide(C,C)))),
inference(flip,[status(thm),theory(equality)],[4200]),
[iquote('flip(4200)')] ).
cnf(4265,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[4180,1962]),
[iquote('para(4180,1962)')] ).
cnf(4268,plain,
equal(multiply(A,divide(B,B)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4187]),4265]),
[iquote('back_demod(4187),demod([4265])')] ).
cnf(4271,plain,
equal(divide(A,inverse(divide(B,B))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4201]),4268]),1]),
[iquote('back_demod(4201),demod([4268]),flip(1)')] ).
cnf(4276,plain,
equal(divide(A,A),divide(B,inverse(inverse(B)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4176]),4265]),
[iquote('back_demod(4176),demod([4265])')] ).
cnf(4277,plain,
equal(divide(A,inverse(inverse(A))),divide(B,B)),
inference(flip,[status(thm),theory(equality)],[4276]),
[iquote('flip(4276)')] ).
cnf(4393,plain,
equal(divide(A,A),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[4277,52]),
[iquote('para(4277,52)')] ).
cnf(4395,plain,
equal(divide(multiply(A,inverse(A)),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[4393,5]),
[iquote('para(4393,5)')] ).
cnf(4396,plain,
equal(inverse(A),divide(multiply(B,inverse(B)),A)),
inference(flip,[status(thm),theory(equality)],[4395]),
[iquote('flip(4395)')] ).
cnf(4443,plain,
equal(divide(A,multiply(B,inverse(B))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4396,4271]),4265]),
[iquote('para(4396,4271),demod([4265])')] ).
cnf(4447,plain,
equal(divide(A,divide(B,inverse(inverse(B)))),A),
inference(para,[status(thm),theory(equality)],[53,4443]),
[iquote('para(53,4443)')] ).
cnf(4481,plain,
equal(divide(A,A),inverse(divide(B,inverse(inverse(B))))),
inference(para,[status(thm),theory(equality)],[4447,5]),
[iquote('para(4447,5)')] ).
cnf(4482,plain,
equal(inverse(divide(A,inverse(inverse(A)))),divide(B,B)),
inference(flip,[status(thm),theory(equality)],[4481]),
[iquote('flip(4481)')] ).
cnf(4901,plain,
equal(multiply(A,divide(B,inverse(inverse(B)))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4482,52]),4265]),1]),
[iquote('para(4482,52),demod([4265]),flip(1)')] ).
cnf(4903,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4901,1965]),1]),
[iquote('para(4901,1965),flip(1)')] ).
cnf(4904,plain,
$false,
inference(conflict,[status(thm)],[4903,151]),
[iquote('conflict(4903,151)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP449-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 08:03:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.28/1.65 ----- EQP 0.9e, May 2009 -----
% 1.28/1.65 The job began on n022.cluster.edu, Mon Jun 13 08:03:04 2022
% 1.28/1.65 The command was "./eqp09e".
% 1.28/1.65
% 1.28/1.65 set(prolog_style_variables).
% 1.28/1.65 set(lrpo).
% 1.28/1.65 set(basic_paramod).
% 1.28/1.65 set(functional_subsume).
% 1.28/1.65 set(ordered_paramod).
% 1.28/1.65 set(prime_paramod).
% 1.28/1.65 set(para_pairs).
% 1.28/1.65 assign(pick_given_ratio,4).
% 1.28/1.65 clear(print_kept).
% 1.28/1.65 clear(print_new_demod).
% 1.28/1.65 clear(print_back_demod).
% 1.28/1.65 clear(print_given).
% 1.28/1.65 assign(max_mem,64000).
% 1.28/1.65 end_of_commands.
% 1.28/1.65
% 1.28/1.65 Usable:
% 1.28/1.65 end_of_list.
% 1.28/1.65
% 1.28/1.65 Sos:
% 1.28/1.65 0 (wt=-1) [] divide(A,divide(divide(divide(divide(B,B),B),C),divide(divide(divide(B,B),A),C))) = B.
% 1.28/1.65 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 1.28/1.65 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 1.28/1.65 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 1.28/1.65 end_of_list.
% 1.28/1.65
% 1.28/1.65 Demodulators:
% 1.28/1.65 end_of_list.
% 1.28/1.65
% 1.28/1.65 Passive:
% 1.28/1.65 end_of_list.
% 1.28/1.65
% 1.28/1.65 Starting to process input.
% 1.28/1.65
% 1.28/1.65 ** KEPT: 1 (wt=19) [] divide(A,divide(divide(divide(divide(B,B),B),C),divide(divide(divide(B,B),A),C))) = B.
% 1.28/1.65 1 is a new demodulator.
% 1.28/1.65
% 1.28/1.65 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 1.28/1.65
% 1.28/1.65 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 1.28/1.65 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 1.28/1.65
% 1.28/1.65 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 1.28/1.65
% 1.28/1.65 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 1.28/1.65 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 1.28/1.65
% 1.28/1.65 ** KEPT: 6 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 1.28/1.65 ---------------- PROOF FOUND ----------------
% 1.28/1.65 % SZS status Unsatisfiable
% 1.28/1.65
% 1.28/1.65
% 1.28/1.65 After processing input:
% 1.28/1.65
% 1.28/1.65 Usable:
% 1.28/1.65 end_of_list.
% 1.28/1.65
% 1.28/1.65 Sos:
% 1.28/1.65 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 1.28/1.65 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 1.28/1.65 6 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 1.28/1.65 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 1.28/1.65 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 1.28/1.65 1 (wt=19) [] divide(A,divide(divide(divide(divide(B,B),B),C),divide(divide(divide(B,B),A),C))) = B.
% 1.28/1.65 end_of_list.
% 1.28/1.65
% 1.28/1.65 Demodulators:
% 1.28/1.65 1 (wt=19) [] divide(A,divide(divide(divide(divide(B,B),B),C),divide(divide(divide(B,B),A),C))) = B.
% 1.28/1.65 end_of_list.
% 1.28/1.65
% 1.28/1.65 Passive:
% 1.28/1.65 end_of_list.
% 1.28/1.65
% 1.28/1.65 UNIT CONFLICT from 4903 and 151 at 0.35 seconds.
% 1.28/1.65
% 1.28/1.65 ---------------- PROOF ----------------
% 1.28/1.65 % SZS output start Refutation
% See solution above
% 1.28/1.65 ------------ end of proof -------------
% 1.28/1.65
% 1.28/1.65
% 1.28/1.65 ------------- memory usage ------------
% 1.28/1.65 Memory dynamically allocated (tp_alloc): 6347.
% 1.28/1.65 type (bytes each) gets frees in use avail bytes
% 1.28/1.65 sym_ent ( 96) 56 0 56 0 5.2 K
% 1.28/1.65 term ( 16) 275009 188175 86834 23 1677.3 K
% 1.28/1.65 gen_ptr ( 8) 441820 79150 362670 46 2833.7 K
% 1.28/1.65 context ( 808) 234573 234571 2 2 3.2 K
% 1.28/1.65 trail ( 12) 17880 17880 0 7 0.1 K
% 1.28/1.65 bt_node ( 68) 67802 67796 6 13 1.3 K
% 1.28/1.65 ac_position (285432) 0 0 0 0 0.0 K
% 1.28/1.65 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.28/1.65 ac_match_free_vars_pos (4020)
% 1.28/1.65 0 0 0 0 0.0 K
% 1.28/1.65 discrim ( 12) 44863 21524 23339 14832 447.3 K
% 1.28/1.65 flat ( 40) 720977 720977 0 47 1.8 K
% 1.28/1.65 discrim_pos ( 12) 10023 10023 0 1 0.0 K
% 1.28/1.65 fpa_head ( 12) 9133 0 9133 0 107.0 K
% 1.28/1.65 fpa_tree ( 28) 28472 28472 0 29 0.8 K
% 1.28/1.65 fpa_pos ( 36) 5794 5794 0 1 0.0 K
% 1.28/1.65 literal ( 12) 22005 17102 4903 1 57.5 K
% 1.28/1.65 clause ( 24) 22005 17102 4903 1 114.9 K
% 1.28/1.65 list ( 12) 950 894 56 4 0.7 K
% 1.28/1.65 list_pos ( 20) 20468 9802 10666 3966 285.8 K
% 1.28/1.65 pair_index ( 40) 2 0 2 0 0.1 K
% 1.28/1.65
% 1.28/1.65 -------------- statistics -------------
% 1.28/1.65 Clauses input 4
% 1.28/1.65 Usable input 0
% 1.28/1.65 Sos input 4
% 1.28/1.65 Demodulators input 0
% 1.28/1.65 Passive input 0
% 1.28/1.65
% 1.28/1.65 Processed BS (before search) 8
% 1.28/1.65 Forward subsumed BS 2
% 1.28/1.65 Kept BS 6
% 1.28/1.65 New demodulators BS 1
% 1.28/1.65 Back demodulated BS 0
% 1.28/1.65
% 1.28/1.65 Clauses or pairs given 23723
% 1.28/1.65 Clauses generated 11676
% 1.28/1.65 Forward subsumed 6779
% 1.28/1.65 Deleted by weight 0
% 1.28/1.65 Deleted by variable count 0
% 1.28/1.65 Kept 4897
% 1.28/1.65 New demodulators 890
% 1.28/1.65 Back demodulated 2304
% 1.28/1.65 Ordered paramod prunes 0
% 1.28/1.65 Basic paramod prunes 71300
% 1.28/1.65 Prime paramod prunes 38
% 1.28/1.65 Semantic prunes 0
% 1.28/1.65
% 1.28/1.65 Rewrite attmepts 111403
% 1.28/1.65 Rewrites 4020
% 1.28/1.65
% 1.28/1.65 FPA overloads 0
% 1.28/1.65 FPA underloads 0
% 1.28/1.65
% 1.28/1.65 Usable size 0
% 1.28/1.65 Sos size 2598
% 1.28/1.65 Demodulators size 568
% 1.28/1.65 Passive size 0
% 1.28/1.65 Disabled size 2304
% 1.28/1.65
% 1.28/1.65 Proofs found 1
% 1.28/1.65
% 1.28/1.65 ----------- times (seconds) ----------- Mon Jun 13 08:03:04 2022
% 1.28/1.65
% 1.28/1.65 user CPU time 0.35 (0 hr, 0 min, 0 sec)
% 1.28/1.65 system CPU time 0.20 (0 hr, 0 min, 0 sec)
% 1.28/1.65 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 1.28/1.65 input time 0.00
% 1.28/1.65 paramodulation time 0.05
% 1.28/1.65 demodulation time 0.02
% 1.28/1.65 orient time 0.02
% 1.28/1.65 weigh time 0.00
% 1.28/1.65 forward subsume time 0.02
% 1.28/1.65 back demod find time 0.01
% 1.28/1.65 conflict time 0.02
% 1.28/1.65 LRPO time 0.01
% 1.28/1.65 store clause time 0.09
% 1.28/1.65 disable clause time 0.05
% 1.28/1.65 prime paramod time 0.01
% 1.28/1.65 semantics time 0.00
% 1.28/1.65
% 1.28/1.65 EQP interrupted
%------------------------------------------------------------------------------