%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP532-1 : TPTP v8.1.0. Bugfixed v2.7.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:51 EDT 2022
% Result : Unsatisfiable 0.70s 1.11s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 2 RR)
% Number of literals : 25 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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(divide(A,divide(B,C)),divide(A,B)),C),
file('GRP532-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP532-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('GRP532-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(b,a),multiply(a,b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,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(9,plain,
equal(divide(A,divide(divide(B,divide(C,A)),B)),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(23,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(26,plain,
equal(multiply(A,divide(divide(B,C),B)),divide(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,3]),1]),
[iquote('para(1,3),flip(1)')] ).
cnf(46,plain,
equal(divide(divide(A,inverse(B)),divide(A,divide(C,C))),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(49,plain,
equal(inverse(divide(divide(A,B),A)),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(50,plain,
equal(divide(divide(A,A),divide(divide(B,C),B)),C),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[49,4]),1]),
[iquote('para(49,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(77,plain,
equal(divide(divide(A,B),divide(divide(C,D),C)),divide(A,divide(B,D))),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(78,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[50]),77]),
[iquote('back_demod(50),demod([77])')] ).
cnf(109,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)],[9,3]),26]),1]),
[iquote('para(9,3),demod([26]),flip(1)')] ).
cnf(111,plain,
equal(divide(divide(A,inverse(B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),109]),
[iquote('back_demod(46),demod([109])')] ).
cnf(112,plain,
equal(divide(multiply(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[23]),109]),
[iquote('back_demod(23),demod([109])')] ).
cnf(141,plain,
equal(multiply(multiply(inverse(A),B),A),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[112,53]),1]),
[iquote('para(112,53),flip(1)')] ).
cnf(147,plain,
equal(divide(A,multiply(inverse(B),A)),B),
inference(para,[status(thm),theory(equality)],[112,111]),
[iquote('para(112,111)')] ).
cnf(196,plain,
equal(multiply(inverse(A),B),divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[147,78]),1]),
[iquote('para(147,78),flip(1)')] ).
cnf(197,plain,
equal(multiply(divide(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[141]),196]),
[iquote('back_demod(141),demod([196])')] ).
cnf(199,plain,
equal(multiply(A,B),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[112,197]),
[iquote('para(112,197)')] ).
cnf(200,plain,
$false,
inference(conflict,[status(thm)],[199,6]),
[iquote('conflict(199,6)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP532-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 23:52:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.70/1.11 ----- EQP 0.9e, May 2009 -----
% 0.70/1.11 The job began on n022.cluster.edu, Mon Jun 13 23:52:04 2022
% 0.70/1.11 The command was "./eqp09e".
% 0.70/1.11
% 0.70/1.11 set(prolog_style_variables).
% 0.70/1.11 set(lrpo).
% 0.70/1.11 set(basic_paramod).
% 0.70/1.11 set(functional_subsume).
% 0.70/1.11 set(ordered_paramod).
% 0.70/1.11 set(prime_paramod).
% 0.70/1.11 set(para_pairs).
% 0.70/1.11 assign(pick_given_ratio,4).
% 0.70/1.11 clear(print_kept).
% 0.70/1.11 clear(print_new_demod).
% 0.70/1.11 clear(print_back_demod).
% 0.70/1.11 clear(print_given).
% 0.70/1.11 assign(max_mem,64000).
% 0.70/1.11 end_of_commands.
% 0.70/1.11
% 0.70/1.11 Usable:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Sos:
% 0.70/1.11 0 (wt=-1) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.70/1.11 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.70/1.11 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.70/1.11 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Demodulators:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Passive:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Starting to process input.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 1 (wt=11) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.70/1.11 1 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.70/1.11
% 0.70/1.11 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.70/1.11 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.70/1.11
% 0.70/1.11 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.70/1.11
% 0.70/1.11 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.70/1.11 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.70/1.11
% 0.70/1.11 ** KEPT: 6 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.70/1.11 ---------------- PROOF FOUND ----------------
% 0.70/1.11 % SZS status Unsatisfiable
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 After processing input:
% 0.70/1.11
% 0.70/1.11 Usable:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Sos:
% 0.70/1.11 6 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.70/1.11 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.70/1.11 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.70/1.11 1 (wt=11) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.70/1.11 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.70/1.11 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Demodulators:
% 0.70/1.11 1 (wt=11) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Passive:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 UNIT CONFLICT from 199 and 6 at 0.01 seconds.
% 0.70/1.11
% 0.70/1.11 ---------------- PROOF ----------------
% 0.70/1.11 % SZS output start Refutation
% See solution above
% 0.70/1.11 ------------ end of proof -------------
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 ------------- memory usage ------------
% 0.70/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.11 type (bytes each) gets frees in use avail bytes
% 0.70/1.11 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.70/1.11 term ( 16) 8586 5896 2690 17 52.1 K
% 0.70/1.11 gen_ptr ( 8) 11885 2169 9716 24 76.1 K
% 0.70/1.11 context ( 808) 5637 5635 2 2 3.2 K
% 0.70/1.11 trail ( 12) 1266 1266 0 6 0.1 K
% 0.70/1.11 bt_node ( 68) 1745 1742 3 8 0.7 K
% 0.70/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.11 ac_match_free_vars_pos (4020)
% 0.70/1.11 0 0 0 0 0.0 K
% 0.70/1.11 discrim ( 12) 2074 603 1471 66 18.0 K
% 0.70/1.11 flat ( 40) 16042 16042 0 23 0.9 K
% 0.70/1.11 discrim_pos ( 12) 308 308 0 1 0.0 K
% 0.70/1.11 fpa_head ( 12) 842 0 842 0 9.9 K
% 0.70/1.11 fpa_tree ( 28) 337 337 0 15 0.4 K
% 0.70/1.11 fpa_pos ( 36) 294 294 0 1 0.0 K
% 0.70/1.11 literal ( 12) 758 559 199 1 2.3 K
% 0.70/1.11 clause ( 24) 758 559 199 1 4.7 K
% 0.70/1.11 list ( 12) 154 98 56 3 0.7 K
% 0.70/1.11 list_pos ( 20) 843 326 517 28 10.6 K
% 0.70/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.11
% 0.70/1.11 -------------- statistics -------------
% 0.70/1.11 Clauses input 4
% 0.70/1.11 Usable input 0
% 0.70/1.11 Sos input 4
% 0.70/1.11 Demodulators input 0
% 0.70/1.11 Passive input 0
% 0.70/1.11
% 0.70/1.11 Processed BS (before search) 8
% 0.70/1.11 Forward subsumed BS 2
% 0.70/1.11 Kept BS 6
% 0.70/1.11 New demodulators BS 1
% 0.70/1.11 Back demodulated BS 0
% 0.70/1.11
% 0.70/1.11 Clauses or pairs given 362
% 0.70/1.11 Clauses generated 403
% 0.70/1.11 Forward subsumed 210
% 0.70/1.11 Deleted by weight 0
% 0.70/1.11 Deleted by variable count 0
% 0.70/1.11 Kept 193
% 0.70/1.11 New demodulators 94
% 0.70/1.11 Back demodulated 73
% 0.70/1.11 Ordered paramod prunes 0
% 0.70/1.11 Basic paramod prunes 463
% 0.70/1.11 Prime paramod prunes 15
% 0.70/1.11 Semantic prunes 0
% 0.70/1.11
% 0.70/1.11 Rewrite attmepts 2649
% 0.70/1.11 Rewrites 156
% 0.70/1.11
% 0.70/1.11 FPA overloads 0
% 0.70/1.11 FPA underloads 0
% 0.70/1.11
% 0.70/1.11 Usable size 0
% 0.70/1.11 Sos size 125
% 0.70/1.11 Demodulators size 69
% 0.70/1.11 Passive size 0
% 0.70/1.11 Disabled size 73
% 0.70/1.11
% 0.70/1.11 Proofs found 1
% 0.70/1.11
% 0.70/1.11 ----------- times (seconds) ----------- Mon Jun 13 23:52:04 2022
% 0.70/1.11
% 0.70/1.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.11 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.11 input time 0.00
% 0.70/1.11 paramodulation time 0.00
% 0.70/1.11 demodulation time 0.00
% 0.70/1.11 orient time 0.00
% 0.70/1.11 weigh time 0.00
% 0.70/1.11 forward subsume time 0.00
% 0.70/1.11 back demod find time 0.00
% 0.70/1.11 conflict time 0.00
% 0.70/1.11 LRPO time 0.00
% 0.70/1.11 store clause time 0.00
% 0.70/1.11 disable clause time 0.00
% 0.70/1.11 prime paramod time 0.00
% 0.70/1.11 semantics time 0.00
% 0.70/1.11
% 0.70/1.11 EQP interrupted
%------------------------------------------------------------------------------