TSTP Solution File: GRP555-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP555-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n006.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:57 EDT 2022
% Result : Unsatisfiable 0.71s 1.15s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 3 RR)
% Number of literals : 30 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 67 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,inverse(divide(B,divide(A,C)))),C),B),
file('GRP555-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP555-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP555-1.p',unknown),
[] ).
cnf(7,plain,
equal(divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(D,B))),C),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(8,plain,
equal(divide(A,inverse(divide(B,divide(A,divide(C,D))))),divide(divide(C,inverse(B)),D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(10,plain,
equal(divide(multiply(A,divide(B,divide(A,C))),C),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(22,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(para,[status(thm),theory(equality)],[1,7]),
[iquote('para(1,7)')] ).
cnf(23,plain,
equal(multiply(A,divide(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,3]),1]),
[iquote('para(22,3),flip(1)')] ).
cnf(31,plain,
equal(divide(divide(divide(A,inverse(B)),C),divide(A,C)),B),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(32,plain,
equal(divide(divide(multiply(A,B),C),divide(A,C)),B),
inference(para,[status(thm),theory(equality)],[3,31]),
[iquote('para(3,31)')] ).
cnf(34,plain,
equal(divide(divide(A,B),divide(C,B)),divide(A,C)),
inference(para,[status(thm),theory(equality)],[23,32]),
[iquote('para(23,32)')] ).
cnf(35,plain,
equal(divide(multiply(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),34]),
[iquote('back_demod(32),demod([34])')] ).
cnf(36,plain,
equal(divide(divide(A,inverse(B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[31]),34]),
[iquote('back_demod(31),demod([34])')] ).
cnf(38,plain,
equal(divide(A,multiply(inverse(B),A)),B),
inference(para,[status(thm),theory(equality)],[35,36]),
[iquote('para(35,36)')] ).
cnf(46,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[35,10]),
[iquote('para(35,10)')] ).
cnf(50,plain,
equal(divide(divide(A,A),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[46,36]),
[iquote('para(46,36)')] ).
cnf(89,plain,
equal(divide(divide(A,inverse(B)),C),multiply(divide(A,C),B)),
inference(para,[status(thm),theory(equality)],[35,1]),
[iquote('para(35,1)')] ).
cnf(132,plain,
equal(multiply(divide(multiply(inverse(A),B),C),A),divide(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,89]),1]),
[iquote('para(35,89),flip(1)')] ).
cnf(151,plain,
equal(divide(divide(A,B),inverse(B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[50,1]),50]),
[iquote('para(50,1),demod([50])')] ).
cnf(152,plain,
equal(divide(A,inverse(B)),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[35,151]),
[iquote('para(35,151)')] ).
cnf(153,plain,
equal(multiply(A,B),divide(B,inverse(A))),
inference(flip,[status(thm),theory(equality)],[152]),
[iquote('flip(152)')] ).
cnf(155,plain,
equal(multiply(A,multiply(inverse(A),B)),B),
inference(para,[status(thm),theory(equality)],[152,35]),
[iquote('para(152,35)')] ).
cnf(161,plain,
equal(multiply(inverse(A),B),divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[155,35]),1]),
[iquote('para(155,35),flip(1)')] ).
cnf(163,plain,
equal(multiply(divide(divide(A,B),C),B),divide(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[132]),161]),
[iquote('back_demod(132),demod([161])')] ).
cnf(168,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[38]),161]),
[iquote('back_demod(38),demod([161])')] ).
cnf(170,plain,
equal(divide(multiply(A,B),B),A),
inference(para,[status(thm),theory(equality)],[35,168]),
[iquote('para(35,168)')] ).
cnf(495,plain,
equal(multiply(divide(A,B),C),divide(multiply(A,C),B)),
inference(para,[status(thm),theory(equality)],[170,163]),
[iquote('para(170,163)')] ).
cnf(633,plain,
~ equal(divide(multiply(b3,c3),inverse(a3)),multiply(a3,multiply(b3,c3))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[153,4]),495]),
[iquote('para(153,4),demod([495])')] ).
cnf(634,plain,
$false,
inference(conflict,[status(thm)],[633,152]),
[iquote('conflict(633,152)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP555-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n006.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 07:21:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.15 ----- EQP 0.9e, May 2009 -----
% 0.71/1.15 The job began on n006.cluster.edu, Tue Jun 14 07:21:27 2022
% 0.71/1.15 The command was "./eqp09e".
% 0.71/1.15
% 0.71/1.15 set(prolog_style_variables).
% 0.71/1.15 set(lrpo).
% 0.71/1.15 set(basic_paramod).
% 0.71/1.15 set(functional_subsume).
% 0.71/1.15 set(ordered_paramod).
% 0.71/1.15 set(prime_paramod).
% 0.71/1.15 set(para_pairs).
% 0.71/1.15 assign(pick_given_ratio,4).
% 0.71/1.15 clear(print_kept).
% 0.71/1.15 clear(print_new_demod).
% 0.71/1.15 clear(print_back_demod).
% 0.71/1.15 clear(print_given).
% 0.71/1.15 assign(max_mem,64000).
% 0.71/1.15 end_of_commands.
% 0.71/1.15
% 0.71/1.15 Usable:
% 0.71/1.15 end_of_list.
% 0.71/1.15
% 0.71/1.15 Sos:
% 0.71/1.15 0 (wt=-1) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.71/1.15 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.71/1.15 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.71/1.15 end_of_list.
% 0.71/1.15
% 0.71/1.15 Demodulators:
% 0.71/1.15 end_of_list.
% 0.71/1.15
% 0.71/1.15 Passive:
% 0.71/1.15 end_of_list.
% 0.71/1.15
% 0.71/1.15 Starting to process input.
% 0.71/1.15
% 0.71/1.15 ** KEPT: 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.71/1.15 1 is a new demodulator.
% 0.71/1.15
% 0.71/1.15 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.71/1.15
% 0.71/1.15 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.71/1.15 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.71/1.15
% 0.71/1.15 ** KEPT: 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.71/1.15 ---------------- PROOF FOUND ----------------
% 0.71/1.15 % SZS status Unsatisfiable
% 0.71/1.15
% 0.71/1.15
% 0.71/1.15 After processing input:
% 0.71/1.15
% 0.71/1.15 Usable:
% 0.71/1.15 end_of_list.
% 0.71/1.15
% 0.71/1.15 Sos:
% 0.71/1.15 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.71/1.15 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.71/1.15 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.71/1.15 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.71/1.15 end_of_list.
% 0.71/1.15
% 0.71/1.15 Demodulators:
% 0.71/1.15 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.71/1.15 end_of_list.
% 0.71/1.15
% 0.71/1.15 Passive:
% 0.71/1.15 end_of_list.
% 0.71/1.15
% 0.71/1.15 UNIT CONFLICT from 633 and 152 at 0.04 seconds.
% 0.71/1.15
% 0.71/1.15 ---------------- PROOF ----------------
% 0.71/1.15 % SZS output start Refutation
% See solution above
% 0.71/1.15 ------------ end of proof -------------
% 0.71/1.15
% 0.71/1.15
% 0.71/1.15 ------------- memory usage ------------
% 0.71/1.15 Memory dynamically allocated (tp_alloc): 976.
% 0.71/1.15 type (bytes each) gets frees in use avail bytes
% 0.71/1.15 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.71/1.15 term ( 16) 36829 26876 9953 18 192.3 K
% 0.71/1.15 gen_ptr ( 8) 51618 12182 39436 29 308.3 K
% 0.71/1.15 context ( 808) 25538 25536 2 4 4.7 K
% 0.71/1.15 trail ( 12) 5216 5216 0 7 0.1 K
% 0.71/1.15 bt_node ( 68) 8690 8687 3 12 1.0 K
% 0.71/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.15 ac_match_free_vars_pos (4020)
% 0.71/1.15 0 0 0 0 0.0 K
% 0.71/1.15 discrim ( 12) 6454 3507 2947 9 34.6 K
% 0.71/1.15 flat ( 40) 74592 74592 0 32 1.2 K
% 0.71/1.15 discrim_pos ( 12) 1809 1809 0 1 0.0 K
% 0.71/1.15 fpa_head ( 12) 2406 0 2406 0 28.2 K
% 0.71/1.15 fpa_tree ( 28) 1038 1038 0 29 0.8 K
% 0.71/1.15 fpa_pos ( 36) 871 871 0 1 0.0 K
% 0.71/1.15 literal ( 12) 2813 2180 633 1 7.4 K
% 0.71/1.15 clause ( 24) 2813 2180 633 1 14.9 K
% 0.71/1.15 list ( 12) 297 241 56 3 0.7 K
% 0.71/1.15 list_pos ( 20) 2705 1276 1429 4 28.0 K
% 0.71/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.15
% 0.71/1.15 -------------- statistics -------------
% 0.71/1.15 Clauses input 3
% 0.71/1.15 Usable input 0
% 0.71/1.15 Sos input 3
% 0.71/1.15 Demodulators input 0
% 0.71/1.15 Passive input 0
% 0.71/1.15
% 0.71/1.15 Processed BS (before search) 5
% 0.71/1.15 Forward subsumed BS 1
% 0.71/1.15 Kept BS 4
% 0.71/1.15 New demodulators BS 1
% 0.71/1.15 Back demodulated BS 0
% 0.71/1.15
% 0.71/1.15 Clauses or pairs given 2565
% 0.71/1.15 Clauses generated 1658
% 0.71/1.15 Forward subsumed 1029
% 0.71/1.15 Deleted by weight 0
% 0.71/1.15 Deleted by variable count 0
% 0.71/1.15 Kept 629
% 0.71/1.15 New demodulators 237
% 0.71/1.15 Back demodulated 284
% 0.71/1.15 Ordered paramod prunes 0
% 0.71/1.15 Basic paramod prunes 7329
% 0.71/1.15 Prime paramod prunes 96
% 0.71/1.15 Semantic prunes 0
% 0.71/1.15
% 0.71/1.15 Rewrite attmepts 12534
% 0.71/1.15 Rewrites 1197
% 0.71/1.15
% 0.71/1.15 FPA overloads 0
% 0.71/1.15 FPA underloads 0
% 0.71/1.15
% 0.71/1.15 Usable size 0
% 0.71/1.15 Sos size 348
% 0.71/1.15 Demodulators size 101
% 0.71/1.15 Passive size 0
% 0.71/1.15 Disabled size 284
% 0.71/1.15
% 0.71/1.15 Proofs found 1
% 0.71/1.15
% 0.71/1.15 ----------- times (seconds) ----------- Tue Jun 14 07:21:27 2022
% 0.71/1.15
% 0.71/1.15 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.71/1.15 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.71/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.15 input time 0.00
% 0.71/1.15 paramodulation time 0.01
% 0.71/1.15 demodulation time 0.01
% 0.71/1.15 orient time 0.01
% 0.71/1.15 weigh time 0.00
% 0.71/1.15 forward subsume time 0.00
% 0.71/1.15 back demod find time 0.00
% 0.71/1.15 conflict time 0.00
% 0.71/1.15 LRPO time 0.00
% 0.71/1.15 store clause time 0.01
% 0.71/1.15 disable clause time 0.00
% 0.71/1.15 prime paramod time 0.00
% 0.71/1.15 semantics time 0.00
% 0.71/1.15
% 0.71/1.15 EQP interrupted
%------------------------------------------------------------------------------