TSTP Solution File: GRP421-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP421-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n013.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:45 EDT 2022
% Result : Unsatisfiable 0.68s 1.17s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 3 RR)
% Number of literals : 14 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),multiply(inverse(C),inverse(multiply(inverse(C),C))))))),multiply(A,C))),B),
file('GRP421-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(inverse(multiply(inverse(multiply(A,inverse(multiply(B,multiply(inverse(C),inverse(multiply(inverse(C),C))))))),multiply(A,C))),multiply(inverse(multiply(D,inverse(multiply(inverse(B),multiply(inverse(E),inverse(multiply(inverse(E),E))))))),multiply(D,E))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(6,plain,
equal(inverse(multiply(inverse(multiply(A,B)),multiply(A,C))),multiply(inverse(C),inverse(multiply(inverse(B),multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C))))))))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(multiply(inverse(A),inverse(multiply(inverse(B),multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A)))))))),inverse(multiply(inverse(multiply(C,B)),multiply(C,A)))),
inference(flip,[status(thm),theory(equality)],[6]),
[iquote('flip(6)')] ).
cnf(14,plain,
equal(multiply(inverse(multiply(A,inverse(multiply(inverse(inverse(B)),multiply(inverse(C),inverse(multiply(inverse(C),C))))))),multiply(A,C)),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(77,plain,
equal(inverse(multiply(inverse(inverse(multiply(inverse(multiply(A,B)),multiply(A,C)))),multiply(inverse(C),inverse(multiply(inverse(C),C))))),B),
inference(para,[status(thm),theory(equality)],[7,1]),
[iquote('para(7,1)')] ).
cnf(82,plain,
equal(inverse(multiply(inverse(multiply(A,B)),multiply(A,C))),inverse(multiply(inverse(multiply(D,B)),multiply(D,C)))),
inference(para,[status(thm),theory(equality)],[77,1]),
[iquote('para(77,1)')] ).
cnf(90,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,C)),multiply(inverse(multiply(D,B)),multiply(D,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[82,1]),1]),
[iquote('para(82,1),demod([1])')] ).
cnf(99,plain,
equal(multiply(A,multiply(inverse(multiply(B,inverse(multiply(inverse(A),multiply(inverse(C),inverse(multiply(inverse(C),C))))))),D)),multiply(inverse(multiply(E,multiply(B,C))),multiply(E,D))),
inference(para,[status(thm),theory(equality)],[1,90]),
[iquote('para(1,90)')] ).
cnf(457,plain,
equal(multiply(inverse(A),A),multiply(inverse(multiply(B,multiply(C,D))),multiply(B,multiply(C,D)))),
inference(para,[status(thm),theory(equality)],[14,99]),
[iquote('para(14,99)')] ).
cnf(458,plain,
equal(multiply(inverse(multiply(A,multiply(B,C))),multiply(A,multiply(B,C))),multiply(inverse(D),D)),
inference(flip,[status(thm),theory(equality)],[457]),
[iquote('flip(457)')] ).
cnf(459,plain,
~ equal(multiply(inverse(multiply(A,multiply(B,C))),multiply(A,multiply(B,C))),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[457,2]),
[iquote('para(457,2)')] ).
cnf(460,plain,
$false,
inference(conflict,[status(thm)],[459,458]),
[iquote('conflict(459,458)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : GRP421-1 : TPTP v8.1.0. Released v2.6.0.
% 0.09/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n013.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 : Tue Jun 14 09:37:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.68/1.17 ----- EQP 0.9e, May 2009 -----
% 0.68/1.17 The job began on n013.cluster.edu, Tue Jun 14 09:37:14 2022
% 0.68/1.17 The command was "./eqp09e".
% 0.68/1.17
% 0.68/1.17 set(prolog_style_variables).
% 0.68/1.17 set(lrpo).
% 0.68/1.17 set(basic_paramod).
% 0.68/1.17 set(functional_subsume).
% 0.68/1.17 set(ordered_paramod).
% 0.68/1.17 set(prime_paramod).
% 0.68/1.17 set(para_pairs).
% 0.68/1.17 assign(pick_given_ratio,4).
% 0.68/1.17 clear(print_kept).
% 0.68/1.17 clear(print_new_demod).
% 0.68/1.17 clear(print_back_demod).
% 0.68/1.17 clear(print_given).
% 0.68/1.17 assign(max_mem,64000).
% 0.68/1.17 end_of_commands.
% 0.68/1.17
% 0.68/1.17 Usable:
% 0.68/1.17 end_of_list.
% 0.68/1.17
% 0.68/1.17 Sos:
% 0.68/1.17 0 (wt=-1) [] inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),multiply(inverse(C),inverse(multiply(inverse(C),C))))))),multiply(A,C))) = B.
% 0.68/1.17 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.68/1.17 end_of_list.
% 0.68/1.17
% 0.68/1.17 Demodulators:
% 0.68/1.17 end_of_list.
% 0.68/1.17
% 0.68/1.17 Passive:
% 0.68/1.17 end_of_list.
% 0.68/1.17
% 0.68/1.17 Starting to process input.
% 0.68/1.17
% 0.68/1.17 ** KEPT: 1 (wt=22) [] inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),multiply(inverse(C),inverse(multiply(inverse(C),C))))))),multiply(A,C))) = B.
% 0.68/1.17 1 is a new demodulator.
% 0.68/1.17
% 0.68/1.17 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.68/1.17 ---------------- PROOF FOUND ----------------
% 0.68/1.17 % SZS status Unsatisfiable
% 0.68/1.17
% 0.68/1.17
% 0.68/1.17 After processing input:
% 0.68/1.17
% 0.68/1.17 Usable:
% 0.68/1.17 end_of_list.
% 0.68/1.17
% 0.68/1.17 Sos:
% 0.68/1.17 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.68/1.17 1 (wt=22) [] inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),multiply(inverse(C),inverse(multiply(inverse(C),C))))))),multiply(A,C))) = B.
% 0.68/1.17 end_of_list.
% 0.68/1.17
% 0.68/1.17 Demodulators:
% 0.68/1.17 1 (wt=22) [] inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),multiply(inverse(C),inverse(multiply(inverse(C),C))))))),multiply(A,C))) = B.
% 0.68/1.17 end_of_list.
% 0.68/1.17
% 0.68/1.17 Passive:
% 0.68/1.17 end_of_list.
% 0.68/1.17
% 0.68/1.17 UNIT CONFLICT from 459 and 458 at 0.10 seconds.
% 0.68/1.17
% 0.68/1.17 ---------------- PROOF ----------------
% 0.68/1.17 % SZS output start Refutation
% See solution above
% 0.68/1.17 ------------ end of proof -------------
% 0.68/1.17
% 0.68/1.17
% 0.68/1.17 ------------- memory usage ------------
% 0.68/1.17 Memory dynamically allocated (tp_alloc): 3906.
% 0.68/1.17 type (bytes each) gets frees in use avail bytes
% 0.68/1.17 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.68/1.17 term ( 16) 90284 50293 39991 41 780.1 K
% 0.68/1.17 gen_ptr ( 8) 299959 2433 297526 13 2324.5 K
% 0.68/1.17 context ( 808) 62759 62757 2 2 3.2 K
% 0.68/1.17 trail ( 12) 1214 1214 0 11 0.1 K
% 0.68/1.17 bt_node ( 68) 7686 7682 4 84 5.8 K
% 0.68/1.17 ac_position (285432) 0 0 0 0 0.0 K
% 0.68/1.17 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.68/1.17 ac_match_free_vars_pos (4020)
% 0.68/1.17 0 0 0 0 0.0 K
% 0.68/1.17 discrim ( 12) 35638 335 35303 0 413.7 K
% 0.68/1.17 flat ( 40) 325630 325630 0 357 13.9 K
% 0.68/1.17 discrim_pos ( 12) 535 535 0 1 0.0 K
% 0.68/1.17 fpa_head ( 12) 2902 0 2902 0 34.0 K
% 0.68/1.17 fpa_tree ( 28) 1214 1214 0 25 0.7 K
% 0.68/1.17 fpa_pos ( 36) 576 576 0 1 0.0 K
% 0.68/1.17 literal ( 12) 1743 1284 459 1 5.4 K
% 0.68/1.17 clause ( 24) 1743 1284 459 1 10.8 K
% 0.68/1.17 list ( 12) 176 120 56 3 0.7 K
% 0.68/1.17 list_pos ( 20) 1513 50 1463 0 28.6 K
% 0.68/1.17 pair_index ( 40) 2 0 2 0 0.1 K
% 0.68/1.17
% 0.68/1.17 -------------- statistics -------------
% 0.68/1.17 Clauses input 2
% 0.68/1.17 Usable input 0
% 0.68/1.17 Sos input 2
% 0.68/1.17 Demodulators input 0
% 0.68/1.17 Passive input 0
% 0.68/1.17
% 0.68/1.17 Processed BS (before search) 2
% 0.68/1.17 Forward subsumed BS 0
% 0.68/1.17 Kept BS 2
% 0.68/1.17 New demodulators BS 1
% 0.68/1.17 Back demodulated BS 0
% 0.68/1.17
% 0.68/1.17 Clauses or pairs given 369
% 0.68/1.17 Clauses generated 895
% 0.68/1.17 Forward subsumed 438
% 0.68/1.17 Deleted by weight 0
% 0.68/1.17 Deleted by variable count 0
% 0.68/1.17 Kept 457
% 0.68/1.17 New demodulators 116
% 0.68/1.17 Back demodulated 10
% 0.68/1.17 Ordered paramod prunes 0
% 0.68/1.17 Basic paramod prunes 3324
% 0.68/1.17 Prime paramod prunes 0
% 0.68/1.17 Semantic prunes 0
% 0.68/1.17
% 0.68/1.17 Rewrite attmepts 46803
% 0.68/1.17 Rewrites 207
% 0.68/1.17
% 0.68/1.17 FPA overloads 0
% 0.68/1.17 FPA underloads 0
% 0.68/1.17
% 0.68/1.17 Usable size 0
% 0.68/1.17 Sos size 448
% 0.68/1.17 Demodulators size 109
% 0.68/1.17 Passive size 0
% 0.68/1.17 Disabled size 10
% 0.68/1.17
% 0.68/1.17 Proofs found 1
% 0.68/1.17
% 0.68/1.17 ----------- times (seconds) ----------- Tue Jun 14 09:37:14 2022
% 0.68/1.17
% 0.68/1.17 user CPU time 0.10 (0 hr, 0 min, 0 sec)
% 0.68/1.17 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.68/1.17 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.68/1.17 input time 0.00
% 0.68/1.17 paramodulation time 0.01
% 0.68/1.17 demodulation time 0.02
% 0.68/1.17 orient time 0.01
% 0.68/1.17 weigh time 0.00
% 0.68/1.17 forward subsume time 0.00
% 0.68/1.17 back demod find time 0.00
% 0.68/1.17 conflict time 0.00
% 0.68/1.17 LRPO time 0.01
% 0.68/1.17 store clause time 0.04
% 0.68/1.17 disable clause time 0.00
% 0.68/1.17 prime paramod time 0.01
% 0.68/1.17 semantics time 0.00
% 0.68/1.17
% 0.68/1.17 EQP interrupted
%------------------------------------------------------------------------------