TSTP Solution File: GRP409-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP409-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 : Sat Jul 16 08:46:32 EDT 2022
% Result : Unsatisfiable 0.73s 1.17s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 3 RR)
% Number of literals : 18 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 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 : 57 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))),B),
file('GRP409-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(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(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(multiply(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(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,inverse(D))))),inverse(multiply(inverse(multiply(C,inverse(D))),multiply(C,inverse(D))))),inverse(multiply(C,inverse(multiply(multiply(B,inverse(multiply(inverse(D),D))),D))))),
inference(para,[status(thm),theory(equality)],[11,1]),
[iquote('para(11,1)')] ).
cnf(15,plain,
equal(inverse(multiply(A,inverse(multiply(multiply(B,inverse(multiply(inverse(C),C))),C)))),multiply(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(63,plain,
equal(inverse(multiply(A,inverse(multiply(multiply(multiply(B,multiply(A,inverse(C))),inverse(multiply(inverse(C),C))),C)))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,14]),1]),
[iquote('para(1,14),flip(1)')] ).
cnf(93,plain,
equal(multiply(multiply(multiply(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(B,inverse(multiply(inverse(D),D)))),
inference(para,[status(thm),theory(equality)],[15,1]),
[iquote('para(15,1)')] ).
cnf(158,plain,
equal(multiply(multiply(multiply(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(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,93]),1,1,1]),
[iquote('para(1,93),demod([1,1,1])')] ).
cnf(162,plain,
equal(multiply(multiply(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)],[158,1]),1]),1]),
[iquote('para(158,1),demod([1]),flip(1)')] ).
cnf(165,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))),multiply(multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C))),inverse(multiply(inverse(C),C)))),
inference(para,[status(thm),theory(equality)],[162,1]),
[iquote('para(162,1)')] ).
cnf(173,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)],[165,1]),1]),
[iquote('para(165,1),demod([1])')] ).
cnf(183,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,inverse(C))),multiply(inverse(multiply(D,B)),multiply(D,inverse(C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[63,173]),63]),
[iquote('para(63,173),demod([63])')] ).
cnf(194,plain,
equal(multiply(inverse(multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),D)),B),multiply(inverse(multiply(E,D)),multiply(E,inverse(multiply(inverse(C),C))))),
inference(para,[status(thm),theory(equality)],[1,183]),
[iquote('para(1,183)')] ).
cnf(413,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,194]),
[iquote('para(1,194)')] ).
cnf(414,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)],[413]),
[iquote('flip(413)')] ).
cnf(419,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)],[413,2]),
[iquote('para(413,2)')] ).
cnf(420,plain,
$false,
inference(conflict,[status(thm)],[419,414]),
[iquote('conflict(419,414)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP409-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/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 : Mon Jun 13 13:42:27 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.73/1.17 ----- EQP 0.9e, May 2009 -----
% 0.73/1.17 The job began on n018.cluster.edu, Mon Jun 13 13:42:28 2022
% 0.73/1.17 The command was "./eqp09e".
% 0.73/1.17
% 0.73/1.17 set(prolog_style_variables).
% 0.73/1.17 set(lrpo).
% 0.73/1.17 set(basic_paramod).
% 0.73/1.17 set(functional_subsume).
% 0.73/1.17 set(ordered_paramod).
% 0.73/1.17 set(prime_paramod).
% 0.73/1.17 set(para_pairs).
% 0.73/1.17 assign(pick_given_ratio,4).
% 0.73/1.17 clear(print_kept).
% 0.73/1.17 clear(print_new_demod).
% 0.73/1.17 clear(print_back_demod).
% 0.73/1.17 clear(print_given).
% 0.73/1.17 assign(max_mem,64000).
% 0.73/1.17 end_of_commands.
% 0.73/1.17
% 0.73/1.17 Usable:
% 0.73/1.17 end_of_list.
% 0.73/1.17
% 0.73/1.17 Sos:
% 0.73/1.17 0 (wt=-1) [] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))) = B.
% 0.73/1.17 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.73/1.17 end_of_list.
% 0.73/1.17
% 0.73/1.17 Demodulators:
% 0.73/1.17 end_of_list.
% 0.73/1.17
% 0.73/1.17 Passive:
% 0.73/1.17 end_of_list.
% 0.73/1.17
% 0.73/1.17 Starting to process input.
% 0.73/1.17
% 0.73/1.17 ** KEPT: 1 (wt=20) [] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))) = B.
% 0.73/1.17 1 is a new demodulator.
% 0.73/1.17
% 0.73/1.17 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.73/1.17 ---------------- PROOF FOUND ----------------
% 0.73/1.17 % SZS status Unsatisfiable
% 0.73/1.17
% 0.73/1.17
% 0.73/1.17 After processing input:
% 0.73/1.17
% 0.73/1.17 Usable:
% 0.73/1.17 end_of_list.
% 0.73/1.17
% 0.73/1.17 Sos:
% 0.73/1.17 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.73/1.17 1 (wt=20) [] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))) = B.
% 0.73/1.17 end_of_list.
% 0.73/1.17
% 0.73/1.17 Demodulators:
% 0.73/1.17 1 (wt=20) [] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))) = B.
% 0.73/1.17 end_of_list.
% 0.73/1.17
% 0.73/1.17 Passive:
% 0.73/1.17 end_of_list.
% 0.73/1.17
% 0.73/1.17 UNIT CONFLICT from 419 and 414 at 0.07 seconds.
% 0.73/1.17
% 0.73/1.17 ---------------- PROOF ----------------
% 0.73/1.17 % SZS output start Refutation
% See solution above
% 0.73/1.17 ------------ end of proof -------------
% 0.73/1.17
% 0.73/1.17
% 0.73/1.17 ------------- memory usage ------------
% 0.73/1.17 Memory dynamically allocated (tp_alloc): 2441.
% 0.73/1.17 type (bytes each) gets frees in use avail bytes
% 0.73/1.17 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.73/1.17 term ( 16) 57671 33456 24215 45 472.2 K
% 0.73/1.17 gen_ptr ( 8) 158902 3016 155886 17 1218.0 K
% 0.73/1.17 context ( 808) 44781 44779 2 2 3.2 K
% 0.73/1.17 trail ( 12) 850 850 0 7 0.1 K
% 0.73/1.17 bt_node ( 68) 11620 11616 4 68 4.8 K
% 0.73/1.17 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.17 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.17 ac_match_free_vars_pos (4020)
% 0.73/1.17 0 0 0 0 0.0 K
% 0.73/1.17 discrim ( 12) 23317 1028 22289 0 261.2 K
% 0.73/1.17 flat ( 40) 178114 178114 0 172 6.7 K
% 0.73/1.17 discrim_pos ( 12) 532 532 0 1 0.0 K
% 0.73/1.17 fpa_head ( 12) 5240 0 5240 0 61.4 K
% 0.73/1.17 fpa_tree ( 28) 1691 1691 0 33 0.9 K
% 0.73/1.17 fpa_pos ( 36) 531 531 0 1 0.0 K
% 0.73/1.17 literal ( 12) 1661 1242 419 0 4.9 K
% 0.73/1.17 clause ( 24) 1661 1242 419 0 9.8 K
% 0.73/1.17 list ( 12) 171 115 56 3 0.7 K
% 0.73/1.17 list_pos ( 20) 1398 77 1321 0 25.8 K
% 0.73/1.17 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.17
% 0.73/1.17 -------------- statistics -------------
% 0.73/1.17 Clauses input 2
% 0.73/1.17 Usable input 0
% 0.73/1.17 Sos input 2
% 0.73/1.17 Demodulators input 0
% 0.73/1.17 Passive input 0
% 0.73/1.17
% 0.73/1.17 Processed BS (before search) 2
% 0.73/1.17 Forward subsumed BS 0
% 0.73/1.17 Kept BS 2
% 0.73/1.17 New demodulators BS 1
% 0.73/1.17 Back demodulated BS 0
% 0.73/1.17
% 0.73/1.17 Clauses or pairs given 673
% 0.73/1.17 Clauses generated 863
% 0.73/1.17 Forward subsumed 446
% 0.73/1.17 Deleted by weight 0
% 0.73/1.17 Deleted by variable count 0
% 0.73/1.17 Kept 417
% 0.73/1.17 New demodulators 111
% 0.73/1.17 Back demodulated 15
% 0.73/1.17 Ordered paramod prunes 0
% 0.73/1.17 Basic paramod prunes 6588
% 0.73/1.17 Prime paramod prunes 6
% 0.73/1.17 Semantic prunes 0
% 0.73/1.17
% 0.73/1.17 Rewrite attmepts 29074
% 0.73/1.17 Rewrites 166
% 0.73/1.17
% 0.73/1.17 FPA overloads 0
% 0.73/1.17 FPA underloads 0
% 0.73/1.17
% 0.73/1.17 Usable size 0
% 0.73/1.17 Sos size 403
% 0.73/1.17 Demodulators size 97
% 0.73/1.17 Passive size 0
% 0.73/1.17 Disabled size 15
% 0.73/1.17
% 0.73/1.17 Proofs found 1
% 0.73/1.17
% 0.73/1.17 ----------- times (seconds) ----------- Mon Jun 13 13:42:28 2022
% 0.73/1.17
% 0.73/1.17 user CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.73/1.17 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.73/1.17 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.17 input time 0.00
% 0.73/1.17 paramodulation time 0.01
% 0.73/1.17 demodulation time 0.01
% 0.73/1.17 orient time 0.00
% 0.73/1.17 weigh time 0.00
% 0.73/1.17 forward subsume time 0.00
% 0.73/1.17 back demod find time 0.00
% 0.73/1.17 conflict time 0.00
% 0.73/1.17 LRPO time 0.00
% 0.73/1.17 store clause time 0.03
% 0.73/1.17 disable clause time 0.00
% 0.73/1.17 prime paramod time 0.00
% 0.73/1.17 semantics time 0.00
% 0.73/1.17
% 0.73/1.17 EQP interrupted
%------------------------------------------------------------------------------