TSTP Solution File: GRP516-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP516-1 : TPTP v8.1.0. Bugfixed v2.7.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:47:46 EDT 2022
% Result : Unsatisfiable 0.48s 1.12s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% 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('GRP516-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(b,a),multiply(a,b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
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(34,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(35,plain,
equal(multiply(A,multiply(multiply(B,inverse(multiply(B,C))),C)),A),
inference(para,[status(thm),theory(equality)],[34,7]),
[iquote('para(34,7)')] ).
cnf(37,plain,
equal(multiply(A,inverse(multiply(A,inverse(B)))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,8]),1]),
[iquote('para(35,8),flip(1)')] ).
cnf(38,plain,
equal(multiply(multiply(A,inverse(B)),B),A),
inference(para,[status(thm),theory(equality)],[37,8]),
[iquote('para(37,8)')] ).
cnf(39,plain,
equal(multiply(A,inverse(multiply(B,inverse(B)))),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[38,7]),1]),
[iquote('para(38,7),flip(1)')] ).
cnf(40,plain,
equal(multiply(A,B),multiply(B,inverse(inverse(A)))),
inference(para,[status(thm),theory(equality)],[38,8]),
[iquote('para(38,8)')] ).
cnf(42,plain,
~ equal(multiply(a,inverse(inverse(b))),multiply(a,b)),
inference(para,[status(thm),theory(equality)],[40,2]),
[iquote('para(40,2)')] ).
cnf(43,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(para,[status(thm),theory(equality)],[39,8]),
[iquote('para(39,8)')] ).
cnf(46,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,7]),43]),
[iquote('para(40,7),demod([43])')] ).
cnf(47,plain,
~ equal(multiply(a,b),multiply(a,b)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[42]),46]),
[iquote('back_demod(42),demod([46])')] ).
cnf(48,plain,
$false,
inference(conflict,[status(thm)],[47]),
[iquote('xx_conflict(47)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP516-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 13:08:12 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.48/1.12 ----- EQP 0.9e, May 2009 -----
% 0.48/1.12 The job began on n018.cluster.edu, Mon Jun 13 13:08:13 2022
% 0.48/1.12 The command was "./eqp09e".
% 0.48/1.12
% 0.48/1.12 set(prolog_style_variables).
% 0.48/1.12 set(lrpo).
% 0.48/1.12 set(basic_paramod).
% 0.48/1.12 set(functional_subsume).
% 0.48/1.12 set(ordered_paramod).
% 0.48/1.12 set(prime_paramod).
% 0.48/1.12 set(para_pairs).
% 0.48/1.12 assign(pick_given_ratio,4).
% 0.48/1.12 clear(print_kept).
% 0.48/1.12 clear(print_new_demod).
% 0.48/1.12 clear(print_back_demod).
% 0.48/1.12 clear(print_given).
% 0.48/1.12 assign(max_mem,64000).
% 0.48/1.12 end_of_commands.
% 0.48/1.12
% 0.48/1.12 Usable:
% 0.48/1.12 end_of_list.
% 0.48/1.12
% 0.48/1.12 Sos:
% 0.48/1.12 0 (wt=-1) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.48/1.12 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.48/1.12 end_of_list.
% 0.48/1.12
% 0.48/1.12 Demodulators:
% 0.48/1.12 end_of_list.
% 0.48/1.12
% 0.48/1.12 Passive:
% 0.48/1.12 end_of_list.
% 0.48/1.12
% 0.48/1.12 Starting to process input.
% 0.48/1.12
% 0.48/1.12 ** KEPT: 1 (wt=12) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.48/1.12 1 is a new demodulator.
% 0.48/1.12
% 0.48/1.12 ** KEPT: 2 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.48/1.12 ---------------- PROOF FOUND ----------------
% 0.48/1.12 % SZS status Unsatisfiable
% 0.48/1.12
% 0.48/1.12
% 0.48/1.12 After processing input:
% 0.48/1.12
% 0.48/1.12 Usable:
% 0.48/1.12 end_of_list.
% 0.48/1.12
% 0.48/1.12 Sos:
% 0.48/1.12 2 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.48/1.12 1 (wt=12) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.48/1.12 end_of_list.
% 0.48/1.12
% 0.48/1.12 Demodulators:
% 0.48/1.12 1 (wt=12) [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B.
% 0.48/1.12 end_of_list.
% 0.48/1.12
% 0.48/1.12 Passive:
% 0.48/1.12 end_of_list.
% 0.48/1.12
% 0.48/1.12 UNIT CONFLICT from 47 and x=x at 0.00 seconds.
% 0.48/1.12
% 0.48/1.12 ---------------- PROOF ----------------
% 0.48/1.12 % SZS output start Refutation
% See solution above
% 0.48/1.12 ------------ end of proof -------------
% 0.48/1.12
% 0.48/1.12
% 0.48/1.12 ------------- memory usage ------------
% 0.48/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.48/1.12 type (bytes each) gets frees in use avail bytes
% 0.48/1.12 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.48/1.12 term ( 16) 2364 1686 678 19 13.4 K
% 0.48/1.12 gen_ptr ( 8) 3459 332 3127 20 24.6 K
% 0.48/1.12 context ( 808) 1915 1913 2 2 3.2 K
% 0.48/1.12 trail ( 12) 341 341 0 6 0.1 K
% 0.48/1.12 bt_node ( 68) 1493 1490 3 17 1.3 K
% 0.48/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.48/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.48/1.12 ac_match_free_vars_pos (4020)
% 0.48/1.12 0 0 0 0 0.0 K
% 0.48/1.12 discrim ( 12) 584 26 558 17 6.7 K
% 0.48/1.12 flat ( 40) 3219 3219 0 18 0.7 K
% 0.48/1.12 discrim_pos ( 12) 43 43 0 1 0.0 K
% 0.48/1.12 fpa_head ( 12) 343 0 343 0 4.0 K
% 0.48/1.12 fpa_tree ( 28) 129 129 0 15 0.4 K
% 0.48/1.12 fpa_pos ( 36) 81 81 0 1 0.0 K
% 0.48/1.12 literal ( 12) 147 100 47 0 0.6 K
% 0.48/1.12 clause ( 24) 147 100 47 0 1.1 K
% 0.48/1.12 list ( 12) 94 37 57 2 0.7 K
% 0.48/1.12 list_pos ( 20) 183 16 167 7 3.4 K
% 0.48/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.48/1.12
% 0.48/1.12 -------------- statistics -------------
% 0.48/1.12 Clauses input 2
% 0.48/1.12 Usable input 0
% 0.48/1.12 Sos input 2
% 0.48/1.12 Demodulators input 0
% 0.48/1.12 Passive input 0
% 0.48/1.12
% 0.48/1.12 Processed BS (before search) 2
% 0.48/1.12 Forward subsumed BS 0
% 0.48/1.12 Kept BS 2
% 0.48/1.12 New demodulators BS 1
% 0.48/1.12 Back demodulated BS 0
% 0.48/1.12
% 0.48/1.12 Clauses or pairs given 107
% 0.48/1.12 Clauses generated 95
% 0.48/1.12 Forward subsumed 50
% 0.48/1.12 Deleted by weight 0
% 0.48/1.12 Deleted by variable count 0
% 0.48/1.12 Kept 45
% 0.48/1.12 New demodulators 34
% 0.48/1.12 Back demodulated 3
% 0.48/1.12 Ordered paramod prunes 0
% 0.48/1.12 Basic paramod prunes 293
% 0.48/1.12 Prime paramod prunes 3
% 0.48/1.12 Semantic prunes 0
% 0.48/1.12
% 0.48/1.12 Rewrite attmepts 587
% 0.48/1.12 Rewrites 34
% 0.48/1.12
% 0.48/1.12 FPA overloads 0
% 0.48/1.12 FPA underloads 0
% 0.48/1.12
% 0.48/1.12 Usable size 0
% 0.48/1.12 Sos size 43
% 0.48/1.12 Demodulators size 33
% 0.48/1.12 Passive size 0
% 0.48/1.12 Disabled size 3
% 0.48/1.12
% 0.48/1.12 Proofs found 1
% 0.48/1.12
% 0.48/1.12 ----------- times (seconds) ----------- Mon Jun 13 13:08:13 2022
% 0.48/1.12
% 0.48/1.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.48/1.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.48/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.48/1.12 input time 0.00
% 0.48/1.12 paramodulation time 0.00
% 0.48/1.12 demodulation time 0.00
% 0.48/1.12 orient time 0.00
% 0.48/1.12 weigh time 0.00
% 0.48/1.12 forward subsume time 0.00
% 0.48/1.12 back demod find time 0.00
% 0.48/1.12 conflict time 0.00
% 0.48/1.12 LRPO time 0.00
% 0.48/1.12 store clause time 0.00
% 0.48/1.12 disable clause time 0.00
% 0.48/1.12 prime paramod time 0.00
% 0.48/1.12 semantics time 0.00
% 0.48/1.12
% 0.48/1.12 EQP interrupted
%------------------------------------------------------------------------------