TSTP Solution File: BOO071-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO071-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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.79s 1.22s
% Output : Refutation 0.79s
% 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('BOO071-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(inverse(b),b,a),a),
file('BOO071-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(710,plain,
equal(multiply(inverse(A),A,B),B),
inference(para,[status(thm),theory(equality)],[704,462]),
[iquote('para(704,462)')] ).
cnf(711,plain,
$false,
inference(conflict,[status(thm)],[710,2]),
[iquote('conflict(710,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : BOO071-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 1 18:55:16 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.79/1.22 ----- EQP 0.9e, May 2009 -----
% 0.79/1.22 The job began on n021.cluster.edu, Wed Jun 1 18:55:16 2022
% 0.79/1.22 The command was "./eqp09e".
% 0.79/1.22
% 0.79/1.22 set(prolog_style_variables).
% 0.79/1.22 set(lrpo).
% 0.79/1.22 set(basic_paramod).
% 0.79/1.22 set(functional_subsume).
% 0.79/1.22 set(ordered_paramod).
% 0.79/1.22 set(prime_paramod).
% 0.79/1.22 set(para_pairs).
% 0.79/1.22 assign(pick_given_ratio,4).
% 0.79/1.22 clear(print_kept).
% 0.79/1.22 clear(print_new_demod).
% 0.79/1.22 clear(print_back_demod).
% 0.79/1.22 clear(print_given).
% 0.79/1.22 assign(max_mem,64000).
% 0.79/1.22 end_of_commands.
% 0.79/1.22
% 0.79/1.22 Usable:
% 0.79/1.22 end_of_list.
% 0.79/1.22
% 0.79/1.22 Sos:
% 0.79/1.22 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.79/1.22 0 (wt=-1) [] -(multiply(inverse(b),b,a) = a).
% 0.79/1.22 end_of_list.
% 0.79/1.22
% 0.79/1.22 Demodulators:
% 0.79/1.22 end_of_list.
% 0.79/1.22
% 0.79/1.22 Passive:
% 0.79/1.22 end_of_list.
% 0.79/1.22
% 0.79/1.22 Starting to process input.
% 0.79/1.22
% 0.79/1.22 ** 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.79/1.22 1 is a new demodulator.
% 0.79/1.22
% 0.79/1.22 ** KEPT: 2 (wt=7) [] -(multiply(inverse(b),b,a) = a).
% 0.79/1.22 ---------------- PROOF FOUND ----------------
% 0.79/1.22 % SZS status Unsatisfiable
% 0.79/1.22
% 0.79/1.22
% 0.79/1.22 After processing input:
% 0.79/1.22
% 0.79/1.22 Usable:
% 0.79/1.22 end_of_list.
% 0.79/1.22
% 0.79/1.22 Sos:
% 0.79/1.22 2 (wt=7) [] -(multiply(inverse(b),b,a) = a).
% 0.79/1.22 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.79/1.22 end_of_list.
% 0.79/1.22
% 0.79/1.22 Demodulators:
% 0.79/1.22 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.79/1.22 end_of_list.
% 0.79/1.22
% 0.79/1.22 Passive:
% 0.79/1.22 end_of_list.
% 0.79/1.22
% 0.79/1.22 UNIT CONFLICT from 710 and 2 at 0.14 seconds.
% 0.79/1.22
% 0.79/1.22 ---------------- PROOF ----------------
% 0.79/1.22 % SZS output start Refutation
% See solution above
% 0.79/1.22 ------------ end of proof -------------
% 0.79/1.22
% 0.79/1.22
% 0.79/1.22 ------------- memory usage ------------
% 0.79/1.22 Memory dynamically allocated (tp_alloc): 4394.
% 0.79/1.22 type (bytes each) gets frees in use avail bytes
% 0.79/1.22 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.79/1.22 term ( 16) 113329 64275 49054 48 956.2 K
% 0.79/1.22 gen_ptr ( 8) 352639 65760 286879 20 2241.4 K
% 0.79/1.22 context ( 808) 48531 48529 2 3 3.9 K
% 0.79/1.22 trail ( 12) 22353 22353 0 21 0.2 K
% 0.79/1.22 bt_node ( 68) 7510 7508 2 61 4.2 K
% 0.79/1.22 ac_position (285432) 0 0 0 0 0.0 K
% 0.79/1.22 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.79/1.22 ac_match_free_vars_pos (4020)
% 0.79/1.22 0 0 0 0 0.0 K
% 0.79/1.22 discrim ( 12) 55371 43906 11465 21284 383.8 K
% 0.79/1.22 flat ( 40) 284835 284835 0 237 9.3 K
% 0.79/1.22 discrim_pos ( 12) 1739 1739 0 1 0.0 K
% 0.79/1.22 fpa_head ( 12) 6670 0 6670 0 78.2 K
% 0.79/1.22 fpa_tree ( 28) 7329 7329 0 63 1.7 K
% 0.79/1.22 fpa_pos ( 36) 1153 1153 0 1 0.0 K
% 0.79/1.22 literal ( 12) 2243 1533 710 1 8.3 K
% 0.79/1.22 clause ( 24) 2243 1533 710 1 16.7 K
% 0.79/1.22 list ( 12) 502 446 56 9 0.8 K
% 0.79/1.22 list_pos ( 20) 3849 2716 1133 671 35.2 K
% 0.79/1.22 pair_index ( 40) 2 0 2 0 0.1 K
% 0.79/1.22
% 0.79/1.22 -------------- statistics -------------
% 0.79/1.22 Clauses input 2
% 0.79/1.22 Usable input 0
% 0.79/1.22 Sos input 2
% 0.79/1.22 Demodulators input 0
% 0.79/1.22 Passive input 0
% 0.79/1.22
% 0.79/1.22 Processed BS (before search) 2
% 0.79/1.22 Forward subsumed BS 0
% 0.79/1.22 Kept BS 2
% 0.79/1.22 New demodulators BS 1
% 0.79/1.22 Back demodulated BS 0
% 0.79/1.22
% 0.79/1.22 Clauses or pairs given 301
% 0.79/1.22 Clauses generated 1206
% 0.79/1.22 Forward subsumed 498
% 0.79/1.22 Deleted by weight 0
% 0.79/1.22 Deleted by variable count 0
% 0.79/1.22 Kept 708
% 0.79/1.22 New demodulators 442
% 0.79/1.22 Back demodulated 565
% 0.79/1.22 Ordered paramod prunes 0
% 0.79/1.22 Basic paramod prunes 1617
% 0.79/1.22 Prime paramod prunes 10
% 0.79/1.22 Semantic prunes 0
% 0.79/1.22
% 0.79/1.22 Rewrite attmepts 35954
% 0.79/1.22 Rewrites 1407
% 0.79/1.22
% 0.79/1.22 FPA overloads 0
% 0.79/1.22 FPA underloads 0
% 0.79/1.22
% 0.79/1.22 Usable size 0
% 0.79/1.22 Sos size 144
% 0.79/1.22 Demodulators size 136
% 0.79/1.22 Passive size 0
% 0.79/1.22 Disabled size 565
% 0.79/1.22
% 0.79/1.22 Proofs found 1
% 0.79/1.22
% 0.79/1.22 ----------- times (seconds) ----------- Wed Jun 1 18:55:17 2022
% 0.79/1.22
% 0.79/1.22 user CPU time 0.14 (0 hr, 0 min, 0 sec)
% 0.79/1.22 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.79/1.22 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.79/1.22 input time 0.00
% 0.79/1.22 paramodulation time 0.01
% 0.79/1.22 demodulation time 0.01
% 0.79/1.22 orient time 0.01
% 0.79/1.22 weigh time 0.00
% 0.79/1.22 forward subsume time 0.01
% 0.79/1.22 back demod find time 0.01
% 0.79/1.22 conflict time 0.00
% 0.79/1.22 LRPO time 0.00
% 0.79/1.22 store clause time 0.07
% 0.79/1.22 disable clause time 0.01
% 0.79/1.22 prime paramod time 0.01
% 0.79/1.22 semantics time 0.00
% 0.79/1.22
% 0.79/1.22 EQP interrupted
%------------------------------------------------------------------------------