TSTP Solution File: GRP560-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP560-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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:58 EDT 2022
% Result : Unsatisfiable 0.71s 1.11s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 2
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 4 RR)
% Number of literals : 39 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,inverse(divide(divide(B,C),divide(A,C)))),B),
file('GRP560-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP560-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(b,a),multiply(a,b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
~ equal(divide(b,inverse(a)),multiply(a,b)),
inference(para,[status(thm),theory(equality)],[2,4]),
[iquote('para(2,4)')] ).
cnf(6,plain,
equal(divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(D,C))))))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(8,plain,
equal(divide(A,inverse(divide(multiply(B,C),divide(A,inverse(C))))),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(9,plain,
equal(divide(A,inverse(divide(divide(B,inverse(C)),multiply(A,C)))),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(10,plain,
equal(multiply(A,divide(divide(B,C),divide(A,C))),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(13,plain,
equal(divide(A,inverse(divide(B,B))),A),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(14,plain,
equal(multiply(A,divide(B,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,3]),1]),
[iquote('para(13,3),flip(1)')] ).
cnf(33,plain,
equal(divide(A,inverse(divide(multiply(B,C),multiply(A,C)))),B),
inference(para,[status(thm),theory(equality)],[3,8]),
[iquote('para(3,8)')] ).
cnf(41,plain,
equal(multiply(A,divide(divide(B,inverse(C)),multiply(A,C))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,3]),1]),
[iquote('para(9,3),flip(1)')] ).
cnf(51,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,33]),14]),
[iquote('para(14,33),demod([14])')] ).
cnf(55,plain,
equal(divide(inverse(A),inverse(multiply(B,A))),B),
inference(para,[status(thm),theory(equality)],[3,51]),
[iquote('para(3,51)')] ).
cnf(58,plain,
equal(divide(inverse(divide(A,B)),inverse(A)),B),
inference(para,[status(thm),theory(equality)],[51,51]),
[iquote('para(51,51)')] ).
cnf(63,plain,
equal(multiply(inverse(A),multiply(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[55,3]),1]),
[iquote('para(55,3),flip(1)')] ).
cnf(66,plain,
equal(divide(inverse(multiply(A,B)),inverse(A)),inverse(B)),
inference(para,[status(thm),theory(equality)],[55,51]),
[iquote('para(55,51)')] ).
cnf(97,plain,
equal(multiply(inverse(divide(A,B)),A),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[58,3]),1]),
[iquote('para(58,3),flip(1)')] ).
cnf(98,plain,
equal(inverse(divide(divide(A,A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[97,14]),1]),
[iquote('para(97,14),flip(1)')] ).
cnf(101,plain,
equal(multiply(A,divide(divide(B,B),C)),divide(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[98,3]),1]),
[iquote('para(98,3),flip(1)')] ).
cnf(104,plain,
equal(inverse(divide(A,B)),divide(inverse(A),inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[58,51]),1]),
[iquote('para(58,51),flip(1)')] ).
cnf(126,plain,
equal(divide(A,divide(inverse(B),inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[51]),104]),
[iquote('back_demod(51),demod([104])')] ).
cnf(165,plain,
equal(divide(A,multiply(inverse(B),A)),B),
inference(para,[status(thm),theory(equality)],[3,126]),
[iquote('para(3,126)')] ).
cnf(167,plain,
equal(divide(multiply(A,B),A),B),
inference(para,[status(thm),theory(equality)],[63,165]),
[iquote('para(63,165)')] ).
cnf(178,plain,
equal(multiply(inverse(multiply(A,B)),A),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[66,3]),1]),
[iquote('para(66,3),flip(1)')] ).
cnf(179,plain,
equal(divide(inverse(A),inverse(inverse(B))),inverse(multiply(A,B))),
inference(para,[status(thm),theory(equality)],[178,55]),
[iquote('para(178,55)')] ).
cnf(180,plain,
equal(inverse(multiply(A,B)),divide(inverse(A),inverse(inverse(B)))),
inference(flip,[status(thm),theory(equality)],[179]),
[iquote('flip(179)')] ).
cnf(209,plain,
equal(divide(A,divide(A,B)),B),
inference(para,[status(thm),theory(equality)],[101,10]),
[iquote('para(101,10)')] ).
cnf(210,plain,
equal(divide(A,multiply(A,B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[101,41]),
[iquote('para(101,41)')] ).
cnf(212,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[210,165]),
[iquote('para(210,165)')] ).
cnf(213,plain,
equal(inverse(multiply(A,B)),divide(inverse(A),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[180]),212]),
[iquote('back_demod(180),demod([212])')] ).
cnf(215,plain,
equal(multiply(divide(inverse(A),B),A),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[178]),213]),
[iquote('back_demod(178),demod([213])')] ).
cnf(243,plain,
equal(multiply(A,inverse(B)),divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[212,3]),1]),
[iquote('para(212,3),flip(1)')] ).
cnf(250,plain,
equal(divide(divide(A,B),A),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[212,215]),243]),
[iquote('para(212,215),demod([243])')] ).
cnf(254,plain,
equal(divide(A,multiply(B,A)),inverse(B)),
inference(para,[status(thm),theory(equality)],[167,250]),
[iquote('para(167,250)')] ).
cnf(255,plain,
equal(inverse(A),divide(B,multiply(A,B))),
inference(flip,[status(thm),theory(equality)],[254]),
[iquote('flip(254)')] ).
cnf(291,plain,
~ equal(divide(b,divide(A,multiply(a,A))),multiply(a,b)),
inference(para,[status(thm),theory(equality)],[255,5]),
[iquote('para(255,5)')] ).
cnf(292,plain,
$false,
inference(conflict,[status(thm)],[291,209]),
[iquote('conflict(291,209)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP560-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 23:45:04 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.71/1.11 ----- EQP 0.9e, May 2009 -----
% 0.71/1.11 The job began on n011.cluster.edu, Mon Jun 13 23:45:04 2022
% 0.71/1.11 The command was "./eqp09e".
% 0.71/1.11
% 0.71/1.11 set(prolog_style_variables).
% 0.71/1.11 set(lrpo).
% 0.71/1.11 set(basic_paramod).
% 0.71/1.11 set(functional_subsume).
% 0.71/1.11 set(ordered_paramod).
% 0.71/1.11 set(prime_paramod).
% 0.71/1.11 set(para_pairs).
% 0.71/1.11 assign(pick_given_ratio,4).
% 0.71/1.11 clear(print_kept).
% 0.71/1.11 clear(print_new_demod).
% 0.71/1.11 clear(print_back_demod).
% 0.71/1.11 clear(print_given).
% 0.71/1.11 assign(max_mem,64000).
% 0.71/1.11 end_of_commands.
% 0.71/1.11
% 0.71/1.11 Usable:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Sos:
% 0.71/1.11 0 (wt=-1) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.71/1.11 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.71/1.11 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Demodulators:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Passive:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Starting to process input.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.71/1.11 1 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.71/1.11
% 0.71/1.11 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.71/1.11 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.71/1.11
% 0.71/1.11 ** KEPT: 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.71/1.11 ---------------- PROOF FOUND ----------------
% 0.71/1.11 % SZS status Unsatisfiable
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 After processing input:
% 0.71/1.11
% 0.71/1.11 Usable:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Sos:
% 0.71/1.11 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.71/1.11 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.71/1.11 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.71/1.11 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Demodulators:
% 0.71/1.11 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Passive:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 UNIT CONFLICT from 291 and 209 at 0.02 seconds.
% 0.71/1.11
% 0.71/1.11 ---------------- PROOF ----------------
% 0.71/1.11 % SZS output start Refutation
% See solution above
% 0.71/1.11 ------------ end of proof -------------
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 ------------- memory usage ------------
% 0.71/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.71/1.11 type (bytes each) gets frees in use avail bytes
% 0.71/1.11 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.71/1.11 term ( 16) 22995 18427 4568 20 88.5 K
% 0.71/1.11 gen_ptr ( 8) 31638 8223 23415 38 183.2 K
% 0.71/1.11 context ( 808) 18053 18051 2 9 8.7 K
% 0.71/1.11 trail ( 12) 2721 2721 0 6 0.1 K
% 0.71/1.11 bt_node ( 68) 7342 7340 2 18 1.3 K
% 0.71/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.11 ac_match_free_vars_pos (4020)
% 0.71/1.11 0 0 0 0 0.0 K
% 0.71/1.11 discrim ( 12) 4445 2977 1468 840 27.0 K
% 0.71/1.11 flat ( 40) 37041 37041 0 26 1.0 K
% 0.71/1.11 discrim_pos ( 12) 1320 1320 0 1 0.0 K
% 0.71/1.11 fpa_head ( 12) 3019 0 3019 0 35.4 K
% 0.71/1.11 fpa_tree ( 28) 1140 1140 0 15 0.4 K
% 0.71/1.11 fpa_pos ( 36) 502 502 0 1 0.0 K
% 0.71/1.11 literal ( 12) 1288 997 291 1 3.4 K
% 0.71/1.11 clause ( 24) 1288 997 291 1 6.8 K
% 0.71/1.11 list ( 12) 270 214 56 3 0.7 K
% 0.71/1.11 list_pos ( 20) 1438 813 625 35 12.9 K
% 0.71/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.11
% 0.71/1.11 -------------- statistics -------------
% 0.71/1.11 Clauses input 3
% 0.71/1.11 Usable input 0
% 0.71/1.11 Sos input 3
% 0.71/1.11 Demodulators input 0
% 0.71/1.11 Passive input 0
% 0.71/1.11
% 0.71/1.11 Processed BS (before search) 5
% 0.71/1.11 Forward subsumed BS 1
% 0.71/1.11 Kept BS 4
% 0.71/1.11 New demodulators BS 1
% 0.71/1.11 Back demodulated BS 0
% 0.71/1.11
% 0.71/1.11 Clauses or pairs given 1928
% 0.71/1.11 Clauses generated 791
% 0.71/1.11 Forward subsumed 504
% 0.71/1.11 Deleted by weight 0
% 0.71/1.11 Deleted by variable count 0
% 0.71/1.11 Kept 287
% 0.71/1.11 New demodulators 210
% 0.71/1.11 Back demodulated 161
% 0.71/1.11 Ordered paramod prunes 0
% 0.71/1.11 Basic paramod prunes 6627
% 0.71/1.11 Prime paramod prunes 48
% 0.71/1.11 Semantic prunes 0
% 0.71/1.11
% 0.71/1.11 Rewrite attmepts 7118
% 0.71/1.11 Rewrites 1078
% 0.71/1.11
% 0.71/1.11 FPA overloads 0
% 0.71/1.11 FPA underloads 0
% 0.71/1.11
% 0.71/1.11 Usable size 0
% 0.71/1.11 Sos size 129
% 0.71/1.11 Demodulators size 77
% 0.71/1.11 Passive size 0
% 0.71/1.11 Disabled size 161
% 0.71/1.11
% 0.71/1.11 Proofs found 1
% 0.71/1.11
% 0.71/1.11 ----------- times (seconds) ----------- Mon Jun 13 23:45:04 2022
% 0.71/1.11
% 0.71/1.11 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.11 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.71/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.11 input time 0.00
% 0.71/1.11 paramodulation time 0.01
% 0.71/1.11 demodulation time 0.00
% 0.71/1.11 orient time 0.00
% 0.71/1.11 weigh time 0.00
% 0.71/1.11 forward subsume time 0.00
% 0.71/1.11 back demod find time 0.00
% 0.71/1.11 conflict time 0.00
% 0.71/1.11 LRPO time 0.00
% 0.71/1.11 store clause time 0.00
% 0.71/1.11 disable clause time 0.00
% 0.71/1.11 prime paramod time 0.00
% 0.71/1.11 semantics time 0.00
% 0.71/1.11
% 0.71/1.11 EQP interrupted
%------------------------------------------------------------------------------