%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO069-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n028.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 : Thu Jul 14 23:37:34 EDT 2022
% Result : Unsatisfiable 0.88s 1.25s
% Output : Refutation 0.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 2 RR)
% Number of literals : 21 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,D,E),F,multiply(C,D,G))),multiply(D,multiply(G,F,E),C)),B),
file('BOO069-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(a,b,inverse(b)),a),
file('BOO069-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B,C),inverse(multiply(multiply(D,E,F),G,multiply(D,E,H))),multiply(E,multiply(H,G,F),D)),multiply(B,multiply(C,inverse(multiply(A,B,I)),I),A)),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,D,multiply(E,multiply(F,G,H),I)),inverse(multiply(multiply(I,E,H),G,multiply(I,E,F))),multiply(C,D,multiply(J,inverse(J),K)))),multiply(D,K,C)),B),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(11,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,D,E),multiply(F,inverse(multiply(G,multiply(C,D,E),H)),H),G)),multiply(multiply(C,D,E),multiply(I,inverse(multiply(multiply(I,G,E),D,multiply(I,G,C))),F),G)),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(13,plain,
equal(multiply(inverse(A),multiply(B,inverse(multiply(A,inverse(A),C)),C),A),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(356,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(C,multiply(multiply(D,C,multiply(E,inverse(E),F)),inverse(multiply(D,C,G)),G),D)),multiply(C,F,D)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,11]),1,1,1]),
[iquote('para(7,11),demod([1,1,1])')] ).
cnf(357,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(C,inverse(C),multiply(D,inverse(D),multiply(E,inverse(multiply(C,inverse(C),F)),F)))),E),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,356]),13]),
[iquote('para(13,356),demod([13])')] ).
cnf(364,plain,
equal(multiply(A,inverse(multiply(B,inverse(B),C)),C),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[357,1]),1]),
[iquote('para(357,1),demod([1])')] ).
cnf(365,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(C,inverse(C),multiply(D,inverse(D),E))),E),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[357]),364]),
[iquote('back_demod(357),demod([364])')] ).
cnf(416,plain,
equal(multiply(inverse(A),B,A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[13]),364]),
[iquote('back_demod(13),demod([364])')] ).
cnf(440,plain,
equal(multiply(A,inverse(inverse(inverse(B))),B),A),
inference(para,[status(thm),theory(equality)],[416,364]),
[iquote('para(416,364)')] ).
cnf(441,plain,
equal(inverse(multiply(A,inverse(A),B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[416,364]),
[iquote('para(416,364)')] ).
cnf(460,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(C),C),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[365]),441,441]),
[iquote('back_demod(365),demod([441,441])')] ).
cnf(461,plain,
equal(multiply(A,inverse(B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[364]),441]),
[iquote('back_demod(364),demod([441])')] ).
cnf(462,plain,
equal(multiply(A,inverse(A),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[460]),461]),
[iquote('back_demod(460),demod([461])')] ).
cnf(701,plain,
equal(inverse(inverse(inverse(A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[416,440]),
[iquote('para(416,440)')] ).
cnf(702,plain,
equal(multiply(A,inverse(B),inverse(inverse(B))),A),
inference(para,[status(thm),theory(equality)],[701,461]),
[iquote('para(701,461)')] ).
cnf(704,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[462,702]),
[iquote('para(462,702)')] ).
cnf(706,plain,
equal(multiply(A,B,inverse(B)),A),
inference(para,[status(thm),theory(equality)],[704,461]),
[iquote('para(704,461)')] ).
cnf(707,plain,
$false,
inference(conflict,[status(thm)],[706,2]),
[iquote('conflict(706,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : BOO069-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 1 15:27:22 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.88/1.25 ----- EQP 0.9e, May 2009 -----
% 0.88/1.25 The job began on n028.cluster.edu, Wed Jun 1 15:27:23 2022
% 0.88/1.25 The command was "./eqp09e".
% 0.88/1.25
% 0.88/1.25 set(prolog_style_variables).
% 0.88/1.25 set(lrpo).
% 0.88/1.25 set(basic_paramod).
% 0.88/1.25 set(functional_subsume).
% 0.88/1.25 set(ordered_paramod).
% 0.88/1.25 set(prime_paramod).
% 0.88/1.25 set(para_pairs).
% 0.88/1.25 assign(pick_given_ratio,4).
% 0.88/1.25 clear(print_kept).
% 0.88/1.25 clear(print_new_demod).
% 0.88/1.25 clear(print_back_demod).
% 0.88/1.25 clear(print_given).
% 0.88/1.25 assign(max_mem,64000).
% 0.88/1.25 end_of_commands.
% 0.88/1.25
% 0.88/1.25 Usable:
% 0.88/1.25 end_of_list.
% 0.88/1.25
% 0.88/1.25 Sos:
% 0.88/1.25 0 (wt=-1) [] multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,D,E),F,multiply(C,D,G))),multiply(D,multiply(G,F,E),C)) = B.
% 0.88/1.25 0 (wt=-1) [] -(multiply(a,b,inverse(b)) = a).
% 0.88/1.25 end_of_list.
% 0.88/1.25
% 0.88/1.25 Demodulators:
% 0.88/1.25 end_of_list.
% 0.88/1.25
% 0.88/1.25 Passive:
% 0.88/1.25 end_of_list.
% 0.88/1.25
% 0.88/1.25 Starting to process input.
% 0.88/1.25
% 0.88/1.25 ** KEPT: 1 (wt=26) [] multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,D,E),F,multiply(C,D,G))),multiply(D,multiply(G,F,E),C)) = B.
% 0.88/1.25 1 is a new demodulator.
% 0.88/1.25
% 0.88/1.25 ** KEPT: 2 (wt=7) [] -(multiply(a,b,inverse(b)) = a).
% 0.88/1.25 ---------------- PROOF FOUND ----------------
% 0.88/1.25 % SZS status Unsatisfiable
% 0.88/1.25
% 0.88/1.25
% 0.88/1.25 After processing input:
% 0.88/1.25
% 0.88/1.25 Usable:
% 0.88/1.25 end_of_list.
% 0.88/1.25
% 0.88/1.25 Sos:
% 0.88/1.25 2 (wt=7) [] -(multiply(a,b,inverse(b)) = a).
% 0.88/1.25 1 (wt=26) [] multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,D,E),F,multiply(C,D,G))),multiply(D,multiply(G,F,E),C)) = B.
% 0.88/1.25 end_of_list.
% 0.88/1.25
% 0.88/1.25 Demodulators:
% 0.88/1.25 1 (wt=26) [] multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,D,E),F,multiply(C,D,G))),multiply(D,multiply(G,F,E),C)) = B.
% 0.88/1.25 end_of_list.
% 0.88/1.25
% 0.88/1.25 Passive:
% 0.88/1.25 end_of_list.
% 0.88/1.25
% 0.88/1.25 UNIT CONFLICT from 706 and 2 at 0.13 seconds.
% 0.88/1.25
% 0.88/1.25 ---------------- PROOF ----------------
% 0.88/1.25 % SZS output start Refutation
% See solution above
% 0.88/1.25 ------------ end of proof -------------
% 0.88/1.25
% 0.88/1.25
% 0.88/1.25 ------------- memory usage ------------
% 0.88/1.25 Memory dynamically allocated (tp_alloc): 4394.
% 0.88/1.25 type (bytes each) gets frees in use avail bytes
% 0.88/1.25 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.88/1.25 term ( 16) 113172 64247 48925 48 953.7 K
% 0.88/1.25 gen_ptr ( 8) 351584 65484 286100 20 2235.3 K
% 0.88/1.25 context ( 808) 48451 48449 2 3 3.9 K
% 0.88/1.25 trail ( 12) 22051 22051 0 21 0.2 K
% 0.88/1.25 bt_node ( 68) 7500 7498 2 61 4.2 K
% 0.88/1.25 ac_position (285432) 0 0 0 0 0.0 K
% 0.88/1.25 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.88/1.25 ac_match_free_vars_pos (4020)
% 0.88/1.25 0 0 0 0 0.0 K
% 0.88/1.25 discrim ( 12) 55210 43725 11485 21264 383.8 K
% 0.88/1.25 flat ( 40) 284348 284348 0 237 9.3 K
% 0.88/1.25 discrim_pos ( 12) 1735 1735 0 1 0.0 K
% 0.88/1.25 fpa_head ( 12) 6670 0 6670 0 78.2 K
% 0.88/1.25 fpa_tree ( 28) 7301 7301 0 63 1.7 K
% 0.88/1.25 fpa_pos ( 36) 1145 1145 0 1 0.0 K
% 0.88/1.25 literal ( 12) 2235 1529 706 1 8.3 K
% 0.88/1.25 clause ( 24) 2235 1529 706 1 16.6 K
% 0.88/1.25 list ( 12) 498 442 56 9 0.8 K
% 0.88/1.25 list_pos ( 20) 3827 2701 1126 678 35.2 K
% 0.88/1.25 pair_index ( 40) 2 0 2 0 0.1 K
% 0.88/1.25
% 0.88/1.25 -------------- statistics -------------
% 0.88/1.25 Clauses input 2
% 0.88/1.25 Usable input 0
% 0.88/1.25 Sos input 2
% 0.88/1.25 Demodulators input 0
% 0.88/1.25 Passive input 0
% 0.88/1.25
% 0.88/1.25 Processed BS (before search) 2
% 0.88/1.25 Forward subsumed BS 0
% 0.88/1.25 Kept BS 2
% 0.88/1.25 New demodulators BS 1
% 0.88/1.25 Back demodulated BS 0
% 0.88/1.25
% 0.88/1.25 Clauses or pairs given 299
% 0.88/1.25 Clauses generated 1202
% 0.88/1.25 Forward subsumed 498
% 0.88/1.25 Deleted by weight 0
% 0.88/1.25 Deleted by variable count 0
% 0.88/1.25 Kept 704
% 0.88/1.25 New demodulators 438
% 0.88/1.25 Back demodulated 562
% 0.88/1.25 Ordered paramod prunes 0
% 0.88/1.25 Basic paramod prunes 1600
% 0.88/1.25 Prime paramod prunes 10
% 0.88/1.25 Semantic prunes 0
% 0.88/1.25
% 0.88/1.25 Rewrite attmepts 35895
% 0.88/1.25 Rewrites 1403
% 0.88/1.25
% 0.88/1.25 FPA overloads 0
% 0.88/1.25 FPA underloads 0
% 0.88/1.25
% 0.88/1.25 Usable size 0
% 0.88/1.25 Sos size 143
% 0.88/1.25 Demodulators size 135
% 0.88/1.25 Passive size 0
% 0.88/1.25 Disabled size 562
% 0.88/1.25
% 0.88/1.25 Proofs found 1
% 0.88/1.25
% 0.88/1.25 ----------- times (seconds) ----------- Wed Jun 1 15:27:23 2022
% 0.88/1.25
% 0.88/1.25 user CPU time 0.13 (0 hr, 0 min, 0 sec)
% 0.88/1.25 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.88/1.25 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.88/1.25 input time 0.00
% 0.88/1.25 paramodulation time 0.00
% 0.88/1.25 demodulation time 0.01
% 0.88/1.25 orient time 0.00
% 0.88/1.25 weigh time 0.00
% 0.88/1.25 forward subsume time 0.01
% 0.88/1.25 back demod find time 0.02
% 0.88/1.25 conflict time 0.00
% 0.88/1.25 LRPO time 0.00
% 0.88/1.25 store clause time 0.06
% 0.88/1.25 disable clause time 0.01
% 0.88/1.25 prime paramod time 0.00
% 0.88/1.25 semantics time 0.00
% 0.88/1.25
% 0.88/1.25 EQP interrupted
%------------------------------------------------------------------------------