TSTP Solution File: GRP424-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP424-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:46 EDT 2022
% Result : Unsatisfiable 0.71s 1.11s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 3 RR)
% Number of literals : 16 ( 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 : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),C)))),multiply(A,inverse(C)))),inverse(multiply(inverse(C),C))),B),
file('GRP424-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(3,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(inverse(multiply(inverse(C),C)))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C))))),multiply(inverse(multiply(D,inverse(multiply(inverse(B),C)))),multiply(D,inverse(C)))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(11,plain,
equal(multiply(inverse(multiply(A,inverse(multiply(inverse(multiply(inverse(B),inverse(multiply(inverse(C),C)))),C)))),multiply(A,inverse(C))),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(14,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,inverse(D)))))),inverse(multiply(inverse(multiply(C,inverse(D))),multiply(C,inverse(D))))),multiply(C,inverse(multiply(inverse(multiply(inverse(B),inverse(multiply(inverse(D),D)))),D)))),
inference(para,[status(thm),theory(equality)],[11,1]),
[iquote('para(11,1)')] ).
cnf(15,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(inverse(B),inverse(multiply(inverse(C),C)))),C))),multiply(inverse(multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(multiply(A,inverse(C)))))),inverse(multiply(inverse(multiply(A,inverse(C))),multiply(A,inverse(C)))))),
inference(flip,[status(thm),theory(equality)],[14]),
[iquote('flip(14)')] ).
cnf(74,plain,
equal(multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,inverse(D)))))),inverse(multiply(inverse(multiply(C,inverse(D))),multiply(C,inverse(D)))))),multiply(C,inverse(D)))),inverse(multiply(inverse(D),D))),multiply(inverse(B),inverse(multiply(inverse(D),D)))),
inference(para,[status(thm),theory(equality)],[15,1]),
[iquote('para(15,1)')] ).
cnf(127,plain,
equal(multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C)))),inverse(multiply(inverse(C),C)))),C)),inverse(multiply(inverse(multiply(inverse(D),D)),multiply(inverse(D),D)))),multiply(inverse(B),inverse(multiply(inverse(multiply(inverse(D),D)),multiply(inverse(D),D))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,74]),1,1,1]),
[iquote('para(1,74),demod([1,1,1])')] ).
cnf(137,plain,
equal(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C)))),inverse(multiply(inverse(C),C)))),C),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[127,1]),1]),1]),
[iquote('para(127,1),demod([1]),flip(1)')] ).
cnf(140,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C)))),inverse(multiply(inverse(C),C))),multiply(inverse(multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C)))),inverse(multiply(inverse(C),C)))),
inference(para,[status(thm),theory(equality)],[137,1]),
[iquote('para(137,1)')] ).
cnf(147,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))),multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[140,1]),1]),
[iquote('para(140,1),demod([1])')] ).
cnf(150,plain,
equal(multiply(inverse(A),multiply(inverse(multiply(inverse(multiply(B,inverse(multiply(inverse(A),C)))),multiply(B,inverse(C)))),inverse(D))),multiply(inverse(multiply(E,inverse(multiply(inverse(C),C)))),multiply(E,inverse(D)))),
inference(para,[status(thm),theory(equality)],[1,147]),
[iquote('para(1,147)')] ).
cnf(183,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)],[1,150]),
[iquote('para(1,150)')] ).
cnf(184,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)],[183]),
[iquote('flip(183)')] ).
cnf(185,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)],[183,2]),
[iquote('para(183,2)')] ).
cnf(186,plain,
$false,
inference(conflict,[status(thm)],[185,184]),
[iquote('conflict(185,184)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP424-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/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 : Tue Jun 14 08:35:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.11 ----- EQP 0.9e, May 2009 -----
% 0.71/1.11 The job began on n020.cluster.edu, Tue Jun 14 08:35:20 2022
% 0.71/1.11 The command was "./eqp09e".
% 0.71/1.11
% 0.71/1.11 set(prolog_style_variables).
% 0.71/1.11 set(lrpo).
% 0.71/1.11 set(basic_paramod).
% 0.71/1.11 set(functional_subsume).
% 0.71/1.11 set(ordered_paramod).
% 0.71/1.11 set(prime_paramod).
% 0.71/1.11 set(para_pairs).
% 0.71/1.11 assign(pick_given_ratio,4).
% 0.71/1.11 clear(print_kept).
% 0.71/1.11 clear(print_new_demod).
% 0.71/1.11 clear(print_back_demod).
% 0.71/1.11 clear(print_given).
% 0.71/1.11 assign(max_mem,64000).
% 0.71/1.11 end_of_commands.
% 0.71/1.11
% 0.71/1.11 Usable:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Sos:
% 0.71/1.11 0 (wt=-1) [] multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),C)))),multiply(A,inverse(C)))),inverse(multiply(inverse(C),C))) = B.
% 0.71/1.11 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Demodulators:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Passive:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Starting to process input.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 1 (wt=22) [] multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),C)))),multiply(A,inverse(C)))),inverse(multiply(inverse(C),C))) = B.
% 0.71/1.11 1 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.71/1.11 ---------------- PROOF FOUND ----------------
% 0.71/1.11 % SZS status Unsatisfiable
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 After processing input:
% 0.71/1.11
% 0.71/1.11 Usable:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Sos:
% 0.71/1.11 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.71/1.11 1 (wt=22) [] multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),C)))),multiply(A,inverse(C)))),inverse(multiply(inverse(C),C))) = B.
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Demodulators:
% 0.71/1.11 1 (wt=22) [] multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),C)))),multiply(A,inverse(C)))),inverse(multiply(inverse(C),C))) = B.
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Passive:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 UNIT CONFLICT from 185 and 184 at 0.03 seconds.
% 0.71/1.11
% 0.71/1.11 ---------------- PROOF ----------------
% 0.71/1.11 % SZS output start Refutation
% See solution above
% 0.71/1.11 ------------ end of proof -------------
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 ------------- memory usage ------------
% 0.71/1.11 Memory dynamically allocated (tp_alloc): 1464.
% 0.71/1.11 type (bytes each) gets frees in use avail bytes
% 0.71/1.11 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.71/1.11 term ( 16) 24515 12552 11963 78 234.4 K
% 0.71/1.11 gen_ptr ( 8) 83781 1496 82285 15 643.0 K
% 0.71/1.11 context ( 808) 21260 21258 2 2 3.2 K
% 0.71/1.11 trail ( 12) 613 613 0 6 0.1 K
% 0.71/1.11 bt_node ( 68) 8032 8028 4 72 5.0 K
% 0.71/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.11 ac_match_free_vars_pos (4020)
% 0.71/1.11 0 0 0 0 0.0 K
% 0.71/1.11 discrim ( 12) 12347 484 11863 0 139.0 K
% 0.71/1.11 flat ( 40) 70937 70937 0 149 5.8 K
% 0.71/1.11 discrim_pos ( 12) 131 131 0 1 0.0 K
% 0.71/1.11 fpa_head ( 12) 2138 0 2138 0 25.1 K
% 0.71/1.11 fpa_tree ( 28) 1068 1068 0 29 0.8 K
% 0.71/1.11 fpa_pos ( 36) 262 262 0 1 0.0 K
% 0.71/1.11 literal ( 12) 583 398 185 1 2.2 K
% 0.71/1.11 clause ( 24) 583 398 185 1 4.4 K
% 0.71/1.11 list ( 12) 136 80 56 3 0.7 K
% 0.71/1.11 list_pos ( 20) 653 57 596 0 11.6 K
% 0.71/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.11
% 0.71/1.11 -------------- statistics -------------
% 0.71/1.11 Clauses input 2
% 0.71/1.11 Usable input 0
% 0.71/1.11 Sos input 2
% 0.71/1.11 Demodulators input 0
% 0.71/1.11 Passive input 0
% 0.71/1.11
% 0.71/1.11 Processed BS (before search) 2
% 0.71/1.11 Forward subsumed BS 0
% 0.71/1.11 Kept BS 2
% 0.71/1.11 New demodulators BS 1
% 0.71/1.11 Back demodulated BS 0
% 0.71/1.11
% 0.71/1.11 Clauses or pairs given 333
% 0.71/1.11 Clauses generated 301
% 0.71/1.11 Forward subsumed 118
% 0.71/1.11 Deleted by weight 0
% 0.71/1.11 Deleted by variable count 0
% 0.71/1.11 Kept 183
% 0.71/1.11 New demodulators 76
% 0.71/1.11 Back demodulated 11
% 0.71/1.11 Ordered paramod prunes 0
% 0.71/1.11 Basic paramod prunes 4201
% 0.71/1.11 Prime paramod prunes 6
% 0.71/1.11 Semantic prunes 0
% 0.71/1.11
% 0.71/1.11 Rewrite attmepts 12721
% 0.71/1.11 Rewrites 54
% 0.71/1.11
% 0.71/1.11 FPA overloads 0
% 0.71/1.11 FPA underloads 0
% 0.71/1.11
% 0.71/1.11 Usable size 0
% 0.71/1.11 Sos size 173
% 0.71/1.11 Demodulators size 66
% 0.71/1.11 Passive size 0
% 0.71/1.11 Disabled size 11
% 0.71/1.11
% 0.71/1.11 Proofs found 1
% 0.71/1.11
% 0.71/1.11 ----------- times (seconds) ----------- Tue Jun 14 08:35:20 2022
% 0.71/1.11
% 0.71/1.11 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.71/1.11 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.71/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.11 input time 0.00
% 0.71/1.11 paramodulation time 0.00
% 0.71/1.11 demodulation time 0.01
% 0.71/1.11 orient time 0.00
% 0.71/1.11 weigh time 0.00
% 0.71/1.11 forward subsume time 0.00
% 0.71/1.11 back demod find time 0.00
% 0.71/1.11 conflict time 0.00
% 0.71/1.11 LRPO time 0.00
% 0.71/1.11 store clause time 0.01
% 0.71/1.11 disable clause time 0.00
% 0.71/1.11 prime paramod time 0.00
% 0.71/1.11 semantics time 0.00
% 0.71/1.11
% 0.71/1.11 EQP interrupted
%------------------------------------------------------------------------------