%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP556-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n026.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:57 EDT 2022
% Result : Unsatisfiable 0.75s 1.18s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 4 RR)
% Number of literals : 52 ( 0 equ; 3 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 155 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,inverse(divide(B,divide(A,C)))),C),B),
file('GRP556-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP556-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(b,a),multiply(a,b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
~ equal(divide(b,inverse(a)),multiply(a,b)),
inference(para,[status(thm),theory(equality)],[2,4]),
[iquote('para(2,4)')] ).
cnf(6,plain,
equal(divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(D,B))),C),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(divide(A,inverse(divide(B,divide(A,divide(C,D))))),divide(divide(C,inverse(B)),D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(9,plain,
equal(divide(multiply(A,divide(B,divide(A,C))),C),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(12,plain,
equal(divide(divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(D,B))),inverse(divide(E,D))),C),E),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(13,plain,
equal(divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(D)),C),divide(E,inverse(divide(D,divide(E,B))))),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(15,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(16,plain,
equal(multiply(A,divide(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,3]),1]),
[iquote('para(15,3),flip(1)')] ).
cnf(20,plain,
equal(divide(divide(A,inverse(divide(B,C))),inverse(divide(C,A))),B),
inference(para,[status(thm),theory(equality)],[15,1]),
[iquote('para(15,1)')] ).
cnf(24,plain,
equal(divide(divide(divide(A,inverse(B)),C),divide(A,C)),B),
inference(para,[status(thm),theory(equality)],[7,1]),
[iquote('para(7,1)')] ).
cnf(25,plain,
equal(divide(divide(multiply(A,B),C),divide(A,C)),B),
inference(para,[status(thm),theory(equality)],[3,24]),
[iquote('para(3,24)')] ).
cnf(27,plain,
equal(divide(divide(A,B),divide(C,B)),divide(A,C)),
inference(para,[status(thm),theory(equality)],[16,25]),
[iquote('para(16,25)')] ).
cnf(28,plain,
equal(divide(multiply(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[25]),27]),
[iquote('back_demod(25),demod([27])')] ).
cnf(29,plain,
equal(divide(divide(A,inverse(B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[24]),27]),
[iquote('back_demod(24),demod([27])')] ).
cnf(46,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[28,9]),
[iquote('para(28,9)')] ).
cnf(49,plain,
equal(multiply(divide(A,A),B),B),
inference(para,[status(thm),theory(equality)],[46,28]),
[iquote('para(46,28)')] ).
cnf(62,plain,
equal(divide(divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(D,B))),inverse(E)),C),divide(F,inverse(divide(E,divide(F,D))))),
inference(para,[status(thm),theory(equality)],[1,12]),
[iquote('para(1,12)')] ).
cnf(63,plain,
equal(divide(A,inverse(divide(B,divide(A,C)))),divide(divide(divide(divide(D,inverse(divide(E,divide(D,F)))),inverse(divide(C,E))),inverse(B)),F)),
inference(flip,[status(thm),theory(equality)],[62]),
[iquote('flip(62)')] ).
cnf(66,plain,
equal(divide(divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(inverse(D),B))),inverse(multiply(E,D))),C),E),
inference(para,[status(thm),theory(equality)],[3,12]),
[iquote('para(3,12)')] ).
cnf(67,plain,
equal(divide(multiply(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(D,B))),divide(E,D)),C),E),
inference(para,[status(thm),theory(equality)],[3,12]),
[iquote('para(3,12)')] ).
cnf(79,plain,
equal(divide(divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(D,B))),inverse(E)),C),divide(divide(F,inverse(divide(G,divide(F,D)))),inverse(divide(E,G)))),
inference(para,[status(thm),theory(equality)],[6,12]),
[iquote('para(6,12)')] ).
cnf(80,plain,
equal(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(D,B))),divide(divide(divide(divide(E,inverse(divide(F,divide(E,G)))),inverse(divide(C,F))),inverse(D)),G)),
inference(flip,[status(thm),theory(equality)],[79]),
[iquote('flip(79)')] ).
cnf(96,plain,
equal(divide(A,inverse(divide(B,divide(A,C)))),divide(C,inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,13]),1]),
[iquote('para(1,13),flip(1)')] ).
cnf(105,plain,
equal(divide(divide(A,inverse(B)),inverse(divide(C,B))),divide(divide(divide(divide(D,inverse(E)),inverse(divide(A,E))),inverse(C)),D)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[80]),96,96]),
[iquote('back_demod(80),demod([96,96])')] ).
cnf(106,plain,
equal(divide(divide(divide(divide(A,inverse(B)),inverse(divide(C,B))),inverse(D)),A),divide(divide(C,inverse(E)),inverse(divide(D,E)))),
inference(flip,[status(thm),theory(equality)],[105]),
[iquote('flip(105)')] ).
cnf(109,plain,
equal(divide(multiply(divide(divide(A,inverse(B)),inverse(divide(C,B))),divide(D,C)),A),D),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[67]),96]),
[iquote('back_demod(67),demod([96])')] ).
cnf(110,plain,
equal(divide(divide(divide(divide(A,inverse(B)),inverse(divide(inverse(C),B))),inverse(multiply(D,C))),A),D),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),96]),
[iquote('back_demod(66),demod([96])')] ).
cnf(112,plain,
equal(divide(divide(divide(divide(A,inverse(B)),inverse(divide(C,B))),inverse(D)),A),divide(C,inverse(D))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[63]),96,96]),1]),
[iquote('back_demod(63),demod([96,96]),flip(1)')] ).
cnf(113,plain,
equal(divide(inverse(A),inverse(multiply(B,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[110]),112]),
[iquote('back_demod(110),demod([112])')] ).
cnf(114,plain,
equal(divide(divide(A,inverse(B)),inverse(divide(C,B))),divide(A,inverse(C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[106]),112]),1]),
[iquote('back_demod(106),demod([112]),flip(1)')] ).
cnf(116,plain,
equal(divide(multiply(divide(A,inverse(B)),divide(C,B)),A),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[109]),114]),
[iquote('back_demod(109),demod([114])')] ).
cnf(134,plain,
equal(divide(A,inverse(divide(B,B))),A),
inference(para,[status(thm),theory(equality)],[15,20]),
[iquote('para(15,20)')] ).
cnf(139,plain,
equal(multiply(A,divide(B,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[134,3]),1]),
[iquote('para(134,3),flip(1)')] ).
cnf(140,plain,
equal(divide(A,A),divide(B,B)),
inference(para,[status(thm),theory(equality)],[139,28]),
[iquote('para(139,28)')] ).
cnf(222,plain,
equal(multiply(inverse(A),multiply(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[113,3]),1]),
[iquote('para(113,3),flip(1)')] ).
cnf(231,plain,
equal(divide(inverse(multiply(A,B)),inverse(A)),inverse(B)),
inference(para,[status(thm),theory(equality)],[222,113]),
[iquote('para(222,113)')] ).
cnf(374,plain,
equal(multiply(inverse(multiply(A,B)),A),inverse(B)),
inference(para,[status(thm),theory(equality)],[3,231]),
[iquote('para(3,231)')] ).
cnf(381,plain,
equal(divide(inverse(A),inverse(inverse(B))),inverse(multiply(A,B))),
inference(para,[status(thm),theory(equality)],[374,113]),
[iquote('para(374,113)')] ).
cnf(400,plain,
equal(divide(divide(A,A),divide(B,C)),divide(C,B)),
inference(para,[status(thm),theory(equality)],[140,27]),
[iquote('para(140,27)')] ).
cnf(401,plain,
equal(divide(A,B),divide(divide(C,C),divide(B,A))),
inference(flip,[status(thm),theory(equality)],[400]),
[iquote('flip(400)')] ).
cnf(461,plain,
equal(inverse(multiply(A,B)),multiply(inverse(A),inverse(B))),
inference(para,[status(thm),theory(equality)],[381,3]),
[iquote('para(381,3)')] ).
cnf(490,plain,
equal(divide(divide(A,multiply(inverse(B),inverse(C))),A),multiply(B,C)),
inference(para,[status(thm),theory(equality)],[461,29]),
[iquote('para(461,29)')] ).
cnf(496,plain,
~ equal(divide(divide(A,A),divide(inverse(a),b)),multiply(a,b)),
inference(para,[status(thm),theory(equality)],[401,5]),
[iquote('para(401,5)')] ).
cnf(515,plain,
equal(divide(divide(A,B),inverse(B)),A),
inference(para,[status(thm),theory(equality)],[49,116]),
[iquote('para(49,116)')] ).
cnf(567,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[515,29]),
[iquote('para(515,29)')] ).
cnf(622,plain,
equal(multiply(A,inverse(B)),divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[567,3]),1]),
[iquote('para(567,3),flip(1)')] ).
cnf(624,plain,
equal(divide(divide(A,divide(inverse(B),C)),A),multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[490]),622]),
[iquote('back_demod(490),demod([622])')] ).
cnf(625,plain,
$false,
inference(conflict,[status(thm)],[624,496]),
[iquote('conflict(624,496)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP556-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 12:25:06 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.75/1.18 ----- EQP 0.9e, May 2009 -----
% 0.75/1.18 The job began on n026.cluster.edu, Tue Jun 14 12:25:07 2022
% 0.75/1.18 The command was "./eqp09e".
% 0.75/1.18
% 0.75/1.18 set(prolog_style_variables).
% 0.75/1.18 set(lrpo).
% 0.75/1.18 set(basic_paramod).
% 0.75/1.18 set(functional_subsume).
% 0.75/1.18 set(ordered_paramod).
% 0.75/1.18 set(prime_paramod).
% 0.75/1.18 set(para_pairs).
% 0.75/1.18 assign(pick_given_ratio,4).
% 0.75/1.18 clear(print_kept).
% 0.75/1.18 clear(print_new_demod).
% 0.75/1.18 clear(print_back_demod).
% 0.75/1.18 clear(print_given).
% 0.75/1.18 assign(max_mem,64000).
% 0.75/1.18 end_of_commands.
% 0.75/1.18
% 0.75/1.18 Usable:
% 0.75/1.18 end_of_list.
% 0.75/1.18
% 0.75/1.18 Sos:
% 0.75/1.18 0 (wt=-1) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.75/1.18 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.75/1.18 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.75/1.18 end_of_list.
% 0.75/1.18
% 0.75/1.18 Demodulators:
% 0.75/1.18 end_of_list.
% 0.75/1.18
% 0.75/1.18 Passive:
% 0.75/1.18 end_of_list.
% 0.75/1.18
% 0.75/1.18 Starting to process input.
% 0.75/1.18
% 0.75/1.18 ** KEPT: 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.75/1.18 1 is a new demodulator.
% 0.75/1.18
% 0.75/1.18 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.75/1.18
% 0.75/1.18 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.75/1.18 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.75/1.18
% 0.75/1.18 ** KEPT: 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.75/1.18 ---------------- PROOF FOUND ----------------
% 0.75/1.18 % SZS status Unsatisfiable
% 0.75/1.18
% 0.75/1.18
% 0.75/1.18 After processing input:
% 0.75/1.18
% 0.75/1.18 Usable:
% 0.75/1.18 end_of_list.
% 0.75/1.18
% 0.75/1.18 Sos:
% 0.75/1.18 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.75/1.18 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.75/1.18 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.75/1.18 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.75/1.18 end_of_list.
% 0.75/1.18
% 0.75/1.18 Demodulators:
% 0.75/1.18 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.75/1.18 end_of_list.
% 0.75/1.18
% 0.75/1.18 Passive:
% 0.75/1.18 end_of_list.
% 0.75/1.18
% 0.75/1.18 UNIT CONFLICT from 624 and 496 at 0.04 seconds.
% 0.75/1.18
% 0.75/1.18 ---------------- PROOF ----------------
% 0.75/1.18 % SZS output start Refutation
% See solution above
% 0.75/1.18 ------------ end of proof -------------
% 0.75/1.18
% 0.75/1.18
% 0.75/1.18 ------------- memory usage ------------
% 0.75/1.18 Memory dynamically allocated (tp_alloc): 976.
% 0.75/1.18 type (bytes each) gets frees in use avail bytes
% 0.75/1.18 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.75/1.18 term ( 16) 33526 21415 12111 33 234.7 K
% 0.75/1.18 gen_ptr ( 8) 69992 14687 55305 51 432.5 K
% 0.75/1.18 context ( 808) 23460 23458 2 8 7.9 K
% 0.75/1.18 trail ( 12) 4505 4505 0 8 0.1 K
% 0.75/1.18 bt_node ( 68) 5990 5988 2 18 1.3 K
% 0.75/1.18 ac_position (285432) 0 0 0 0 0.0 K
% 0.75/1.18 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.75/1.18 ac_match_free_vars_pos (4020)
% 0.75/1.18 0 0 0 0 0.0 K
% 0.75/1.18 discrim ( 12) 9784 6384 3400 907 50.5 K
% 0.75/1.18 flat ( 40) 76787 76787 0 38 1.5 K
% 0.75/1.18 discrim_pos ( 12) 1410 1410 0 1 0.0 K
% 0.75/1.18 fpa_head ( 12) 4224 0 4224 0 49.5 K
% 0.75/1.18 fpa_tree ( 28) 2222 2222 0 27 0.7 K
% 0.75/1.18 fpa_pos ( 36) 948 948 0 1 0.0 K
% 0.75/1.18 literal ( 12) 2123 1499 624 1 7.3 K
% 0.75/1.18 clause ( 24) 2123 1499 624 1 14.6 K
% 0.75/1.18 list ( 12) 383 326 57 3 0.7 K
% 0.75/1.18 list_pos ( 20) 2913 1614 1299 31 26.0 K
% 0.75/1.18 pair_index ( 40) 2 0 2 0 0.1 K
% 0.75/1.18
% 0.75/1.18 -------------- statistics -------------
% 0.75/1.18 Clauses input 3
% 0.75/1.18 Usable input 0
% 0.75/1.18 Sos input 3
% 0.75/1.18 Demodulators input 0
% 0.75/1.18 Passive input 0
% 0.75/1.18
% 0.75/1.18 Processed BS (before search) 5
% 0.75/1.18 Forward subsumed BS 1
% 0.75/1.18 Kept BS 4
% 0.75/1.18 New demodulators BS 1
% 0.75/1.18 Back demodulated BS 0
% 0.75/1.18
% 0.75/1.18 Clauses or pairs given 1862
% 0.75/1.18 Clauses generated 1180
% 0.75/1.18 Forward subsumed 560
% 0.75/1.18 Deleted by weight 0
% 0.75/1.18 Deleted by variable count 0
% 0.75/1.18 Kept 620
% 0.75/1.18 New demodulators 323
% 0.75/1.18 Back demodulated 347
% 0.75/1.18 Ordered paramod prunes 0
% 0.75/1.18 Basic paramod prunes 6431
% 0.75/1.18 Prime paramod prunes 50
% 0.75/1.18 Semantic prunes 0
% 0.75/1.18
% 0.75/1.18 Rewrite attmepts 13137
% 0.75/1.18 Rewrites 1049
% 0.75/1.18
% 0.75/1.18 FPA overloads 0
% 0.75/1.18 FPA underloads 0
% 0.75/1.18
% 0.75/1.18 Usable size 0
% 0.75/1.18 Sos size 276
% 0.75/1.18 Demodulators size 114
% 0.75/1.18 Passive size 0
% 0.75/1.18 Disabled size 347
% 0.75/1.18
% 0.75/1.18 Proofs found 1
% 0.75/1.18
% 0.75/1.18 ----------- times (seconds) ----------- Tue Jun 14 12:25:07 2022
% 0.75/1.18
% 0.75/1.18 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.75/1.18 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.75/1.18 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.75/1.18 input time 0.00
% 0.75/1.18 paramodulation time 0.01
% 0.75/1.18 demodulation time 0.00
% 0.75/1.18 orient time 0.00
% 0.75/1.18 weigh time 0.00
% 0.75/1.18 forward subsume time 0.00
% 0.75/1.18 back demod find time 0.00
% 0.75/1.18 conflict time 0.00
% 0.75/1.18 LRPO time 0.00
% 0.75/1.18 store clause time 0.01
% 0.75/1.18 disable clause time 0.00
% 0.75/1.18 prime paramod time 0.00
% 0.75/1.18 semantics time 0.00
% 0.75/1.18
% 0.75/1.18 EQP interrupted
%------------------------------------------------------------------------------