%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP448-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n005.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 0.78s 1.60s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 4 RR)
% Number of literals : 26 ( 0 equ; 3 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 : 59 ( 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('GRP448-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP448-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('GRP448-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(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(divide(divide(A,A),B),divide(divide(C,C),B)),
inference(para,[status(thm),theory(equality)],[4,4]),
[iquote('para(4,4)')] ).
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(multiply(divide(divide(A,A),b1),b1),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[4,6]),
[iquote('para(4,6)')] ).
cnf(53,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(64,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(90,plain,
equal(divide(A,divide(divide(divide(B,B),divide(C,C)),D)),multiply(A,D)),
inference(para,[status(thm),theory(equality)],[7,3]),
[iquote('para(7,3)')] ).
cnf(91,plain,
equal(multiply(A,B),divide(A,divide(divide(divide(C,C),divide(D,D)),B))),
inference(flip,[status(thm),theory(equality)],[90]),
[iquote('flip(90)')] ).
cnf(2945,plain,
equal(divide(A,divide(divide(inverse(B),C),divide(inverse(A),C))),B),
inference(para,[status(thm),theory(equality)],[5,64]),
[iquote('para(5,64)')] ).
cnf(2946,plain,
equal(divide(divide(A,A),divide(divide(inverse(A),B),inverse(B))),A),
inference(para,[status(thm),theory(equality)],[5,64]),
[iquote('para(5,64)')] ).
cnf(3081,plain,
equal(divide(divide(A,A),inverse(inverse(inverse(A)))),A),
inference(para,[status(thm),theory(equality)],[5,2946]),
[iquote('para(5,2946)')] ).
cnf(3085,plain,
equal(inverse(inverse(inverse(inverse(A)))),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3081,5]),1]),
[iquote('para(3081,5),flip(1)')] ).
cnf(3642,plain,
~ equal(divide(divide(divide(A,A),b1),divide(divide(divide(B,B),divide(C,C)),b1)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[91,10]),
[iquote('para(91,10)')] ).
cnf(3995,plain,
equal(divide(A,divide(inverse(B),divide(inverse(A),B))),divide(C,C)),
inference(para,[status(thm),theory(equality)],[8,2945]),
[iquote('para(8,2945)')] ).
cnf(4392,plain,
equal(divide(divide(A,A),divide(inverse(B),inverse(B))),divide(C,C)),
inference(para,[status(thm),theory(equality)],[8,3995]),
[iquote('para(8,3995)')] ).
cnf(4396,plain,
equal(divide(divide(A,A),divide(B,B)),divide(C,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3085,4392]),3085]),
[iquote('para(3085,4392),demod([3085])')] ).
cnf(4398,plain,
equal(divide(A,A),inverse(divide(B,B))),
inference(para,[status(thm),theory(equality)],[4396,5]),
[iquote('para(4396,5)')] ).
cnf(4399,plain,
equal(inverse(divide(A,A)),divide(B,B)),
inference(flip,[status(thm),theory(equality)],[4398]),
[iquote('flip(4398)')] ).
cnf(4407,plain,
equal(divide(A,A),divide(B,B)),
inference(para,[status(thm),theory(equality)],[4399,4399]),
[iquote('para(4399,4399)')] ).
cnf(4408,plain,
equal(divide(A,A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[4407,53]),
[iquote('para(4407,53)')] ).
cnf(4409,plain,
$false,
inference(conflict,[status(thm)],[4408,3642]),
[iquote('conflict(4408,3642)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GRP448-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.15 % Command : tptp2X_and_run_eqp %s
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.37 % WCLimit : 600
% 0.15/0.37 % DateTime : Mon Jun 13 10:27:09 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.78/1.60 ----- EQP 0.9e, May 2009 -----
% 0.78/1.60 The job began on n005.cluster.edu, Mon Jun 13 10:27:10 2022
% 0.78/1.60 The command was "./eqp09e".
% 0.78/1.60
% 0.78/1.60 set(prolog_style_variables).
% 0.78/1.60 set(lrpo).
% 0.78/1.60 set(basic_paramod).
% 0.78/1.60 set(functional_subsume).
% 0.78/1.60 set(ordered_paramod).
% 0.78/1.60 set(prime_paramod).
% 0.78/1.60 set(para_pairs).
% 0.78/1.60 assign(pick_given_ratio,4).
% 0.78/1.60 clear(print_kept).
% 0.78/1.60 clear(print_new_demod).
% 0.78/1.60 clear(print_back_demod).
% 0.78/1.60 clear(print_given).
% 0.78/1.60 assign(max_mem,64000).
% 0.78/1.60 end_of_commands.
% 0.78/1.60
% 0.78/1.60 Usable:
% 0.78/1.60 end_of_list.
% 0.78/1.60
% 0.78/1.60 Sos:
% 0.78/1.60 0 (wt=-1) [] divide(A,divide(divide(divide(divide(B,B),B),C),divide(divide(divide(B,B),A),C))) = B.
% 0.78/1.60 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.78/1.60 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.78/1.60 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.78/1.60 end_of_list.
% 0.78/1.60
% 0.78/1.60 Demodulators:
% 0.78/1.60 end_of_list.
% 0.78/1.60
% 0.78/1.60 Passive:
% 0.78/1.60 end_of_list.
% 0.78/1.60
% 0.78/1.60 Starting to process input.
% 0.78/1.60
% 0.78/1.60 ** KEPT: 1 (wt=19) [] divide(A,divide(divide(divide(divide(B,B),B),C),divide(divide(divide(B,B),A),C))) = B.
% 0.78/1.60 1 is a new demodulator.
% 0.78/1.60
% 0.78/1.60 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.78/1.60
% 0.78/1.60 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.78/1.60 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.78/1.60
% 0.78/1.60 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.78/1.60
% 0.78/1.60 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.78/1.60 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.78/1.60
% 0.78/1.60 ** KEPT: 6 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.78/1.60 ---------------- PROOF FOUND ----------------
% 0.78/1.60 % SZS status Unsatisfiable
% 0.78/1.60
% 0.78/1.60
% 0.78/1.60 After processing input:
% 0.78/1.60
% 0.78/1.60 Usable:
% 0.78/1.60 end_of_list.
% 0.78/1.60
% 0.78/1.60 Sos:
% 0.78/1.60 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.78/1.60 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.78/1.60 6 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.78/1.60 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.78/1.60 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.78/1.60 1 (wt=19) [] divide(A,divide(divide(divide(divide(B,B),B),C),divide(divide(divide(B,B),A),C))) = B.
% 0.78/1.60 end_of_list.
% 0.78/1.60
% 0.78/1.60 Demodulators:
% 0.78/1.60 1 (wt=19) [] divide(A,divide(divide(divide(divide(B,B),B),C),divide(divide(divide(B,B),A),C))) = B.
% 0.78/1.60 end_of_list.
% 0.78/1.60
% 0.78/1.60 Passive:
% 0.78/1.60 end_of_list.
% 0.78/1.60
% 0.78/1.60 UNIT CONFLICT from 4408 and 3642 at 0.31 seconds.
% 0.78/1.60
% 0.78/1.60 ---------------- PROOF ----------------
% 0.78/1.60 % SZS output start Refutation
% See solution above
% 0.78/1.60 ------------ end of proof -------------
% 0.78/1.60
% 0.78/1.60
% 0.78/1.60 ------------- memory usage ------------
% 0.78/1.60 Memory dynamically allocated (tp_alloc): 5371.
% 0.78/1.60 type (bytes each) gets frees in use avail bytes
% 0.78/1.60 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.78/1.60 term ( 16) 188458 110737 77721 23 1501.2 K
% 0.78/1.60 gen_ptr ( 8) 345572 17839 327733 25 2560.6 K
% 0.78/1.60 context ( 808) 158299 158297 2 2 3.2 K
% 0.78/1.60 trail ( 12) 7825 7825 0 7 0.1 K
% 0.78/1.60 bt_node ( 68) 40791 40788 3 16 1.3 K
% 0.78/1.60 ac_position (285432) 0 0 0 0 0.0 K
% 0.78/1.60 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.78/1.60 ac_match_free_vars_pos (4020)
% 0.78/1.60 0 0 0 0 0.0 K
% 0.78/1.60 discrim ( 12) 41537 2141 39396 0 461.7 K
% 0.78/1.60 flat ( 40) 509087 509087 0 47 1.8 K
% 0.78/1.60 discrim_pos ( 12) 3938 3938 0 1 0.0 K
% 0.78/1.60 fpa_head ( 12) 9849 0 9849 0 115.4 K
% 0.78/1.60 fpa_tree ( 28) 12682 12682 0 31 0.8 K
% 0.78/1.60 fpa_pos ( 36) 5387 5387 0 1 0.0 K
% 0.78/1.60 literal ( 12) 16154 11746 4408 1 51.7 K
% 0.78/1.60 clause ( 24) 16154 11746 4408 1 103.3 K
% 0.78/1.60 list ( 12) 1038 982 56 3 0.7 K
% 0.78/1.60 list_pos ( 20) 14774 1202 13572 0 265.1 K
% 0.78/1.60 pair_index ( 40) 2 0 2 0 0.1 K
% 0.78/1.60
% 0.78/1.60 -------------- statistics -------------
% 0.78/1.60 Clauses input 4
% 0.78/1.60 Usable input 0
% 0.78/1.60 Sos input 4
% 0.78/1.60 Demodulators input 0
% 0.78/1.60 Passive input 0
% 0.78/1.60
% 0.78/1.60 Processed BS (before search) 8
% 0.78/1.60 Forward subsumed BS 2
% 0.78/1.60 Kept BS 6
% 0.78/1.60 New demodulators BS 1
% 0.78/1.60 Back demodulated BS 0
% 0.78/1.60
% 0.78/1.60 Clauses or pairs given 11239
% 0.78/1.60 Clauses generated 8090
% 0.78/1.60 Forward subsumed 3688
% 0.78/1.60 Deleted by weight 0
% 0.78/1.60 Deleted by variable count 0
% 0.78/1.60 Kept 4402
% 0.78/1.60 New demodulators 978
% 0.78/1.60 Back demodulated 285
% 0.78/1.60 Ordered paramod prunes 0
% 0.78/1.60 Basic paramod prunes 39628
% 0.78/1.60 Prime paramod prunes 25
% 0.78/1.60 Semantic prunes 0
% 0.78/1.60
% 0.78/1.60 Rewrite attmepts 76736
% 0.78/1.60 Rewrites 824
% 0.78/1.60
% 0.78/1.60 FPA overloads 0
% 0.78/1.60 FPA underloads 0
% 0.78/1.60
% 0.78/1.60 Usable size 0
% 0.78/1.60 Sos size 4122
% 0.78/1.60 Demodulators size 921
% 0.78/1.60 Passive size 0
% 0.78/1.60 Disabled size 285
% 0.78/1.60
% 0.78/1.60 Proofs found 1
% 0.78/1.60
% 0.78/1.60 ----------- times (seconds) ----------- Mon Jun 13 10:27:10 2022
% 0.78/1.60
% 0.78/1.60 user CPU time 0.31 (0 hr, 0 min, 0 sec)
% 0.78/1.60 system CPU time 0.14 (0 hr, 0 min, 0 sec)
% 0.78/1.60 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.78/1.60 input time 0.00
% 0.78/1.60 paramodulation time 0.04
% 0.78/1.60 demodulation time 0.03
% 0.78/1.60 orient time 0.03
% 0.78/1.60 weigh time 0.01
% 0.78/1.60 forward subsume time 0.01
% 0.78/1.60 back demod find time 0.01
% 0.78/1.60 conflict time 0.02
% 0.78/1.60 LRPO time 0.01
% 0.78/1.60 store clause time 0.12
% 0.78/1.60 disable clause time 0.00
% 0.78/1.60 prime paramod time 0.01
% 0.78/1.60 semantics time 0.00
% 0.78/1.60
% 0.78/1.60 EQP interrupted
%------------------------------------------------------------------------------