TSTP Solution File: BOO070-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO070-1 : TPTP v8.1.0. Released v2.6.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 : Thu Jul 14 23:37:34 EDT 2022
% Result : Unsatisfiable 0.71s 1.27s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 3 RR)
% Number of literals : 35 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 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 : 231 ( 4 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('BOO070-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(a,a,b),a),
file('BOO070-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(12,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,K,L)))),multiply(D,multiply(K,multiply(L,inverse(multiply(J,K,M)),M),J),C)),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(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(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(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(387,plain,
equal(multiply(multiply(A,inverse(A),B),inverse(multiply(multiply(C,D,multiply(E,multiply(F,multiply(G,inverse(multiply(H,F,I)),I),H),J)),inverse(multiply(multiply(J,E,multiply(K,multiply(L,M,N),O)),inverse(multiply(multiply(O,K,N),M,multiply(O,K,L))),multiply(J,E,multiply(H,F,G)))),multiply(C,D,multiply(P,inverse(P),Q)))),multiply(D,Q,C)),B),
inference(para,[status(thm),theory(equality)],[12,1]),
[iquote('para(12,1)')] ).
cnf(392,plain,
equal(multiply(multiply(A,B,C),inverse(multiply(multiply(D,E,multiply(F,multiply(G,multiply(H,inverse(multiply(I,G,J)),J),I),K)),inverse(multiply(multiply(K,F,multiply(L,multiply(M,N,O),P)),inverse(multiply(multiply(P,L,O),N,multiply(P,L,M))),multiply(K,F,multiply(I,G,H)))),multiply(D,E,multiply(Q,inverse(Q),R)))),multiply(E,R,D)),multiply(B,multiply(C,inverse(multiply(A,B,S)),S),A)),
inference(para,[status(thm),theory(equality)],[12,3]),
[iquote('para(12,3)')] ).
cnf(393,plain,
equal(multiply(A,multiply(B,inverse(multiply(C,A,D)),D),C),multiply(multiply(C,A,B),inverse(multiply(multiply(E,F,multiply(G,multiply(H,multiply(I,inverse(multiply(J,H,K)),K),J),L)),inverse(multiply(multiply(L,G,multiply(M,multiply(N,O,P),Q)),inverse(multiply(multiply(Q,M,P),O,multiply(Q,M,N))),multiply(L,G,multiply(J,H,I)))),multiply(E,F,multiply(R,inverse(R),S)))),multiply(F,S,E))),
inference(flip,[status(thm),theory(equality)],[392]),
[iquote('flip(392)')] ).
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(478,plain,
equal(multiply(A,multiply(B,inverse(multiply(C,A,D)),D),C),multiply(multiply(C,A,B),inverse(multiply(multiply(E,F,multiply(G,multiply(H,multiply(I,inverse(multiply(J,H,K)),K),J),L)),inverse(multiply(multiply(L,G,multiply(M,multiply(N,O,P),Q)),inverse(multiply(multiply(Q,M,P),O,multiply(Q,M,N))),multiply(L,G,multiply(J,H,I)))),multiply(E,F,R))),multiply(F,R,E))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[393]),442]),
[iquote('back_demod(393),demod([442])')] ).
cnf(479,plain,
equal(multiply(multiply(A,B,C),inverse(multiply(multiply(D,E,multiply(F,multiply(G,multiply(H,inverse(multiply(I,G,J)),J),I),K)),inverse(multiply(multiply(K,F,multiply(L,multiply(M,N,O),P)),inverse(multiply(multiply(P,L,O),N,multiply(P,L,M))),multiply(K,F,multiply(I,G,H)))),multiply(D,E,Q))),multiply(E,Q,D)),multiply(B,multiply(C,inverse(multiply(A,B,R)),R),A)),
inference(flip,[status(thm),theory(equality)],[478]),
[iquote('flip(478)')] ).
cnf(484,plain,
equal(multiply(A,inverse(multiply(multiply(B,C,multiply(D,multiply(E,multiply(F,inverse(multiply(G,E,H)),H),G),I)),inverse(multiply(multiply(I,D,multiply(J,multiply(K,L,M),N)),inverse(multiply(multiply(N,J,M),L,multiply(N,J,K))),multiply(I,D,multiply(G,E,F)))),multiply(B,C,O))),multiply(C,O,B)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[387]),442,442]),
[iquote('back_demod(387),demod([442,442])')] ).
cnf(485,plain,
equal(multiply(A,B,C),multiply(B,multiply(C,inverse(multiply(A,B,D)),D),A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[479]),484]),
[iquote('back_demod(479),demod([484])')] ).
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(792,plain,
~ equal(multiply(a,multiply(b,inverse(multiply(a,a,A)),A),a),a),
inference(para,[status(thm),theory(equality)],[485,2]),
[iquote('para(485,2)')] ).
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(834,plain,
$false,
inference(conflict,[status(thm)],[833,792]),
[iquote('conflict(833,792)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : BOO070-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 1 21:47:42 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.27 ----- EQP 0.9e, May 2009 -----
% 0.71/1.27 The job began on n026.cluster.edu, Wed Jun 1 21:47:42 2022
% 0.71/1.27 The command was "./eqp09e".
% 0.71/1.27
% 0.71/1.27 set(prolog_style_variables).
% 0.71/1.27 set(lrpo).
% 0.71/1.27 set(basic_paramod).
% 0.71/1.27 set(functional_subsume).
% 0.71/1.27 set(ordered_paramod).
% 0.71/1.27 set(prime_paramod).
% 0.71/1.27 set(para_pairs).
% 0.71/1.27 assign(pick_given_ratio,4).
% 0.71/1.27 clear(print_kept).
% 0.71/1.27 clear(print_new_demod).
% 0.71/1.27 clear(print_back_demod).
% 0.71/1.27 clear(print_given).
% 0.71/1.27 assign(max_mem,64000).
% 0.71/1.27 end_of_commands.
% 0.71/1.27
% 0.71/1.27 Usable:
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Sos:
% 0.71/1.27 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.71/1.27 0 (wt=-1) [] -(multiply(a,a,b) = a).
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Demodulators:
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Passive:
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Starting to process input.
% 0.71/1.27
% 0.71/1.27 ** 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.71/1.27 1 is a new demodulator.
% 0.71/1.27
% 0.71/1.27 ** KEPT: 2 (wt=6) [] -(multiply(a,a,b) = a).
% 0.71/1.27 ---------------- PROOF FOUND ----------------
% 0.71/1.27 % SZS status Unsatisfiable
% 0.71/1.27
% 0.71/1.27
% 0.71/1.27 After processing input:
% 0.71/1.27
% 0.71/1.27 Usable:
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Sos:
% 0.71/1.27 2 (wt=6) [] -(multiply(a,a,b) = a).
% 0.71/1.27 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.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Demodulators:
% 0.71/1.27 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.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 Passive:
% 0.71/1.27 end_of_list.
% 0.71/1.27
% 0.71/1.27 UNIT CONFLICT from 833 and 792 at 0.17 seconds.
% 0.71/1.27
% 0.71/1.27 ---------------- PROOF ----------------
% 0.71/1.27 % SZS output start Refutation
% See solution above
% 0.71/1.27 ------------ end of proof -------------
% 0.71/1.27
% 0.71/1.27
% 0.71/1.27 ------------- memory usage ------------
% 0.71/1.27 Memory dynamically allocated (tp_alloc): 5371.
% 0.71/1.27 type (bytes each) gets frees in use avail bytes
% 0.71/1.27 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.71/1.27 term ( 16) 140523 77066 63457 83 1237.8 K
% 0.71/1.27 gen_ptr ( 8) 462920 83349 379571 34 2965.7 K
% 0.71/1.27 context ( 808) 59377 59375 2 3 3.9 K
% 0.71/1.27 trail ( 12) 31955 31955 0 21 0.2 K
% 0.71/1.27 bt_node ( 68) 9936 9934 2 116 7.8 K
% 0.71/1.27 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.27 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.27 ac_match_free_vars_pos (4020)
% 0.71/1.27 0 0 0 0 0.0 K
% 0.71/1.27 discrim ( 12) 71199 54748 16451 19284 418.8 K
% 0.71/1.27 flat ( 40) 366673 366673 0 237 9.3 K
% 0.71/1.27 discrim_pos ( 12) 1880 1880 0 1 0.0 K
% 0.71/1.27 fpa_head ( 12) 7480 0 7480 0 87.7 K
% 0.71/1.27 fpa_tree ( 28) 9640 9640 0 63 1.7 K
% 0.71/1.27 fpa_pos ( 36) 1378 1378 0 1 0.0 K
% 0.71/1.27 literal ( 12) 2590 1757 833 1 9.8 K
% 0.71/1.27 clause ( 24) 2590 1757 833 1 19.5 K
% 0.71/1.27 list ( 12) 604 548 56 6 0.7 K
% 0.71/1.27 list_pos ( 20) 4398 3018 1380 432 35.4 K
% 0.71/1.27 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.27
% 0.71/1.27 -------------- statistics -------------
% 0.71/1.27 Clauses input 2
% 0.71/1.27 Usable input 0
% 0.71/1.27 Sos input 2
% 0.71/1.27 Demodulators input 0
% 0.71/1.27 Passive input 0
% 0.71/1.27
% 0.71/1.27 Processed BS (before search) 2
% 0.71/1.27 Forward subsumed BS 0
% 0.71/1.27 Kept BS 2
% 0.71/1.27 New demodulators BS 1
% 0.71/1.27 Back demodulated BS 0
% 0.71/1.27
% 0.71/1.27 Clauses or pairs given 502
% 0.71/1.27 Clauses generated 1401
% 0.71/1.27 Forward subsumed 570
% 0.71/1.27 Deleted by weight 0
% 0.71/1.27 Deleted by variable count 0
% 0.71/1.27 Kept 831
% 0.71/1.27 New demodulators 544
% 0.71/1.27 Back demodulated 645
% 0.71/1.27 Ordered paramod prunes 0
% 0.71/1.27 Basic paramod prunes 3260
% 0.71/1.27 Prime paramod prunes 22
% 0.71/1.27 Semantic prunes 0
% 0.71/1.27
% 0.71/1.27 Rewrite attmepts 44056
% 0.71/1.27 Rewrites 1511
% 0.71/1.27
% 0.71/1.27 FPA overloads 0
% 0.71/1.27 FPA underloads 0
% 0.71/1.27
% 0.71/1.27 Usable size 0
% 0.71/1.27 Sos size 187
% 0.71/1.27 Demodulators size 174
% 0.71/1.27 Passive size 0
% 0.71/1.27 Disabled size 645
% 0.71/1.27
% 0.71/1.27 Proofs found 1
% 0.71/1.27
% 0.71/1.27 ----------- times (seconds) ----------- Wed Jun 1 21:47:43 2022
% 0.71/1.27
% 0.71/1.27 user CPU time 0.17 (0 hr, 0 min, 0 sec)
% 0.71/1.27 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.27 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.71/1.27 input time 0.00
% 0.71/1.27 paramodulation time 0.02
% 0.71/1.27 demodulation time 0.02
% 0.71/1.27 orient time 0.01
% 0.71/1.27 weigh time 0.00
% 0.71/1.27 forward subsume time 0.01
% 0.71/1.27 back demod find time 0.01
% 0.71/1.27 conflict time 0.00
% 0.71/1.27 LRPO time 0.00
% 0.71/1.27 store clause time 0.07
% 0.71/1.27 disable clause time 0.01
% 0.71/1.27 prime paramod time 0.01
% 0.71/1.27 semantics time 0.00
% 0.71/1.27
% 0.71/1.27 EQP interrupted
%------------------------------------------------------------------------------