TSTP Solution File: GRP415-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP415-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n020.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:46:44 EDT 2022
% Result : Unsatisfiable 1.10s 1.51s
% Output : Refutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 3 RR)
% Number of literals : 22 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 3 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A)))))),C),
file('GRP415-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,C))),inverse(multiply(inverse(A),A)))))),multiply(D,inverse(multiply(inverse(multiply(inverse(multiply(E,D)),multiply(E,inverse(C)))),inverse(multiply(inverse(D),D)))))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(5,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A))))),inverse(multiply(D,inverse(multiply(inverse(multiply(inverse(multiply(E,D)),multiply(E,C))),inverse(multiply(inverse(D),D))))))),
inference(flip,[status(thm),theory(equality)],[4]),
[iquote('flip(4)')] ).
cnf(19,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(inverse(C))))),inverse(multiply(inverse(A),A))))),C),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(22,plain,
equal(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),C)),inverse(multiply(inverse(A),A)))))),multiply(inverse(multiply(inverse(multiply(D,B)),multiply(D,inverse(inverse(C))))),inverse(multiply(inverse(B),B)))),
inference(para,[status(thm),theory(equality)],[19,1]),
[iquote('para(19,1)')] ).
cnf(23,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(inverse(C))))),inverse(multiply(inverse(B),B))),inverse(multiply(D,inverse(multiply(inverse(multiply(inverse(multiply(B,D)),C)),inverse(multiply(inverse(D),D))))))),
inference(flip,[status(thm),theory(equality)],[22]),
[iquote('flip(22)')] ).
cnf(35,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(inverse(multiply(B,inverse(C))))))),inverse(multiply(inverse(B),B))),C),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,22]),1]),
[iquote('para(1,22),flip(1)')] ).
cnf(50,plain,
equal(inverse(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,C))),inverse(multiply(inverse(A),A))))))),C),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(65,plain,
equal(inverse(multiply(A,inverse(inverse(multiply(B,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),inverse(multiply(inverse(B),B))))))))),inverse(C)),
inference(para,[status(thm),theory(equality)],[23,1]),
[iquote('para(23,1)')] ).
cnf(67,plain,
equal(inverse(multiply(A,inverse(inverse(multiply(B,inverse(multiply(C,inverse(multiply(inverse(B),B))))))))),inverse(inverse(multiply(inverse(multiply(inverse(multiply(D,inverse(multiply(A,B)))),multiply(D,inverse(C)))),inverse(multiply(inverse(inverse(multiply(A,B))),inverse(multiply(A,B)))))))),
inference(para,[status(thm),theory(equality)],[1,65]),
[iquote('para(1,65)')] ).
cnf(111,plain,
equal(inverse(multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(inverse(multiply(B,C)))))),inverse(multiply(inverse(B),B)))),C),
inference(para,[status(thm),theory(equality)],[22,50]),
[iquote('para(22,50)')] ).
cnf(511,plain,
equal(inverse(inverse(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(inverse(multiply(inverse(multiply(D,C)),multiply(D,inverse(E)))))))),inverse(multiply(inverse(inverse(multiply(B,C))),inverse(multiply(B,C))))))),inverse(multiply(B,inverse(E)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,67]),1]),
[iquote('para(1,67),flip(1)')] ).
cnf(899,plain,
equal(inverse(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(inverse(multiply(inverse(multiply(D,C)),multiply(D,inverse(E)))))))),inverse(multiply(inverse(inverse(multiply(B,C))),inverse(multiply(B,C)))))),multiply(B,inverse(E))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[511,1]),1]),1]),
[iquote('para(511,1),demod([1]),flip(1)')] ).
cnf(927,plain,
equal(inverse(multiply(inverse(multiply(A,B)),multiply(A,inverse(C)))),inverse(multiply(inverse(multiply(D,B)),multiply(D,inverse(C))))),
inference(para,[status(thm),theory(equality)],[899,1]),
[iquote('para(899,1)')] ).
cnf(931,plain,
equal(inverse(multiply(inverse(multiply(A,B)),multiply(A,C))),inverse(multiply(inverse(multiply(D,B)),multiply(D,C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,927]),1]),
[iquote('para(1,927),demod([1])')] ).
cnf(942,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,C)),multiply(inverse(multiply(D,B)),multiply(D,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[931,1]),1]),
[iquote('para(931,1),demod([1])')] ).
cnf(961,plain,
equal(multiply(A,multiply(inverse(multiply(inverse(multiply(B,C)),multiply(B,inverse(inverse(multiply(C,A)))))),D)),multiply(inverse(multiply(E,inverse(multiply(inverse(C),C)))),multiply(E,D))),
inference(para,[status(thm),theory(equality)],[111,942]),
[iquote('para(111,942)')] ).
cnf(1323,plain,
equal(multiply(inverse(A),A),multiply(inverse(multiply(B,inverse(multiply(inverse(C),C)))),multiply(B,inverse(multiply(inverse(C),C))))),
inference(para,[status(thm),theory(equality)],[35,961]),
[iquote('para(35,961)')] ).
cnf(1324,plain,
equal(multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(multiply(inverse(B),B)))),multiply(inverse(C),C)),
inference(flip,[status(thm),theory(equality)],[1323]),
[iquote('flip(1323)')] ).
cnf(1325,plain,
~ equal(multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(multiply(inverse(B),B)))),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[1323,2]),
[iquote('para(1323,2)')] ).
cnf(1326,plain,
$false,
inference(conflict,[status(thm)],[1325,1324]),
[iquote('conflict(1325,1324)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP415-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n020.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.33 % DateTime : Mon Jun 13 06:49:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.10/1.51 ----- EQP 0.9e, May 2009 -----
% 1.10/1.51 The job began on n020.cluster.edu, Mon Jun 13 06:49:05 2022
% 1.10/1.51 The command was "./eqp09e".
% 1.10/1.51
% 1.10/1.51 set(prolog_style_variables).
% 1.10/1.51 set(lrpo).
% 1.10/1.51 set(basic_paramod).
% 1.10/1.51 set(functional_subsume).
% 1.10/1.51 set(ordered_paramod).
% 1.10/1.51 set(prime_paramod).
% 1.10/1.51 set(para_pairs).
% 1.10/1.51 assign(pick_given_ratio,4).
% 1.10/1.51 clear(print_kept).
% 1.10/1.51 clear(print_new_demod).
% 1.10/1.51 clear(print_back_demod).
% 1.10/1.51 clear(print_given).
% 1.10/1.51 assign(max_mem,64000).
% 1.10/1.51 end_of_commands.
% 1.10/1.51
% 1.10/1.51 Usable:
% 1.10/1.51 end_of_list.
% 1.10/1.51
% 1.10/1.51 Sos:
% 1.10/1.51 0 (wt=-1) [] inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A)))))) = C.
% 1.10/1.51 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 1.10/1.51 end_of_list.
% 1.10/1.51
% 1.10/1.51 Demodulators:
% 1.10/1.51 end_of_list.
% 1.10/1.51
% 1.10/1.51 Passive:
% 1.10/1.51 end_of_list.
% 1.10/1.51
% 1.10/1.51 Starting to process input.
% 1.10/1.51
% 1.10/1.51 ** KEPT: 1 (wt=22) [] inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A)))))) = C.
% 1.10/1.51 1 is a new demodulator.
% 1.10/1.51
% 1.10/1.51 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 1.10/1.51 ---------------- PROOF FOUND ----------------
% 1.10/1.51 % SZS status Unsatisfiable
% 1.10/1.51
% 1.10/1.51
% 1.10/1.51 After processing input:
% 1.10/1.51
% 1.10/1.51 Usable:
% 1.10/1.51 end_of_list.
% 1.10/1.51
% 1.10/1.51 Sos:
% 1.10/1.51 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 1.10/1.51 1 (wt=22) [] inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A)))))) = C.
% 1.10/1.51 end_of_list.
% 1.10/1.51
% 1.10/1.51 Demodulators:
% 1.10/1.51 1 (wt=22) [] inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,A)),multiply(B,inverse(C)))),inverse(multiply(inverse(A),A)))))) = C.
% 1.10/1.51 end_of_list.
% 1.10/1.51
% 1.10/1.51 Passive:
% 1.10/1.51 end_of_list.
% 1.10/1.51
% 1.10/1.51 UNIT CONFLICT from 1325 and 1324 at 0.35 seconds.
% 1.10/1.51
% 1.10/1.51 ---------------- PROOF ----------------
% 1.10/1.51 % SZS output start Refutation
% See solution above
% 1.10/1.51 ------------ end of proof -------------
% 1.10/1.51
% 1.10/1.51
% 1.10/1.51 ------------- memory usage ------------
% 1.10/1.51 Memory dynamically allocated (tp_alloc): 17578.
% 1.10/1.51 type (bytes each) gets frees in use avail bytes
% 1.10/1.51 sym_ent ( 96) 55 0 55 0 5.2 K
% 1.10/1.51 term ( 16) 415430 225964 189466 43 3696.2 K
% 1.10/1.51 gen_ptr ( 8) 1517574 28947 1488627 21 11630.1 K
% 1.10/1.51 context ( 808) 298405 298403 2 3 3.9 K
% 1.10/1.51 trail ( 12) 2895 2895 0 12 0.1 K
% 1.10/1.51 bt_node ( 68) 39792 39788 4 204 13.8 K
% 1.10/1.51 ac_position (285432) 0 0 0 0 0.0 K
% 1.10/1.51 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.10/1.51 ac_match_free_vars_pos (4020)
% 1.10/1.51 0 0 0 0 0.0 K
% 1.10/1.51 discrim ( 12) 139163 14639 124524 0 1459.3 K
% 1.10/1.51 flat ( 40) 2357933 2357933 0 716 28.0 K
% 1.10/1.51 discrim_pos ( 12) 1935 1935 0 1 0.0 K
% 1.10/1.51 fpa_head ( 12) 4450 0 4450 0 52.1 K
% 1.10/1.51 fpa_tree ( 28) 3158 3158 0 31 0.8 K
% 1.10/1.51 fpa_pos ( 36) 1581 1581 0 1 0.0 K
% 1.10/1.51 literal ( 12) 5420 4095 1325 1 15.5 K
% 1.10/1.51 clause ( 24) 5420 4095 1325 1 31.1 K
% 1.10/1.51 list ( 12) 315 259 56 3 0.7 K
% 1.10/1.51 list_pos ( 20) 4445 484 3961 0 77.4 K
% 1.10/1.51 pair_index ( 40) 2 0 2 0 0.1 K
% 1.10/1.51
% 1.10/1.51 -------------- statistics -------------
% 1.10/1.51 Clauses input 2
% 1.10/1.51 Usable input 0
% 1.10/1.51 Sos input 2
% 1.10/1.51 Demodulators input 0
% 1.10/1.51 Passive input 0
% 1.10/1.51
% 1.10/1.51 Processed BS (before search) 2
% 1.10/1.51 Forward subsumed BS 0
% 1.10/1.51 Kept BS 2
% 1.10/1.51 New demodulators BS 1
% 1.10/1.51 Back demodulated BS 0
% 1.10/1.51
% 1.10/1.51 Clauses or pairs given 1926
% 1.10/1.51 Clauses generated 2814
% 1.10/1.51 Forward subsumed 1491
% 1.10/1.51 Deleted by weight 0
% 1.10/1.51 Deleted by variable count 0
% 1.10/1.51 Kept 1323
% 1.10/1.51 New demodulators 255
% 1.10/1.51 Back demodulated 107
% 1.10/1.51 Ordered paramod prunes 0
% 1.10/1.51 Basic paramod prunes 30818
% 1.10/1.51 Prime paramod prunes 12
% 1.10/1.51 Semantic prunes 0
% 1.10/1.51
% 1.10/1.51 Rewrite attmepts 237717
% 1.10/1.51 Rewrites 854
% 1.10/1.51
% 1.10/1.51 FPA overloads 0
% 1.10/1.51 FPA underloads 0
% 1.10/1.51
% 1.10/1.51 Usable size 0
% 1.10/1.51 Sos size 1217
% 1.10/1.51 Demodulators size 203
% 1.10/1.51 Passive size 0
% 1.10/1.51 Disabled size 107
% 1.10/1.51
% 1.10/1.51 Proofs found 1
% 1.10/1.51
% 1.10/1.51 ----------- times (seconds) ----------- Mon Jun 13 06:49:06 2022
% 1.10/1.51
% 1.10/1.51 user CPU time 0.35 (0 hr, 0 min, 0 sec)
% 1.10/1.51 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 1.10/1.51 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.10/1.51 input time 0.00
% 1.10/1.51 paramodulation time 0.03
% 1.10/1.51 demodulation time 0.08
% 1.10/1.51 orient time 0.01
% 1.10/1.51 weigh time 0.00
% 1.10/1.51 forward subsume time 0.02
% 1.10/1.51 back demod find time 0.01
% 1.10/1.51 conflict time 0.00
% 1.10/1.51 LRPO time 0.01
% 1.10/1.51 store clause time 0.18
% 1.10/1.51 disable clause time 0.00
% 1.10/1.51 prime paramod time 0.01
% 1.10/1.51 semantics time 0.00
% 1.10/1.51
% 1.10/1.51 EQP interrupted
%------------------------------------------------------------------------------