TSTP Solution File: BOO068-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO068-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n018.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:33 EDT 2022
% Result : Unsatisfiable 0.89s 1.29s
% Output : Refutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 2
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 2 RR)
% Number of literals : 40 ( 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 : 158 ( 11 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('BOO068-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(b,a,a),a),
file('BOO068-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(22,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,D,E),multiply(F,inverse(multiply(E,inverse(E),G)),G),multiply(C,D,inverse(E)))),multiply(D,F,C)),B),
inference(para,[status(thm),theory(equality)],[13,1]),
[iquote('para(13,1)')] ).
cnf(38,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(C,multiply(D,inverse(multiply(E,inverse(E),F)),F),multiply(inverse(E),multiply(C,inverse(multiply(E,inverse(E),G)),G),inverse(E)))),multiply(multiply(C,inverse(multiply(E,inverse(E),G)),G),D,inverse(E))),B),
inference(para,[status(thm),theory(equality)],[13,22]),
[iquote('para(13,22)')] ).
cnf(40,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,inverse(C),D),multiply(multiply(E,inverse(multiply(C,inverse(C),F)),F),inverse(multiply(D,inverse(D),G)),G),multiply(C,inverse(C),inverse(D)))),E),B),
inference(para,[status(thm),theory(equality)],[13,22]),
[iquote('para(13,22)')] ).
cnf(325,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(326,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,325]),13]),
[iquote('para(13,325),demod([13])')] ).
cnf(333,plain,
equal(multiply(A,inverse(multiply(B,inverse(B),C)),C),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[326,1]),1]),
[iquote('para(326,1),demod([1])')] ).
cnf(334,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)],[326]),333]),
[iquote('back_demod(326),demod([333])')] ).
cnf(348,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,inverse(C),D),E,multiply(C,inverse(C),inverse(D)))),E),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[40]),333,333]),
[iquote('back_demod(40),demod([333,333])')] ).
cnf(350,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(C,D,multiply(inverse(E),C,inverse(E)))),multiply(C,D,inverse(E))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[38]),333,333,333]),
[iquote('back_demod(38),demod([333,333,333])')] ).
cnf(351,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,D,E),F,multiply(C,D,inverse(E)))),multiply(D,F,C)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[22]),333]),
[iquote('back_demod(22),demod([333])')] ).
cnf(354,plain,
equal(multiply(inverse(A),B,A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[13]),333]),
[iquote('back_demod(13),demod([333])')] ).
cnf(378,plain,
equal(multiply(A,inverse(inverse(inverse(B))),B),A),
inference(para,[status(thm),theory(equality)],[354,333]),
[iquote('para(354,333)')] ).
cnf(379,plain,
equal(inverse(inverse(inverse(A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[354,378]),
[iquote('para(354,378)')] ).
cnf(380,plain,
equal(multiply(A,inverse(B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[378]),379]),
[iquote('back_demod(378),demod([379])')] ).
cnf(440,plain,
equal(multiply(inverse(inverse(A)),inverse(multiply(B,inverse(B),multiply(C,inverse(C),D))),D),A),
inference(para,[status(thm),theory(equality)],[354,334]),
[iquote('para(354,334)')] ).
cnf(442,plain,
equal(multiply(A,inverse(A),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[354,334]),379,333]),
[iquote('para(354,334),demod([379,333])')] ).
cnf(443,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[440]),442,442,380]),
[iquote('back_demod(440),demod([442,442,380])')] ).
cnf(584,plain,
equal(multiply(A,inverse(multiply(multiply(B,C,D),E,multiply(B,C,inverse(D)))),multiply(C,E,B)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[351]),442]),
[iquote('back_demod(351),demod([442])')] ).
cnf(585,plain,
equal(multiply(A,inverse(multiply(B,C,multiply(inverse(D),B,inverse(D)))),multiply(B,C,inverse(D))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[350]),442]),
[iquote('back_demod(350),demod([442])')] ).
cnf(586,plain,
equal(multiply(A,inverse(multiply(B,C,inverse(B))),C),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[348]),442,442,442]),
[iquote('back_demod(348),demod([442,442,442])')] ).
cnf(791,plain,
equal(multiply(A,B,inverse(A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[442,586]),1]),
[iquote('para(442,586),flip(1)')] ).
cnf(820,plain,
equal(multiply(A,inverse(multiply(inverse(B),C,inverse(B))),inverse(B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[442,585]),442]),
[iquote('para(442,585),demod([442])')] ).
cnf(822,plain,
equal(multiply(A,inverse(multiply(B,C,B)),B),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[443,820]),443,443]),
[iquote('para(443,820),demod([443,443])')] ).
cnf(825,plain,
equal(inverse(multiply(A,B,A)),inverse(A)),
inference(para,[status(thm),theory(equality)],[354,822]),
[iquote('para(354,822)')] ).
cnf(833,plain,
equal(multiply(A,B,A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[825,443]),443]),1]),
[iquote('para(825,443),demod([443]),flip(1)')] ).
cnf(852,plain,
equal(multiply(A,inverse(multiply(B,C,D)),multiply(D,C,B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[833,584]),791]),
[iquote('para(833,584),demod([791])')] ).
cnf(853,plain,
equal(multiply(A,inverse(multiply(multiply(B,B,C),D,multiply(B,B,inverse(C)))),B),A),
inference(para,[status(thm),theory(equality)],[833,584]),
[iquote('para(833,584)')] ).
cnf(854,plain,
equal(inverse(multiply(multiply(A,A,B),C,multiply(A,A,inverse(B)))),inverse(A)),
inference(para,[status(thm),theory(equality)],[354,853]),
[iquote('para(354,853)')] ).
cnf(855,plain,
equal(multiply(multiply(A,A,B),C,multiply(A,A,inverse(B))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[854,443]),443]),1]),
[iquote('para(854,443),demod([443]),flip(1)')] ).
cnf(856,plain,
equal(multiply(A,A,B),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[855,380]),1]),
[iquote('para(855,380),flip(1)')] ).
cnf(863,plain,
equal(multiply(A,inverse(B),multiply(C,B,B)),A),
inference(para,[status(thm),theory(equality)],[856,852]),
[iquote('para(856,852)')] ).
cnf(866,plain,
equal(inverse(multiply(A,B,B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[354,863]),1]),
[iquote('para(354,863),flip(1)')] ).
cnf(867,plain,
equal(multiply(A,B,B),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[866,443]),443]),1]),
[iquote('para(866,443),demod([443]),flip(1)')] ).
cnf(868,plain,
$false,
inference(conflict,[status(thm)],[867,2]),
[iquote('conflict(867,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : BOO068-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n018.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 : Wed Jun 1 16:57:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.89/1.29 ----- EQP 0.9e, May 2009 -----
% 0.89/1.29 The job began on n018.cluster.edu, Wed Jun 1 16:57:30 2022
% 0.89/1.29 The command was "./eqp09e".
% 0.89/1.29
% 0.89/1.29 set(prolog_style_variables).
% 0.89/1.29 set(lrpo).
% 0.89/1.29 set(basic_paramod).
% 0.89/1.29 set(functional_subsume).
% 0.89/1.29 set(ordered_paramod).
% 0.89/1.29 set(prime_paramod).
% 0.89/1.29 set(para_pairs).
% 0.89/1.29 assign(pick_given_ratio,4).
% 0.89/1.29 clear(print_kept).
% 0.89/1.29 clear(print_new_demod).
% 0.89/1.29 clear(print_back_demod).
% 0.89/1.29 clear(print_given).
% 0.89/1.29 assign(max_mem,64000).
% 0.89/1.29 end_of_commands.
% 0.89/1.29
% 0.89/1.29 Usable:
% 0.89/1.29 end_of_list.
% 0.89/1.29
% 0.89/1.29 Sos:
% 0.89/1.29 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.89/1.29 0 (wt=-1) [] -(multiply(b,a,a) = a).
% 0.89/1.29 end_of_list.
% 0.89/1.29
% 0.89/1.29 Demodulators:
% 0.89/1.29 end_of_list.
% 0.89/1.29
% 0.89/1.29 Passive:
% 0.89/1.29 end_of_list.
% 0.89/1.29
% 0.89/1.29 Starting to process input.
% 0.89/1.29
% 0.89/1.29 ** 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.89/1.29 1 is a new demodulator.
% 0.89/1.29
% 0.89/1.29 ** KEPT: 2 (wt=6) [] -(multiply(b,a,a) = a).
% 0.89/1.29 ---------------- PROOF FOUND ----------------
% 0.89/1.29 % SZS status Unsatisfiable
% 0.89/1.29
% 0.89/1.29
% 0.89/1.29 After processing input:
% 0.89/1.29
% 0.89/1.29 Usable:
% 0.89/1.29 end_of_list.
% 0.89/1.29
% 0.89/1.29 Sos:
% 0.89/1.29 2 (wt=6) [] -(multiply(b,a,a) = a).
% 0.89/1.29 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.89/1.29 end_of_list.
% 0.89/1.29
% 0.89/1.29 Demodulators:
% 0.89/1.29 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.89/1.29 end_of_list.
% 0.89/1.29
% 0.89/1.29 Passive:
% 0.89/1.29 end_of_list.
% 0.89/1.29
% 0.89/1.29 UNIT CONFLICT from 867 and 2 at 0.18 seconds.
% 0.89/1.29
% 0.89/1.29 ---------------- PROOF ----------------
% 0.89/1.29 % SZS output start Refutation
% See solution above
% 0.89/1.29 ------------ end of proof -------------
% 0.89/1.29
% 0.89/1.29
% 0.89/1.29 ------------- memory usage ------------
% 0.89/1.29 Memory dynamically allocated (tp_alloc): 5371.
% 0.89/1.29 type (bytes each) gets frees in use avail bytes
% 0.89/1.29 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.89/1.29 term ( 16) 146431 80707 65724 182 1283.9 K
% 0.89/1.29 gen_ptr ( 8) 477963 84472 393491 39 3074.5 K
% 0.89/1.29 context ( 808) 62383 62381 2 3 3.9 K
% 0.89/1.29 trail ( 12) 50161 50161 0 21 0.2 K
% 0.89/1.29 bt_node ( 68) 11757 11755 2 139 9.4 K
% 0.89/1.29 ac_position (285432) 0 0 0 0 0.0 K
% 0.89/1.29 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.89/1.29 ac_match_free_vars_pos (4020)
% 0.89/1.29 0 0 0 0 0.0 K
% 0.89/1.29 discrim ( 12) 74250 55178 19072 16663 418.8 K
% 0.89/1.29 flat ( 40) 383124 383124 0 237 9.3 K
% 0.89/1.29 discrim_pos ( 12) 1974 1974 0 1 0.0 K
% 0.89/1.29 fpa_head ( 12) 7960 0 7960 0 93.3 K
% 0.89/1.29 fpa_tree ( 28) 10011 10011 0 63 1.7 K
% 0.89/1.29 fpa_pos ( 36) 1439 1439 0 1 0.0 K
% 0.89/1.29 literal ( 12) 2722 1855 867 1 10.2 K
% 0.89/1.29 clause ( 24) 2722 1855 867 1 20.3 K
% 0.89/1.29 list ( 12) 631 575 56 6 0.7 K
% 0.89/1.29 list_pos ( 20) 4559 3098 1461 351 35.4 K
% 0.89/1.29 pair_index ( 40) 2 0 2 0 0.1 K
% 0.89/1.29
% 0.89/1.29 -------------- statistics -------------
% 0.89/1.29 Clauses input 2
% 0.89/1.29 Usable input 0
% 0.89/1.29 Sos input 2
% 0.89/1.29 Demodulators input 0
% 0.89/1.29 Passive input 0
% 0.89/1.29
% 0.89/1.29 Processed BS (before search) 2
% 0.89/1.29 Forward subsumed BS 0
% 0.89/1.29 Kept BS 2
% 0.89/1.29 New demodulators BS 1
% 0.89/1.29 Back demodulated BS 0
% 0.89/1.29
% 0.89/1.29 Clauses or pairs given 632
% 0.89/1.29 Clauses generated 1492
% 0.89/1.29 Forward subsumed 627
% 0.89/1.29 Deleted by weight 0
% 0.89/1.29 Deleted by variable count 0
% 0.89/1.29 Kept 865
% 0.89/1.29 New demodulators 571
% 0.89/1.29 Back demodulated 661
% 0.89/1.29 Ordered paramod prunes 0
% 0.89/1.29 Basic paramod prunes 5077
% 0.89/1.29 Prime paramod prunes 25
% 0.89/1.29 Semantic prunes 0
% 0.89/1.29
% 0.89/1.29 Rewrite attmepts 45636
% 0.89/1.29 Rewrites 1597
% 0.89/1.29
% 0.89/1.29 FPA overloads 0
% 0.89/1.29 FPA underloads 0
% 0.89/1.29
% 0.89/1.29 Usable size 0
% 0.89/1.29 Sos size 205
% 0.89/1.29 Demodulators size 185
% 0.89/1.29 Passive size 0
% 0.89/1.29 Disabled size 661
% 0.89/1.29
% 0.89/1.29 Proofs found 1
% 0.89/1.29
% 0.89/1.29 ----------- times (seconds) ----------- Wed Jun 1 16:57:30 2022
% 0.89/1.29
% 0.89/1.29 user CPU time 0.18 (0 hr, 0 min, 0 sec)
% 0.89/1.29 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.89/1.29 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.89/1.29 input time 0.00
% 0.89/1.29 paramodulation time 0.01
% 0.89/1.29 demodulation time 0.02
% 0.89/1.29 orient time 0.00
% 0.89/1.29 weigh time 0.00
% 0.89/1.29 forward subsume time 0.01
% 0.89/1.29 back demod find time 0.02
% 0.89/1.29 conflict time 0.00
% 0.89/1.29 LRPO time 0.00
% 0.89/1.29 store clause time 0.08
% 0.89/1.29 disable clause time 0.01
% 0.89/1.29 prime paramod time 0.00
% 0.89/1.29 semantics time 0.00
% 0.89/1.29
% 0.89/1.29 EQP interrupted
%------------------------------------------------------------------------------