TSTP Solution File: GRP553-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP553-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n018.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.73s 1.11s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 3 RR)
% Number of literals : 19 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,inverse(divide(B,divide(A,C)))),C),B),
file('GRP553-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP553-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(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
~ equal(divide(inverse(b1),inverse(b1)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[2,4]),
[iquote('para(2,4)')] ).
cnf(6,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(7,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(17,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(18,plain,
equal(multiply(A,divide(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,3]),1]),
[iquote('para(17,3),flip(1)')] ).
cnf(22,plain,
equal(divide(divide(A,inverse(divide(B,C))),inverse(divide(C,A))),B),
inference(para,[status(thm),theory(equality)],[17,1]),
[iquote('para(17,1)')] ).
cnf(27,plain,
equal(divide(divide(divide(A,inverse(B)),C),divide(A,C)),B),
inference(para,[status(thm),theory(equality)],[7,1]),
[iquote('para(7,1)')] ).
cnf(30,plain,
equal(divide(divide(multiply(A,B),C),divide(A,C)),B),
inference(para,[status(thm),theory(equality)],[3,27]),
[iquote('para(3,27)')] ).
cnf(32,plain,
equal(divide(divide(A,B),divide(C,B)),divide(A,C)),
inference(para,[status(thm),theory(equality)],[18,30]),
[iquote('para(18,30)')] ).
cnf(33,plain,
equal(divide(multiply(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),32]),
[iquote('back_demod(30),demod([32])')] ).
cnf(153,plain,
equal(divide(A,inverse(divide(B,B))),A),
inference(para,[status(thm),theory(equality)],[17,22]),
[iquote('para(17,22)')] ).
cnf(158,plain,
equal(multiply(A,divide(B,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[153,3]),1]),
[iquote('para(153,3),flip(1)')] ).
cnf(159,plain,
equal(divide(A,A),divide(B,B)),
inference(para,[status(thm),theory(equality)],[158,33]),
[iquote('para(158,33)')] ).
cnf(160,plain,
equal(divide(A,A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[159,3]),
[iquote('para(159,3)')] ).
cnf(161,plain,
$false,
inference(conflict,[status(thm)],[160,5]),
[iquote('conflict(160,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP553-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.14 % Command : tptp2X_and_run_eqp %s
% 0.15/0.35 % Computer : n018.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 13 23:06:58 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.73/1.11 ----- EQP 0.9e, May 2009 -----
% 0.73/1.11 The job began on n018.cluster.edu, Mon Jun 13 23:06:58 2022
% 0.73/1.11 The command was "./eqp09e".
% 0.73/1.11
% 0.73/1.11 set(prolog_style_variables).
% 0.73/1.11 set(lrpo).
% 0.73/1.11 set(basic_paramod).
% 0.73/1.11 set(functional_subsume).
% 0.73/1.11 set(ordered_paramod).
% 0.73/1.11 set(prime_paramod).
% 0.73/1.11 set(para_pairs).
% 0.73/1.11 assign(pick_given_ratio,4).
% 0.73/1.11 clear(print_kept).
% 0.73/1.11 clear(print_new_demod).
% 0.73/1.11 clear(print_back_demod).
% 0.73/1.11 clear(print_given).
% 0.73/1.11 assign(max_mem,64000).
% 0.73/1.11 end_of_commands.
% 0.73/1.11
% 0.73/1.11 Usable:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Sos:
% 0.73/1.11 0 (wt=-1) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.73/1.11 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.73/1.11 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Demodulators:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Passive:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Starting to process input.
% 0.73/1.11
% 0.73/1.11 ** KEPT: 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.73/1.11 1 is a new demodulator.
% 0.73/1.11
% 0.73/1.11 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.73/1.11
% 0.73/1.11 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.73/1.11 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.73/1.11
% 0.73/1.11 ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.73/1.11 ---------------- PROOF FOUND ----------------
% 0.73/1.11 % SZS status Unsatisfiable
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 After processing input:
% 0.73/1.11
% 0.73/1.11 Usable:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Sos:
% 0.73/1.11 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.73/1.11 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.73/1.11 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.73/1.11 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Demodulators:
% 0.73/1.11 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Passive:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 UNIT CONFLICT from 160 and 5 at 0.01 seconds.
% 0.73/1.11
% 0.73/1.11 ---------------- PROOF ----------------
% 0.73/1.11 % SZS output start Refutation
% See solution above
% 0.73/1.11 ------------ end of proof -------------
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 ------------- memory usage ------------
% 0.73/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.73/1.11 type (bytes each) gets frees in use avail bytes
% 0.73/1.11 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.73/1.11 term ( 16) 8258 5638 2620 19 50.9 K
% 0.73/1.11 gen_ptr ( 8) 13776 2787 10989 18 86.0 K
% 0.73/1.11 context ( 808) 6208 6206 2 2 3.2 K
% 0.73/1.11 trail ( 12) 1151 1151 0 7 0.1 K
% 0.73/1.11 bt_node ( 68) 2143 2140 3 17 1.3 K
% 0.73/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.11 ac_match_free_vars_pos (4020)
% 0.73/1.11 0 0 0 0 0.0 K
% 0.73/1.11 discrim ( 12) 2027 1035 992 417 16.5 K
% 0.73/1.11 flat ( 40) 17317 17317 0 37 1.4 K
% 0.73/1.11 discrim_pos ( 12) 261 261 0 1 0.0 K
% 0.73/1.11 fpa_head ( 12) 896 0 896 0 10.5 K
% 0.73/1.11 fpa_tree ( 28) 256 256 0 11 0.3 K
% 0.73/1.11 fpa_pos ( 36) 244 244 0 1 0.0 K
% 0.73/1.11 literal ( 12) 536 376 160 1 1.9 K
% 0.73/1.11 clause ( 24) 536 376 160 1 3.8 K
% 0.73/1.11 list ( 12) 143 87 56 4 0.7 K
% 0.73/1.11 list_pos ( 20) 707 302 405 35 8.6 K
% 0.73/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.11
% 0.73/1.11 -------------- statistics -------------
% 0.73/1.11 Clauses input 3
% 0.73/1.11 Usable input 0
% 0.73/1.11 Sos input 3
% 0.73/1.11 Demodulators input 0
% 0.73/1.11 Passive input 0
% 0.73/1.11
% 0.73/1.11 Processed BS (before search) 5
% 0.73/1.11 Forward subsumed BS 1
% 0.73/1.11 Kept BS 4
% 0.73/1.11 New demodulators BS 1
% 0.73/1.11 Back demodulated BS 0
% 0.73/1.11
% 0.73/1.11 Clauses or pairs given 493
% 0.73/1.11 Clauses generated 316
% 0.73/1.11 Forward subsumed 160
% 0.73/1.11 Deleted by weight 0
% 0.73/1.11 Deleted by variable count 0
% 0.73/1.11 Kept 156
% 0.73/1.11 New demodulators 83
% 0.73/1.11 Back demodulated 64
% 0.73/1.11 Ordered paramod prunes 0
% 0.73/1.11 Basic paramod prunes 1827
% 0.73/1.11 Prime paramod prunes 21
% 0.73/1.11 Semantic prunes 0
% 0.73/1.11
% 0.73/1.11 Rewrite attmepts 3000
% 0.73/1.11 Rewrites 182
% 0.73/1.11
% 0.73/1.11 FPA overloads 0
% 0.73/1.11 FPA underloads 0
% 0.73/1.11
% 0.73/1.11 Usable size 0
% 0.73/1.11 Sos size 95
% 0.73/1.11 Demodulators size 56
% 0.73/1.11 Passive size 0
% 0.73/1.11 Disabled size 64
% 0.73/1.11
% 0.73/1.11 Proofs found 1
% 0.73/1.11
% 0.73/1.11 ----------- times (seconds) ----------- Mon Jun 13 23:06:58 2022
% 0.73/1.11
% 0.73/1.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.73/1.11 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.73/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.11 input time 0.00
% 0.73/1.11 paramodulation time 0.00
% 0.73/1.11 demodulation time 0.00
% 0.73/1.11 orient time 0.00
% 0.73/1.11 weigh time 0.00
% 0.73/1.11 forward subsume time 0.00
% 0.73/1.11 back demod find time 0.00
% 0.73/1.11 conflict time 0.00
% 0.73/1.11 LRPO time 0.00
% 0.73/1.11 store clause time 0.00
% 0.73/1.11 disable clause time 0.00
% 0.73/1.11 prime paramod time 0.00
% 0.73/1.11 semantics time 0.00
% 0.73/1.11
% 0.73/1.11 EQP interrupted
%------------------------------------------------------------------------------