TSTP Solution File: GRP558-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP558-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n024.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.44s 1.08s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 4 RR)
% Number of literals : 19 ( 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 : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,inverse(divide(divide(B,C),divide(A,C)))),B),
file('GRP558-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP558-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(inverse(b2),b2),a2),a2),
file('GRP558-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(multiply(divide(inverse(b2),inverse(b2)),a2),a2),
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(divide(inverse(b2),inverse(b2)),inverse(a2)),a2),
inference(para,[status(thm),theory(equality)],[2,5]),
[iquote('para(2,5)')] ).
cnf(9,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(12,plain,
equal(divide(A,inverse(divide(multiply(B,C),multiply(A,C)))),B),
inference(para,[status(thm),theory(equality)],[3,9]),
[iquote('para(3,9)')] ).
cnf(17,plain,
equal(divide(A,inverse(divide(B,B))),A),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(18,plain,
equal(multiply(A,divide(B,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,3]),1]),
[iquote('para(17,3),flip(1)')] ).
cnf(53,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,12]),18]),
[iquote('para(18,12),demod([18])')] ).
cnf(58,plain,
equal(divide(inverse(divide(A,A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[17,53]),
[iquote('para(17,53)')] ).
cnf(66,plain,
equal(multiply(inverse(divide(A,A)),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[58,3]),1]),
[iquote('para(58,3),flip(1)')] ).
cnf(67,plain,
equal(divide(A,A),inverse(divide(B,B))),
inference(para,[status(thm),theory(equality)],[66,18]),
[iquote('para(66,18)')] ).
cnf(68,plain,
equal(inverse(divide(A,A)),divide(B,B)),
inference(flip,[status(thm),theory(equality)],[67]),
[iquote('flip(67)')] ).
cnf(72,plain,
equal(divide(A,divide(B,B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[68,3]),18]),
[iquote('para(68,3),demod([18])')] ).
cnf(73,plain,
equal(divide(divide(A,A),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[72,53]),
[iquote('para(72,53)')] ).
cnf(74,plain,
$false,
inference(conflict,[status(thm)],[73,8]),
[iquote('conflict(73,8)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP558-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 16:33:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.08 ----- EQP 0.9e, May 2009 -----
% 0.44/1.08 The job began on n024.cluster.edu, Mon Jun 13 16:33:49 2022
% 0.44/1.08 The command was "./eqp09e".
% 0.44/1.08
% 0.44/1.08 set(prolog_style_variables).
% 0.44/1.08 set(lrpo).
% 0.44/1.08 set(basic_paramod).
% 0.44/1.08 set(functional_subsume).
% 0.44/1.08 set(ordered_paramod).
% 0.44/1.08 set(prime_paramod).
% 0.44/1.08 set(para_pairs).
% 0.44/1.08 assign(pick_given_ratio,4).
% 0.44/1.08 clear(print_kept).
% 0.44/1.08 clear(print_new_demod).
% 0.44/1.08 clear(print_back_demod).
% 0.44/1.08 clear(print_given).
% 0.44/1.08 assign(max_mem,64000).
% 0.44/1.08 end_of_commands.
% 0.44/1.08
% 0.44/1.08 Usable:
% 0.44/1.08 end_of_list.
% 0.44/1.08
% 0.44/1.08 Sos:
% 0.44/1.08 0 (wt=-1) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.44/1.08 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.44/1.08 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.44/1.08 end_of_list.
% 0.44/1.08
% 0.44/1.08 Demodulators:
% 0.44/1.08 end_of_list.
% 0.44/1.08
% 0.44/1.08 Passive:
% 0.44/1.08 end_of_list.
% 0.44/1.08
% 0.44/1.08 Starting to process input.
% 0.44/1.08
% 0.44/1.08 ** KEPT: 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.44/1.08 1 is a new demodulator.
% 0.44/1.08
% 0.44/1.08 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.44/1.08
% 0.44/1.08 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.44/1.08 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.44/1.08
% 0.44/1.08 ** KEPT: 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.44/1.08 ---------------- PROOF FOUND ----------------
% 0.44/1.08 % SZS status Unsatisfiable
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 After processing input:
% 0.44/1.08
% 0.44/1.08 Usable:
% 0.44/1.08 end_of_list.
% 0.44/1.08
% 0.44/1.08 Sos:
% 0.44/1.08 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.44/1.08 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.44/1.08 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.44/1.08 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.44/1.08 end_of_list.
% 0.44/1.08
% 0.44/1.08 Demodulators:
% 0.44/1.08 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.44/1.08 end_of_list.
% 0.44/1.08
% 0.44/1.08 Passive:
% 0.44/1.08 end_of_list.
% 0.44/1.08
% 0.44/1.08 UNIT CONFLICT from 73 and 8 at 0.00 seconds.
% 0.44/1.08
% 0.44/1.08 ---------------- PROOF ----------------
% 0.44/1.08 % SZS output start Refutation
% See solution above
% 0.44/1.08 ------------ end of proof -------------
% 0.44/1.08
% 0.44/1.08
% 0.44/1.08 ------------- memory usage ------------
% 0.44/1.08 Memory dynamically allocated (tp_alloc): 488.
% 0.44/1.08 type (bytes each) gets frees in use avail bytes
% 0.44/1.08 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.44/1.08 term ( 16) 3634 2698 936 19 18.4 K
% 0.44/1.08 gen_ptr ( 8) 4888 480 4408 18 34.6 K
% 0.44/1.08 context ( 808) 3787 3785 2 2 3.2 K
% 0.44/1.08 trail ( 12) 428 428 0 5 0.1 K
% 0.44/1.08 bt_node ( 68) 2060 2057 3 12 1.0 K
% 0.44/1.08 ac_position (285432) 0 0 0 0 0.0 K
% 0.44/1.08 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.44/1.08 ac_match_free_vars_pos (4020)
% 0.44/1.08 0 0 0 0 0.0 K
% 0.44/1.08 discrim ( 12) 853 0 853 0 10.0 K
% 0.44/1.08 flat ( 40) 4712 4712 0 16 0.6 K
% 0.44/1.08 discrim_pos ( 12) 66 66 0 1 0.0 K
% 0.44/1.08 fpa_head ( 12) 873 0 873 0 10.2 K
% 0.44/1.08 fpa_tree ( 28) 157 157 0 5 0.1 K
% 0.44/1.08 fpa_pos ( 36) 135 135 0 1 0.0 K
% 0.44/1.08 literal ( 12) 239 166 73 1 0.9 K
% 0.44/1.08 clause ( 24) 239 166 73 1 1.7 K
% 0.44/1.08 list ( 12) 121 65 56 3 0.7 K
% 0.44/1.08 list_pos ( 20) 281 3 278 0 5.4 K
% 0.44/1.08 pair_index ( 40) 2 0 2 0 0.1 K
% 0.44/1.08
% 0.44/1.08 -------------- statistics -------------
% 0.44/1.08 Clauses input 3
% 0.44/1.08 Usable input 0
% 0.44/1.08 Sos input 3
% 0.44/1.08 Demodulators input 0
% 0.44/1.08 Passive input 0
% 0.44/1.08
% 0.44/1.08 Processed BS (before search) 5
% 0.44/1.08 Forward subsumed BS 1
% 0.44/1.08 Kept BS 4
% 0.44/1.08 New demodulators BS 1
% 0.44/1.08 Back demodulated BS 0
% 0.44/1.08
% 0.44/1.08 Clauses or pairs given 337
% 0.44/1.08 Clauses generated 157
% 0.44/1.08 Forward subsumed 88
% 0.44/1.08 Deleted by weight 0
% 0.44/1.08 Deleted by variable count 0
% 0.44/1.08 Kept 69
% 0.44/1.08 New demodulators 61
% 0.44/1.08 Back demodulated 0
% 0.44/1.08 Ordered paramod prunes 0
% 0.44/1.08 Basic paramod prunes 1014
% 0.44/1.08 Prime paramod prunes 2
% 0.44/1.08 Semantic prunes 0
% 0.44/1.08
% 0.44/1.08 Rewrite attmepts 952
% 0.44/1.08 Rewrites 56
% 0.44/1.08
% 0.44/1.08 FPA overloads 0
% 0.44/1.08 FPA underloads 0
% 0.44/1.08
% 0.44/1.08 Usable size 0
% 0.44/1.08 Sos size 72
% 0.44/1.08 Demodulators size 62
% 0.44/1.08 Passive size 0
% 0.44/1.08 Disabled size 0
% 0.44/1.08
% 0.44/1.08 Proofs found 1
% 0.44/1.08
% 0.44/1.08 ----------- times (seconds) ----------- Mon Jun 13 16:33:49 2022
% 0.44/1.08
% 0.44/1.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.44/1.08 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.44/1.08 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.44/1.08 input time 0.00
% 0.44/1.08 paramodulation time 0.00
% 0.44/1.08 demodulation time 0.00
% 0.44/1.08 orient time 0.00
% 0.44/1.08 weigh time 0.00
% 0.44/1.08 forward subsume time 0.00
% 0.44/1.08 back demod find time 0.00
% 0.44/1.08 conflict time 0.00
% 0.44/1.08 LRPO time 0.00
% 0.44/1.08 store clause time 0.00
% 0.44/1.08 disable clause time 0.00
% 0.44/1.08 prime paramod time 0.00
% 0.44/1.08 semantics time 0.00
% 0.44/1.08
% 0.44/1.08 EQP interrupted
%------------------------------------------------------------------------------