TSTP Solution File: GRP527-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP527-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n015.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:49 EDT 2022
% Result : Unsatisfiable 0.70s 1.20s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 3 RR)
% Number of literals : 38 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 90 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,divide(divide(A,B),divide(C,B))),C),
file('GRP527-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP527-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,divide(divide(B,B),C)),multiply(A,C)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
equal(inverse(A),divide(divide(B,B),A)),
file('GRP527-1.p',unknown),
[] ).
cnf(5,plain,
equal(divide(divide(A,A),B),inverse(B)),
inference(flip,[status(thm),theory(equality)],[4]),
[iquote('flip(4)')] ).
cnf(6,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP527-1.p',unknown),
[] ).
cnf(7,plain,
equal(divide(divide(A,A),B),divide(divide(C,C),B)),
inference(para,[status(thm),theory(equality)],[4,4]),
[iquote('para(4,4)')] ).
cnf(14,plain,
equal(divide(divide(A,divide(B,C)),C),divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(30,plain,
equal(divide(A,divide(multiply(A,B),divide(C,divide(divide(D,D),B)))),C),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(32,plain,
equal(divide(A,multiply(divide(A,B),B)),divide(C,C)),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(33,plain,
equal(divide(A,A),divide(B,multiply(divide(B,C),C))),
inference(flip,[status(thm),theory(equality)],[32]),
[iquote('flip(32)')] ).
cnf(48,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(54,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(55,plain,
equal(multiply(A,B),divide(A,inverse(B))),
inference(flip,[status(thm),theory(equality)],[54]),
[iquote('flip(54)')] ).
cnf(73,plain,
equal(divide(A,A),divide(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,1]),1]),
[iquote('para(7,1),demod([1])')] ).
cnf(74,plain,
equal(divide(A,A),inverse(divide(B,B))),
inference(para,[status(thm),theory(equality)],[73,5]),
[iquote('para(73,5)')] ).
cnf(75,plain,
equal(inverse(divide(A,A)),divide(B,B)),
inference(flip,[status(thm),theory(equality)],[74]),
[iquote('flip(74)')] ).
cnf(88,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[75,48]),
[iquote('para(75,48)')] ).
cnf(142,plain,
equal(divide(A,divide(divide(A,B),divide(C,D))),divide(C,divide(D,B))),
inference(para,[status(thm),theory(equality)],[14,1]),
[iquote('para(14,1)')] ).
cnf(143,plain,
equal(divide(A,divide(B,C)),divide(D,divide(divide(D,C),divide(A,B)))),
inference(flip,[status(thm),theory(equality)],[142]),
[iquote('flip(142)')] ).
cnf(147,plain,
equal(divide(divide(A,B),A),inverse(B)),
inference(para,[status(thm),theory(equality)],[14,5]),
[iquote('para(14,5)')] ).
cnf(183,plain,
equal(divide(multiply(A,B),B),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,30]),88]),1]),
[iquote('para(1,30),demod([88]),flip(1)')] ).
cnf(215,plain,
equal(divide(A,divide(A,multiply(divide(B,C),C))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,1]),88]),
[iquote('para(32,1),demod([88])')] ).
cnf(227,plain,
equal(divide(A,divide(divide(A,B),divide(C,multiply(divide(C,D),D)))),B),
inference(para,[status(thm),theory(equality)],[33,1]),
[iquote('para(33,1)')] ).
cnf(228,plain,
equal(divide(A,divide(B,multiply(divide(B,C),C))),A),
inference(para,[status(thm),theory(equality)],[33,1]),
[iquote('para(33,1)')] ).
cnf(229,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[227]),228]),
[iquote('back_demod(227),demod([228])')] ).
cnf(230,plain,
equal(multiply(divide(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[215]),229]),
[iquote('back_demod(215),demod([229])')] ).
cnf(231,plain,
equal(divide(multiply(A,B),A),B),
inference(para,[status(thm),theory(equality)],[183,229]),
[iquote('para(183,229)')] ).
cnf(233,plain,
equal(multiply(A,B),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[231,230]),
[iquote('para(231,230)')] ).
cnf(235,plain,
equal(inverse(divide(A,B)),divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[48,229]),1]),
[iquote('para(48,229),flip(1)')] ).
cnf(239,plain,
equal(divide(A,multiply(A,B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[54,229]),
[iquote('para(54,229)')] ).
cnf(243,plain,
equal(multiply(inverse(A),B),divide(B,A)),
inference(para,[status(thm),theory(equality)],[147,230]),
[iquote('para(147,230)')] ).
cnf(246,plain,
equal(divide(A,multiply(B,A)),inverse(B)),
inference(para,[status(thm),theory(equality)],[233,239]),
[iquote('para(233,239)')] ).
cnf(289,plain,
equal(multiply(divide(A,B),C),divide(C,divide(B,A))),
inference(para,[status(thm),theory(equality)],[235,243]),
[iquote('para(235,243)')] ).
cnf(299,plain,
~ equal(divide(c3,divide(inverse(b3),a3)),multiply(a3,multiply(b3,c3))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[55,6]),289]),
[iquote('para(55,6),demod([289])')] ).
cnf(492,plain,
equal(divide(A,divide(divide(A,B),C)),multiply(C,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[143,3]),88]),
[iquote('para(143,3),demod([88])')] ).
cnf(982,plain,
equal(divide(A,divide(inverse(B),C)),multiply(C,multiply(B,A))),
inference(para,[status(thm),theory(equality)],[246,492]),
[iquote('para(246,492)')] ).
cnf(983,plain,
$false,
inference(conflict,[status(thm)],[982,299]),
[iquote('conflict(982,299)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP527-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n015.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 11:47:24 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.70/1.20 ----- EQP 0.9e, May 2009 -----
% 0.70/1.20 The job began on n015.cluster.edu, Tue Jun 14 11:47:24 2022
% 0.70/1.20 The command was "./eqp09e".
% 0.70/1.20
% 0.70/1.20 set(prolog_style_variables).
% 0.70/1.20 set(lrpo).
% 0.70/1.20 set(basic_paramod).
% 0.70/1.20 set(functional_subsume).
% 0.70/1.20 set(ordered_paramod).
% 0.70/1.20 set(prime_paramod).
% 0.70/1.20 set(para_pairs).
% 0.70/1.20 assign(pick_given_ratio,4).
% 0.70/1.20 clear(print_kept).
% 0.70/1.20 clear(print_new_demod).
% 0.70/1.20 clear(print_back_demod).
% 0.70/1.20 clear(print_given).
% 0.70/1.20 assign(max_mem,64000).
% 0.70/1.20 end_of_commands.
% 0.70/1.20
% 0.70/1.20 Usable:
% 0.70/1.20 end_of_list.
% 0.70/1.20
% 0.70/1.20 Sos:
% 0.70/1.20 0 (wt=-1) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.70/1.20 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.70/1.20 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.70/1.20 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.70/1.20 end_of_list.
% 0.70/1.20
% 0.70/1.20 Demodulators:
% 0.70/1.20 end_of_list.
% 0.70/1.20
% 0.70/1.20 Passive:
% 0.70/1.20 end_of_list.
% 0.70/1.20
% 0.70/1.20 Starting to process input.
% 0.70/1.20
% 0.70/1.20 ** KEPT: 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.70/1.20 1 is a new demodulator.
% 0.70/1.20
% 0.70/1.20 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.70/1.20
% 0.70/1.20 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.70/1.20 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.70/1.20
% 0.70/1.20 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.70/1.20
% 0.70/1.20 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.70/1.20 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.70/1.20
% 0.70/1.20 ** KEPT: 6 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.70/1.20 ---------------- PROOF FOUND ----------------
% 0.70/1.20 % SZS status Unsatisfiable
% 0.70/1.20
% 0.70/1.20
% 0.70/1.20 After processing input:
% 0.70/1.20
% 0.70/1.20 Usable:
% 0.70/1.20 end_of_list.
% 0.70/1.20
% 0.70/1.20 Sos:
% 0.70/1.20 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.70/1.20 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.70/1.20 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.70/1.20 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.70/1.20 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.70/1.20 6 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.70/1.20 end_of_list.
% 0.70/1.20
% 0.70/1.20 Demodulators:
% 0.70/1.20 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.70/1.20 end_of_list.
% 0.70/1.20
% 0.70/1.20 Passive:
% 0.70/1.20 end_of_list.
% 0.70/1.20
% 0.70/1.20 UNIT CONFLICT from 982 and 299 at 0.05 seconds.
% 0.70/1.20
% 0.70/1.20 ---------------- PROOF ----------------
% 0.70/1.20 % SZS output start Refutation
% See solution above
% 0.70/1.20 ------------ end of proof -------------
% 0.70/1.20
% 0.70/1.20
% 0.70/1.20 ------------- memory usage ------------
% 0.70/1.20 Memory dynamically allocated (tp_alloc): 1464.
% 0.70/1.20 type (bytes each) gets frees in use avail bytes
% 0.70/1.20 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.70/1.20 term ( 16) 67458 52520 14938 17 288.2 K
% 0.70/1.20 gen_ptr ( 8) 72457 16482 55975 37 437.6 K
% 0.70/1.20 context ( 808) 45350 45348 2 4 4.7 K
% 0.70/1.20 trail ( 12) 5045 5045 0 7 0.1 K
% 0.70/1.20 bt_node ( 68) 17274 17271 3 14 1.1 K
% 0.70/1.20 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.20 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.20 ac_match_free_vars_pos (4020)
% 0.70/1.20 0 0 0 0 0.0 K
% 0.70/1.20 discrim ( 12) 9128 2914 6214 0 72.8 K
% 0.70/1.20 flat ( 40) 130166 130166 0 27 1.1 K
% 0.70/1.20 discrim_pos ( 12) 3505 3505 0 1 0.0 K
% 0.70/1.20 fpa_head ( 12) 1747 0 1747 0 20.5 K
% 0.70/1.20 fpa_tree ( 28) 2088 2088 0 23 0.6 K
% 0.70/1.20 fpa_pos ( 36) 1333 1333 0 1 0.0 K
% 0.70/1.20 literal ( 12) 5070 4088 982 1 11.5 K
% 0.70/1.20 clause ( 24) 5070 4088 982 1 23.0 K
% 0.70/1.20 list ( 12) 410 354 56 4 0.7 K
% 0.70/1.20 list_pos ( 20) 3880 1313 2567 0 50.1 K
% 0.70/1.20 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.20
% 0.70/1.20 -------------- statistics -------------
% 0.70/1.20 Clauses input 4
% 0.70/1.20 Usable input 0
% 0.70/1.20 Sos input 4
% 0.70/1.20 Demodulators input 0
% 0.70/1.20 Passive input 0
% 0.70/1.20
% 0.70/1.20 Processed BS (before search) 8
% 0.70/1.20 Forward subsumed BS 2
% 0.70/1.20 Kept BS 6
% 0.70/1.20 New demodulators BS 1
% 0.70/1.20 Back demodulated BS 0
% 0.70/1.20
% 0.70/1.20 Clauses or pairs given 3582
% 0.70/1.20 Clauses generated 2988
% 0.70/1.20 Forward subsumed 2012
% 0.70/1.20 Deleted by weight 0
% 0.70/1.20 Deleted by variable count 0
% 0.70/1.20 Kept 976
% 0.70/1.20 New demodulators 350
% 0.70/1.20 Back demodulated 287
% 0.70/1.20 Ordered paramod prunes 0
% 0.70/1.20 Basic paramod prunes 6531
% 0.70/1.20 Prime paramod prunes 264
% 0.70/1.20 Semantic prunes 0
% 0.70/1.20
% 0.70/1.20 Rewrite attmepts 20528
% 0.70/1.20 Rewrites 2167
% 0.70/1.20
% 0.70/1.20 FPA overloads 0
% 0.70/1.20 FPA underloads 0
% 0.70/1.20
% 0.70/1.20 Usable size 0
% 0.70/1.20 Sos size 694
% 0.70/1.20 Demodulators size 198
% 0.70/1.20 Passive size 0
% 0.70/1.20 Disabled size 287
% 0.70/1.20
% 0.70/1.20 Proofs found 1
% 0.70/1.20
% 0.70/1.20 ----------- times (seconds) ----------- Tue Jun 14 11:47:24 2022
% 0.70/1.20
% 0.70/1.20 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.70/1.20 system CPU time 0.08 (0 hr, 0 min, 0 sec)
% 0.70/1.20 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.20 input time 0.00
% 0.70/1.20 paramodulation time 0.01
% 0.70/1.20 demodulation time 0.01
% 0.70/1.20 orient time 0.01
% 0.70/1.20 weigh time 0.00
% 0.70/1.20 forward subsume time 0.00
% 0.70/1.20 back demod find time 0.00
% 0.70/1.20 conflict time 0.00
% 0.70/1.20 LRPO time 0.00
% 0.70/1.20 store clause time 0.01
% 0.70/1.20 disable clause time 0.00
% 0.70/1.20 prime paramod time 0.01
% 0.70/1.20 semantics time 0.00
% 0.70/1.20
% 0.70/1.20 EQP interrupted
%------------------------------------------------------------------------------