TSTP Solution File: GRP425-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP425-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n029.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.73s 1.39s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 2
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 0 equ; 3 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 : 94 ( 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('GRP425-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(multiply(inverse(b2),b2),a2),a2),
file('GRP425-1.p',unknown),
[] ).
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(73,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,73]),1,1,1]),
[iquote('para(1,73),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(200,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),multiply(C,inverse(multiply(inverse(D),D))))))),multiply(A,inverse(multiply(C,inverse(multiply(inverse(D),D))))))),inverse(multiply(inverse(E),E))),B),
inference(para,[status(thm),theory(equality)],[184,1]),
[iquote('para(184,1)')] ).
cnf(262,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(multiply(C,inverse(multiply(inverse(D),D))))))),inverse(multiply(inverse(E),E))),multiply(C,inverse(multiply(inverse(D),D)))),
inference(para,[status(thm),theory(equality)],[184,200]),
[iquote('para(184,200)')] ).
cnf(281,plain,
equal(multiply(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(B),B))),multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C)))),
inference(para,[status(thm),theory(equality)],[184,262]),
[iquote('para(184,262)')] ).
cnf(301,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(inverse(multiply(inverse(B),B))),inverse(multiply(inverse(B),B)))))),multiply(A,inverse(inverse(multiply(inverse(C),C)))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C))))),multiply(inverse(D),D)),
inference(para,[status(thm),theory(equality)],[281,1]),
[iquote('para(281,1)')] ).
cnf(302,plain,
equal(multiply(inverse(A),A),multiply(inverse(multiply(inverse(multiply(B,inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C)))))),multiply(B,inverse(inverse(multiply(inverse(D),D)))))),inverse(multiply(inverse(inverse(multiply(inverse(D),D))),inverse(multiply(inverse(D),D)))))),
inference(flip,[status(thm),theory(equality)],[301]),
[iquote('flip(301)')] ).
cnf(313,plain,
equal(multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A))),multiply(inverse(inverse(multiply(inverse(B),B))),inverse(multiply(inverse(B),B)))),
inference(para,[status(thm),theory(equality)],[281,281]),
[iquote('para(281,281)')] ).
cnf(324,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(inverse(multiply(inverse(B),B))),inverse(multiply(inverse(B),B)))))),multiply(A,inverse(inverse(multiply(inverse(C),C)))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C))))),inverse(multiply(inverse(C),C))),
inference(para,[status(thm),theory(equality)],[313,1]),
[iquote('para(313,1)')] ).
cnf(325,plain,
equal(multiply(inverse(A),A),inverse(multiply(inverse(B),B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[302]),324]),
[iquote('back_demod(302),demod([324])')] ).
cnf(326,plain,
equal(inverse(multiply(inverse(A),A)),multiply(inverse(B),B)),
inference(flip,[status(thm),theory(equality)],[325]),
[iquote('flip(325)')] ).
cnf(330,plain,
~ equal(multiply(inverse(multiply(inverse(A),A)),a2),a2),
inference(para,[status(thm),theory(equality)],[325,2]),
[iquote('para(325,2)')] ).
cnf(343,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[326,326]),
[iquote('para(326,326)')] ).
cnf(1331,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(C)))),inverse(multiply(inverse(C),C))),C),
inference(para,[status(thm),theory(equality)],[343,1]),
[iquote('para(343,1)')] ).
cnf(1572,plain,
equal(multiply(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(multiply(inverse(B),B)),multiply(inverse(B),B)))),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[343,1331]),
[iquote('para(343,1331)')] ).
cnf(1579,plain,
equal(multiply(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(B),B))),multiply(inverse(C),C)),
inference(para,[status(thm),theory(equality)],[343,1572]),
[iquote('para(343,1572)')] ).
cnf(1580,plain,
equal(multiply(inverse(A),A),multiply(inverse(multiply(inverse(B),B)),inverse(multiply(inverse(C),C)))),
inference(flip,[status(thm),theory(equality)],[1579]),
[iquote('flip(1579)')] ).
cnf(1591,plain,
~ equal(multiply(inverse(multiply(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(B),B)))),a2),a2),
inference(para,[status(thm),theory(equality)],[1580,330]),
[iquote('para(1580,330)')] ).
cnf(1592,plain,
$false,
inference(conflict,[status(thm)],[1591,137]),
[iquote('conflict(1591,137)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP425-1 : TPTP v8.1.0. Released v2.6.0.
% 0.08/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n029.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 : Tue Jun 14 04:10:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.39 ----- EQP 0.9e, May 2009 -----
% 0.73/1.39 The job began on n029.cluster.edu, Tue Jun 14 04:10:41 2022
% 0.73/1.39 The command was "./eqp09e".
% 0.73/1.39
% 0.73/1.39 set(prolog_style_variables).
% 0.73/1.39 set(lrpo).
% 0.73/1.39 set(basic_paramod).
% 0.73/1.39 set(functional_subsume).
% 0.73/1.39 set(ordered_paramod).
% 0.73/1.39 set(prime_paramod).
% 0.73/1.39 set(para_pairs).
% 0.73/1.39 assign(pick_given_ratio,4).
% 0.73/1.39 clear(print_kept).
% 0.73/1.39 clear(print_new_demod).
% 0.73/1.39 clear(print_back_demod).
% 0.73/1.39 clear(print_given).
% 0.73/1.39 assign(max_mem,64000).
% 0.73/1.39 end_of_commands.
% 0.73/1.39
% 0.73/1.39 Usable:
% 0.73/1.39 end_of_list.
% 0.73/1.39
% 0.73/1.39 Sos:
% 0.73/1.39 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.73/1.39 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.73/1.39 end_of_list.
% 0.73/1.39
% 0.73/1.39 Demodulators:
% 0.73/1.39 end_of_list.
% 0.73/1.39
% 0.73/1.39 Passive:
% 0.73/1.39 end_of_list.
% 0.73/1.39
% 0.73/1.39 Starting to process input.
% 0.73/1.39
% 0.73/1.39 ** 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.73/1.39 1 is a new demodulator.
% 0.73/1.39
% 0.73/1.39 ** KEPT: 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.73/1.39 ---------------- PROOF FOUND ----------------
% 0.73/1.39 % SZS status Unsatisfiable
% 0.73/1.39
% 0.73/1.39
% 0.73/1.39 After processing input:
% 0.73/1.39
% 0.73/1.39 Usable:
% 0.73/1.39 end_of_list.
% 0.73/1.39
% 0.73/1.39 Sos:
% 0.73/1.39 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.73/1.39 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.73/1.39 end_of_list.
% 0.73/1.39
% 0.73/1.39 Demodulators:
% 0.73/1.39 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.73/1.39 end_of_list.
% 0.73/1.39
% 0.73/1.39 Passive:
% 0.73/1.39 end_of_list.
% 0.73/1.39
% 0.73/1.39 UNIT CONFLICT from 1591 and 137 at 0.26 seconds.
% 0.73/1.39
% 0.73/1.39 ---------------- PROOF ----------------
% 0.73/1.39 % SZS output start Refutation
% See solution above
% 0.73/1.39 ------------ end of proof -------------
% 0.73/1.39
% 0.73/1.39
% 0.73/1.39 ------------- memory usage ------------
% 0.73/1.39 Memory dynamically allocated (tp_alloc): 9765.
% 0.73/1.39 type (bytes each) gets frees in use avail bytes
% 0.73/1.39 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.73/1.39 term ( 16) 265171 155046 110125 825 2160.8 K
% 0.73/1.39 gen_ptr ( 8) 879847 83445 796402 30 6222.1 K
% 0.73/1.39 context ( 808) 226835 226833 2 2 3.2 K
% 0.73/1.39 trail ( 12) 13052 13052 0 9 0.1 K
% 0.73/1.39 bt_node ( 68) 61861 61857 4 110 7.6 K
% 0.73/1.39 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.39 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.39 ac_match_free_vars_pos (4020)
% 0.73/1.39 0 0 0 0 0.0 K
% 0.73/1.39 discrim ( 12) 88732 46412 42320 27409 817.1 K
% 0.73/1.39 flat ( 40) 892007 892007 0 341 13.3 K
% 0.73/1.39 discrim_pos ( 12) 2217 2217 0 1 0.0 K
% 0.73/1.39 fpa_head ( 12) 5294 0 5294 0 62.0 K
% 0.73/1.39 fpa_tree ( 28) 13288 13288 0 37 1.0 K
% 0.73/1.39 fpa_pos ( 36) 1998 1998 0 1 0.0 K
% 0.73/1.39 literal ( 12) 5541 3950 1591 1 18.7 K
% 0.73/1.39 clause ( 24) 5541 3950 1591 1 37.3 K
% 0.73/1.39 list ( 12) 466 410 56 6 0.7 K
% 0.73/1.39 list_pos ( 20) 6362 2460 3902 380 83.6 K
% 0.73/1.39 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.39
% 0.73/1.39 -------------- statistics -------------
% 0.73/1.39 Clauses input 2
% 0.73/1.39 Usable input 0
% 0.73/1.39 Sos input 2
% 0.73/1.39 Demodulators input 0
% 0.73/1.39 Passive input 0
% 0.73/1.39
% 0.73/1.39 Processed BS (before search) 2
% 0.73/1.39 Forward subsumed BS 0
% 0.73/1.39 Kept BS 2
% 0.73/1.39 New demodulators BS 1
% 0.73/1.39 Back demodulated BS 0
% 0.73/1.39
% 0.73/1.39 Clauses or pairs given 3383
% 0.73/1.39 Clauses generated 3224
% 0.73/1.39 Forward subsumed 1635
% 0.73/1.39 Deleted by weight 0
% 0.73/1.39 Deleted by variable count 0
% 0.73/1.39 Kept 1589
% 0.73/1.39 New demodulators 406
% 0.73/1.39 Back demodulated 527
% 0.73/1.39 Ordered paramod prunes 0
% 0.73/1.39 Basic paramod prunes 33598
% 0.73/1.39 Prime paramod prunes 6
% 0.73/1.39 Semantic prunes 0
% 0.73/1.39
% 0.73/1.39 Rewrite attmepts 158944
% 0.73/1.39 Rewrites 948
% 0.73/1.39
% 0.73/1.39 FPA overloads 0
% 0.73/1.39 FPA underloads 0
% 0.73/1.39
% 0.73/1.39 Usable size 0
% 0.73/1.39 Sos size 1063
% 0.73/1.39 Demodulators size 186
% 0.73/1.39 Passive size 0
% 0.73/1.39 Disabled size 527
% 0.73/1.39
% 0.73/1.39 Proofs found 1
% 0.73/1.39
% 0.73/1.39 ----------- times (seconds) ----------- Tue Jun 14 04:10:41 2022
% 0.73/1.39
% 0.73/1.39 user CPU time 0.26 (0 hr, 0 min, 0 sec)
% 0.73/1.39 system CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.73/1.39 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.39 input time 0.00
% 0.73/1.39 paramodulation time 0.03
% 0.73/1.39 demodulation time 0.04
% 0.73/1.39 orient time 0.02
% 0.73/1.39 weigh time 0.00
% 0.73/1.39 forward subsume time 0.01
% 0.73/1.39 back demod find time 0.03
% 0.73/1.39 conflict time 0.00
% 0.73/1.39 LRPO time 0.01
% 0.73/1.39 store clause time 0.10
% 0.73/1.39 disable clause time 0.01
% 0.73/1.39 prime paramod time 0.01
% 0.73/1.39 semantics time 0.00
% 0.73/1.39
% 0.73/1.39 EQP interrupted
%------------------------------------------------------------------------------