TSTP Solution File: GRP514-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP514-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n012.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:46 EDT 2022
% Result : Unsatisfiable 0.65s 1.05s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 4 RR)
% Number of literals : 21 ( 0 equ; 3 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))),B),
file('GRP514-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(multiply(inverse(b2),b2),a2),a2),
file('GRP514-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(A,multiply(B,inverse(multiply(A,multiply(multiply(B,C),inverse(multiply(D,C))))))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(multiply(A,multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(8,plain,
equal(multiply(A,multiply(B,inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,1]),7]),
[iquote('para(7,1),demod([7])')] ).
cnf(9,plain,
equal(multiply(A,multiply(B,inverse(multiply(A,multiply(B,inverse(C)))))),C),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(10,plain,
equal(multiply(A,multiply(multiply(B,multiply(C,inverse(A))),inverse(C))),B),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(13,plain,
equal(multiply(A,multiply(multiply(B,C),inverse(B))),multiply(A,C)),
inference(para,[status(thm),theory(equality)],[1,9]),
[iquote('para(1,9)')] ).
cnf(18,plain,
equal(multiply(multiply(A,B),multiply(C,inverse(multiply(C,B)))),A),
inference(para,[status(thm),theory(equality)],[1,10]),
[iquote('para(1,10)')] ).
cnf(23,plain,
equal(multiply(multiply(A,B),multiply(C,inverse(A))),multiply(C,B)),
inference(para,[status(thm),theory(equality)],[18,9]),
[iquote('para(18,9)')] ).
cnf(35,plain,
equal(multiply(multiply(A,B),C),multiply(multiply(A,C),B)),
inference(para,[status(thm),theory(equality)],[23,13]),
[iquote('para(23,13)')] ).
cnf(36,plain,
equal(multiply(A,multiply(multiply(B,inverse(multiply(B,C))),C)),A),
inference(para,[status(thm),theory(equality)],[35,7]),
[iquote('para(35,7)')] ).
cnf(38,plain,
equal(multiply(A,inverse(multiply(A,inverse(B)))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[36,8]),1]),
[iquote('para(36,8),flip(1)')] ).
cnf(39,plain,
equal(multiply(multiply(A,inverse(B)),B),A),
inference(para,[status(thm),theory(equality)],[38,8]),
[iquote('para(38,8)')] ).
cnf(40,plain,
equal(multiply(A,inverse(multiply(B,inverse(B)))),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[39,7]),1]),
[iquote('para(39,7),flip(1)')] ).
cnf(41,plain,
equal(multiply(A,B),multiply(B,inverse(inverse(A)))),
inference(para,[status(thm),theory(equality)],[39,8]),
[iquote('para(39,8)')] ).
cnf(43,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(para,[status(thm),theory(equality)],[40,8]),
[iquote('para(40,8)')] ).
cnf(46,plain,
~ equal(multiply(multiply(b2,inverse(inverse(inverse(b2)))),a2),a2),
inference(para,[status(thm),theory(equality)],[41,2]),
[iquote('para(41,2)')] ).
cnf(48,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[41,7]),43]),
[iquote('para(41,7),demod([43])')] ).
cnf(50,plain,
~ equal(a2,a2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),48,43]),
[iquote('back_demod(46),demod([48,43])')] ).
cnf(51,plain,
$false,
inference(conflict,[status(thm)],[50]),
[iquote('xx_conflict(50)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP514-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n012.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 13:44:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.65/1.05 ----- EQP 0.9e, May 2009 -----
% 0.65/1.05 The job began on n012.cluster.edu, Mon Jun 13 13:44:41 2022
% 0.65/1.05 The command was "./eqp09e".
% 0.65/1.05
% 0.65/1.05 set(prolog_style_variables).
% 0.65/1.05 set(lrpo).
% 0.65/1.05 set(basic_paramod).
% 0.65/1.05 set(functional_subsume).
% 0.65/1.05 set(ordered_paramod).
% 0.65/1.05 set(prime_paramod).
% 0.65/1.05 set(para_pairs).
% 0.65/1.05 assign(pick_given_ratio,4).
% 0.65/1.05 clear(print_kept).
% 0.65/1.05 clear(print_new_demod).
% 0.65/1.05 clear(print_back_demod).
% 0.65/1.05 clear(print_given).
% 0.65/1.05 assign(max_mem,64000).
% 0.65/1.05 end_of_commands.
% 0.65/1.05
% 0.65/1.05 Usable:
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Sos:
% 0.65/1.05 0 (wt=-1) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.65/1.05 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Demodulators:
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Passive:
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Starting to process input.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 1 (wt=12) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.65/1.05 1 is a new demodulator.
% 0.65/1.05
% 0.65/1.05 ** KEPT: 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.65/1.05 ---------------- PROOF FOUND ----------------
% 0.65/1.05 % SZS status Unsatisfiable
% 0.65/1.05
% 0.65/1.05
% 0.65/1.05 After processing input:
% 0.65/1.05
% 0.65/1.05 Usable:
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Sos:
% 0.65/1.05 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.65/1.05 1 (wt=12) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Demodulators:
% 0.65/1.05 1 (wt=12) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 Passive:
% 0.65/1.05 end_of_list.
% 0.65/1.05
% 0.65/1.05 UNIT CONFLICT from 50 and x=x at 0.00 seconds.
% 0.65/1.05
% 0.65/1.05 ---------------- PROOF ----------------
% 0.65/1.05 % SZS output start Refutation
% See solution above
% 0.65/1.05 ------------ end of proof -------------
% 0.65/1.05
% 0.65/1.05
% 0.65/1.05 ------------- memory usage ------------
% 0.65/1.05 Memory dynamically allocated (tp_alloc): 488.
% 0.65/1.05 type (bytes each) gets frees in use avail bytes
% 0.65/1.05 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.65/1.05 term ( 16) 2432 1724 708 19 14.0 K
% 0.65/1.05 gen_ptr ( 8) 3606 322 3284 20 25.8 K
% 0.65/1.05 context ( 808) 2102 2100 2 2 3.2 K
% 0.65/1.05 trail ( 12) 342 342 0 6 0.1 K
% 0.65/1.05 bt_node ( 68) 1593 1590 3 17 1.3 K
% 0.65/1.05 ac_position (285432) 0 0 0 0 0.0 K
% 0.65/1.05 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.65/1.05 ac_match_free_vars_pos (4020)
% 0.65/1.05 0 0 0 0 0.0 K
% 0.65/1.05 discrim ( 12) 609 24 585 9 7.0 K
% 0.65/1.05 flat ( 40) 3349 3349 0 18 0.7 K
% 0.65/1.05 discrim_pos ( 12) 44 44 0 1 0.0 K
% 0.65/1.05 fpa_head ( 12) 396 0 396 0 4.6 K
% 0.65/1.05 fpa_tree ( 28) 165 165 0 15 0.4 K
% 0.65/1.05 fpa_pos ( 36) 84 84 0 1 0.0 K
% 0.65/1.05 literal ( 12) 150 100 50 0 0.6 K
% 0.65/1.05 clause ( 24) 150 100 50 0 1.2 K
% 0.65/1.05 list ( 12) 94 37 57 2 0.7 K
% 0.65/1.05 list_pos ( 20) 193 15 178 3 3.5 K
% 0.65/1.05 pair_index ( 40) 2 0 2 0 0.1 K
% 0.65/1.05
% 0.65/1.05 -------------- statistics -------------
% 0.65/1.05 Clauses input 2
% 0.65/1.05 Usable input 0
% 0.65/1.05 Sos input 2
% 0.65/1.05 Demodulators input 0
% 0.65/1.05 Passive input 0
% 0.65/1.05
% 0.65/1.05 Processed BS (before search) 2
% 0.65/1.05 Forward subsumed BS 0
% 0.65/1.05 Kept BS 2
% 0.65/1.05 New demodulators BS 1
% 0.65/1.05 Back demodulated BS 0
% 0.65/1.05
% 0.65/1.05 Clauses or pairs given 103
% 0.65/1.05 Clauses generated 98
% 0.65/1.05 Forward subsumed 50
% 0.65/1.05 Deleted by weight 0
% 0.65/1.05 Deleted by variable count 0
% 0.65/1.05 Kept 48
% 0.65/1.05 New demodulators 34
% 0.65/1.05 Back demodulated 3
% 0.65/1.05 Ordered paramod prunes 0
% 0.65/1.05 Basic paramod prunes 300
% 0.65/1.05 Prime paramod prunes 3
% 0.65/1.05 Semantic prunes 0
% 0.65/1.05
% 0.65/1.05 Rewrite attmepts 624
% 0.65/1.05 Rewrites 34
% 0.65/1.05
% 0.65/1.05 FPA overloads 0
% 0.65/1.05 FPA underloads 0
% 0.65/1.05
% 0.65/1.05 Usable size 0
% 0.65/1.05 Sos size 46
% 0.65/1.05 Demodulators size 34
% 0.65/1.05 Passive size 0
% 0.65/1.05 Disabled size 3
% 0.65/1.05
% 0.65/1.05 Proofs found 1
% 0.65/1.05
% 0.65/1.05 ----------- times (seconds) ----------- Mon Jun 13 13:44:41 2022
% 0.65/1.05
% 0.65/1.05 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.65/1.05 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.65/1.05 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.65/1.05 input time 0.00
% 0.65/1.05 paramodulation time 0.00
% 0.65/1.05 demodulation time 0.00
% 0.65/1.05 orient time 0.00
% 0.65/1.05 weigh time 0.00
% 0.65/1.05 forward subsume time 0.00
% 0.65/1.05 back demod find time 0.00
% 0.65/1.05 conflict time 0.00
% 0.65/1.05 LRPO time 0.00
% 0.65/1.05 store clause time 0.00
% 0.65/1.05 disable clause time 0.00
% 0.65/1.05 prime paramod time 0.00
% 0.65/1.05 semantics time 0.00
% 0.65/1.05
% 0.65/1.05 EQP interrupted
%------------------------------------------------------------------------------