TSTP Solution File: GRP511-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP511-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n010.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:47:45 EDT 2022
% Result : Unsatisfiable 0.73s 1.10s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 2
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 3 RR)
% Number of literals : 33 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))),B),
file('GRP511-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP511-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),inverse(multiply(multiply(multiply(C,A),D),B))),inverse(multiply(C,D))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(4,plain,
equal(multiply(A,inverse(multiply(multiply(B,A),inverse(multiply(B,C))))),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(5,plain,
equal(multiply(multiply(multiply(multiply(multiply(A,B),C),D),inverse(multiply(A,C))),inverse(B)),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(8,plain,
equal(multiply(inverse(multiply(A,B)),inverse(multiply(C,inverse(multiply(multiply(multiply(A,C),B),D))))),D),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(11,plain,
equal(multiply(multiply(A,inverse(multiply(B,C))),inverse(A)),inverse(multiply(B,C))),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(16,plain,
equal(multiply(A,inverse(multiply(multiply(B,A),C))),inverse(multiply(B,C))),
inference(para,[status(thm),theory(equality)],[1,11]),
[iquote('para(1,11)')] ).
cnf(17,plain,
equal(inverse(multiply(A,inverse(multiply(A,B)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),16]),
[iquote('back_demod(4),demod([16])')] ).
cnf(27,plain,
equal(inverse(multiply(A,inverse(multiply(multiply(A,B),C)))),multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,16]),1]),
[iquote('para(17,16),flip(1)')] ).
cnf(28,plain,
equal(inverse(multiply(multiply(A,B),C)),inverse(multiply(A,multiply(B,C)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,17]),1]),
[iquote('para(27,17),flip(1)')] ).
cnf(35,plain,
equal(multiply(A,inverse(multiply(B,multiply(A,C)))),inverse(multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),28]),
[iquote('back_demod(16),demod([28])')] ).
cnf(42,plain,
equal(multiply(inverse(multiply(A,B)),inverse(inverse(multiply(A,multiply(B,C))))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),28,28,35]),
[iquote('back_demod(8),demod([28,28,35])')] ).
cnf(46,plain,
equal(inverse(inverse(multiply(A,B))),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[35,17]),
[iquote('para(35,17)')] ).
cnf(47,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,multiply(B,C))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[42]),46]),
[iquote('back_demod(42),demod([46])')] ).
cnf(55,plain,
equal(inverse(multiply(inverse(multiply(A,B)),inverse(C))),multiply(A,multiply(B,C))),
inference(para,[status(thm),theory(equality)],[47,17]),
[iquote('para(47,17)')] ).
cnf(56,plain,
equal(multiply(multiply(A,inverse(B)),inverse(A)),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,5]),1]),
[iquote('para(5,5),demod([1])')] ).
cnf(60,plain,
equal(multiply(inverse(A),inverse(multiply(B,inverse(A)))),inverse(B)),
inference(para,[status(thm),theory(equality)],[56,56]),
[iquote('para(56,56)')] ).
cnf(61,plain,
equal(inverse(multiply(inverse(A),inverse(inverse(B)))),inverse(multiply(B,inverse(A)))),
inference(para,[status(thm),theory(equality)],[60,17]),
[iquote('para(60,17)')] ).
cnf(62,plain,
equal(inverse(multiply(A,inverse(B))),inverse(multiply(inverse(B),inverse(inverse(A))))),
inference(flip,[status(thm),theory(equality)],[61]),
[iquote('flip(61)')] ).
cnf(64,plain,
equal(multiply(inverse(multiply(A,B)),B),inverse(A)),
inference(para,[status(thm),theory(equality)],[17,60]),
[iquote('para(17,60)')] ).
cnf(70,plain,
equal(multiply(A,multiply(B,inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[64,17]),55]),
[iquote('para(64,17),demod([55])')] ).
cnf(73,plain,
equal(inverse(multiply(A,inverse(B))),multiply(B,inverse(A))),
inference(para,[status(thm),theory(equality)],[70,17]),
[iquote('para(70,17)')] ).
cnf(77,plain,
equal(multiply(A,inverse(B)),multiply(inverse(B),inverse(inverse(A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[62]),73,73]),
[iquote('back_demod(62),demod([73,73])')] ).
cnf(78,plain,
equal(multiply(inverse(A),inverse(inverse(B))),multiply(B,inverse(A))),
inference(flip,[status(thm),theory(equality)],[77]),
[iquote('flip(77)')] ).
cnf(80,plain,
equal(multiply(A,multiply(B,C)),multiply(B,multiply(C,A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[55]),73,46]),
[iquote('back_demod(55),demod([73,46])')] ).
cnf(84,plain,
equal(multiply(multiply(A,B),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[17]),73]),
[iquote('back_demod(17),demod([73])')] ).
cnf(91,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[64,84]),46]),
[iquote('para(64,84),demod([46])')] ).
cnf(92,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[91,70]),
[iquote('para(91,70)')] ).
cnf(93,plain,
equal(multiply(inverse(A),B),multiply(B,inverse(A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[78]),92]),
[iquote('back_demod(78),demod([92])')] ).
cnf(100,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[92,93]),92]),
[iquote('para(92,93),demod([92])')] ).
cnf(197,plain,
~ equal(multiply(c3,multiply(a3,b3)),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[100,2]),
[iquote('para(100,2)')] ).
cnf(198,plain,
$false,
inference(conflict,[status(thm)],[197,80]),
[iquote('conflict(197,80)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP511-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n010.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 01:26:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.10 ----- EQP 0.9e, May 2009 -----
% 0.73/1.10 The job began on n010.cluster.edu, Tue Jun 14 01:26:55 2022
% 0.73/1.10 The command was "./eqp09e".
% 0.73/1.10
% 0.73/1.10 set(prolog_style_variables).
% 0.73/1.10 set(lrpo).
% 0.73/1.10 set(basic_paramod).
% 0.73/1.10 set(functional_subsume).
% 0.73/1.10 set(ordered_paramod).
% 0.73/1.10 set(prime_paramod).
% 0.73/1.10 set(para_pairs).
% 0.73/1.10 assign(pick_given_ratio,4).
% 0.73/1.10 clear(print_kept).
% 0.73/1.10 clear(print_new_demod).
% 0.73/1.10 clear(print_back_demod).
% 0.73/1.10 clear(print_given).
% 0.73/1.10 assign(max_mem,64000).
% 0.73/1.10 end_of_commands.
% 0.73/1.10
% 0.73/1.10 Usable:
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Sos:
% 0.73/1.10 0 (wt=-1) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.73/1.10 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Demodulators:
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Passive:
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Starting to process input.
% 0.73/1.10
% 0.73/1.10 ** KEPT: 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.73/1.10 1 is a new demodulator.
% 0.73/1.10
% 0.73/1.10 ** KEPT: 2 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.73/1.10 ---------------- PROOF FOUND ----------------
% 0.73/1.10 % SZS status Unsatisfiable
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 After processing input:
% 0.73/1.10
% 0.73/1.10 Usable:
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Sos:
% 0.73/1.10 2 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.73/1.10 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Demodulators:
% 0.73/1.10 1 (wt=12) [] multiply(multiply(multiply(A,B),C),inverse(multiply(A,C))) = B.
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 Passive:
% 0.73/1.10 end_of_list.
% 0.73/1.10
% 0.73/1.10 UNIT CONFLICT from 197 and 80 at 0.01 seconds.
% 0.73/1.10
% 0.73/1.10 ---------------- PROOF ----------------
% 0.73/1.10 % SZS output start Refutation
% See solution above
% 0.73/1.10 ------------ end of proof -------------
% 0.73/1.10
% 0.73/1.10
% 0.73/1.10 ------------- memory usage ------------
% 0.73/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.73/1.10 type (bytes each) gets frees in use avail bytes
% 0.73/1.10 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.73/1.10 term ( 16) 11927 8786 3141 21 61.0 K
% 0.73/1.10 gen_ptr ( 8) 18068 5069 12999 32 101.8 K
% 0.73/1.10 context ( 808) 7329 7327 2 7 7.1 K
% 0.73/1.10 trail ( 12) 1687 1687 0 6 0.1 K
% 0.73/1.10 bt_node ( 68) 2123 2120 3 12 1.0 K
% 0.73/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.10 ac_match_free_vars_pos (4020)
% 0.73/1.10 0 0 0 0 0.0 K
% 0.73/1.10 discrim ( 12) 2955 2119 836 123 11.2 K
% 0.73/1.10 flat ( 40) 22309 22309 0 28 1.1 K
% 0.73/1.10 discrim_pos ( 12) 648 648 0 1 0.0 K
% 0.73/1.10 fpa_head ( 12) 996 0 996 0 11.7 K
% 0.73/1.10 fpa_tree ( 28) 669 669 0 17 0.5 K
% 0.73/1.10 fpa_pos ( 36) 331 331 0 1 0.0 K
% 0.73/1.10 literal ( 12) 749 552 197 0 2.3 K
% 0.73/1.10 clause ( 24) 749 552 197 0 4.6 K
% 0.73/1.10 list ( 12) 193 137 56 3 0.7 K
% 0.73/1.10 list_pos ( 20) 979 610 369 10 7.4 K
% 0.73/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.10
% 0.73/1.10 -------------- statistics -------------
% 0.73/1.10 Clauses input 2
% 0.73/1.10 Usable input 0
% 0.73/1.10 Sos input 2
% 0.73/1.10 Demodulators input 0
% 0.73/1.10 Passive input 0
% 0.73/1.10
% 0.73/1.10 Processed BS (before search) 2
% 0.73/1.10 Forward subsumed BS 0
% 0.73/1.10 Kept BS 2
% 0.73/1.10 New demodulators BS 1
% 0.73/1.10 Back demodulated BS 0
% 0.73/1.10
% 0.73/1.10 Clauses or pairs given 260
% 0.73/1.10 Clauses generated 458
% 0.73/1.10 Forward subsumed 263
% 0.73/1.10 Deleted by weight 0
% 0.73/1.10 Deleted by variable count 0
% 0.73/1.10 Kept 195
% 0.73/1.10 New demodulators 133
% 0.73/1.10 Back demodulated 127
% 0.73/1.10 Ordered paramod prunes 0
% 0.73/1.10 Basic paramod prunes 489
% 0.73/1.10 Prime paramod prunes 51
% 0.73/1.10 Semantic prunes 0
% 0.73/1.10
% 0.73/1.10 Rewrite attmepts 4245
% 0.73/1.10 Rewrites 517
% 0.73/1.10
% 0.73/1.10 FPA overloads 0
% 0.73/1.10 FPA underloads 0
% 0.73/1.10
% 0.73/1.10 Usable size 0
% 0.73/1.10 Sos size 69
% 0.73/1.10 Demodulators size 35
% 0.73/1.10 Passive size 0
% 0.73/1.10 Disabled size 127
% 0.73/1.10
% 0.73/1.10 Proofs found 1
% 0.73/1.10
% 0.73/1.10 ----------- times (seconds) ----------- Tue Jun 14 01:26:55 2022
% 0.73/1.10
% 0.73/1.10 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.73/1.10 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.73/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.10 input time 0.00
% 0.73/1.10 paramodulation time 0.00
% 0.73/1.10 demodulation time 0.00
% 0.73/1.10 orient time 0.01
% 0.73/1.10 weigh time 0.00
% 0.73/1.10 forward subsume time 0.00
% 0.73/1.10 back demod find time 0.00
% 0.73/1.10 conflict time 0.00
% 0.73/1.10 LRPO time 0.00
% 0.73/1.10 store clause time 0.00
% 0.73/1.10 disable clause time 0.00
% 0.73/1.10 prime paramod time 0.00
% 0.73/1.10 semantics time 0.00
% 0.73/1.10
% 0.73/1.10 EQP interrupted
%------------------------------------------------------------------------------