TSTP Solution File: GRP544-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP544-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n007.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:54 EDT 2022
% Result : Unsatisfiable 0.65s 1.06s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 2 RR)
% Number of literals : 20 ( 0 equ; 1 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; 3 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(identity,divide(divide(divide(A,B),C),A)),C),B),
file('GRP544-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
file('GRP544-1.p',unknown),
[] ).
cnf(4,plain,
equal(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
~ equal(divide(a,divide(identity,b)),divide(b,divide(identity,a))),
inference(demod,[status(thm),theory(equality)],[2,2]),
[iquote('demod([2,2])')] ).
cnf(6,plain,
equal(divide(divide(identity,divide(divide(A,B),divide(identity,divide(divide(divide(C,A),D),C)))),B),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(divide(divide(divide(A,B),C),A),divide(divide(identity,divide(B,identity)),C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(8,plain,
equal(divide(divide(identity,divide(divide(A,B),divide(identity,divide(divide(identity,divide(A,identity)),C)))),B),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),7]),
[iquote('back_demod(6),demod([7])')] ).
cnf(17,plain,
equal(divide(divide(identity,divide(identity,divide(identity,divide(divide(identity,divide(A,identity)),B)))),A),B),
inference(para,[status(thm),theory(equality)],[4,8]),
[iquote('para(4,8)')] ).
cnf(18,plain,
equal(divide(divide(identity,divide(divide(identity,A),divide(identity,divide(identity,B)))),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,8]),4]),
[iquote('para(4,8),demod([4])')] ).
cnf(19,plain,
equal(divide(divide(identity,divide(divide(A,B),identity)),B),divide(identity,divide(A,identity))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,8]),4]),
[iquote('para(4,8),demod([4])')] ).
cnf(20,plain,
equal(divide(divide(identity,divide(identity,divide(identity,divide(identity,A)))),identity),A),
inference(para,[status(thm),theory(equality)],[4,18]),
[iquote('para(4,18)')] ).
cnf(21,plain,
equal(divide(identity,divide(identity,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,18]),4]),
[iquote('para(4,18),demod([4])')] ).
cnf(22,plain,
equal(divide(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[20]),21,21]),
[iquote('back_demod(20),demod([21,21])')] ).
cnf(23,plain,
equal(divide(divide(identity,divide(A,B)),B),divide(identity,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[19]),22,22]),
[iquote('back_demod(19),demod([22,22])')] ).
cnf(24,plain,
equal(divide(divide(identity,divide(divide(identity,A),B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[17]),22,21]),
[iquote('back_demod(17),demod([22,21])')] ).
cnf(27,plain,
equal(divide(divide(identity,divide(A,B)),divide(identity,A)),B),
inference(para,[status(thm),theory(equality)],[21,24]),
[iquote('para(21,24)')] ).
cnf(29,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,24]),21]),
[iquote('para(23,24),demod([21])')] ).
cnf(32,plain,
equal(divide(divide(identity,A),divide(identity,B)),divide(B,A)),
inference(para,[status(thm),theory(equality)],[29,27]),
[iquote('para(29,27)')] ).
cnf(46,plain,
equal(divide(A,divide(identity,B)),divide(B,divide(identity,A))),
inference(para,[status(thm),theory(equality)],[29,32]),
[iquote('para(29,32)')] ).
cnf(47,plain,
$false,
inference(conflict,[status(thm)],[46,5]),
[iquote('conflict(46,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP544-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n007.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 : Mon Jun 13 11:50:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.65/1.06 ----- EQP 0.9e, May 2009 -----
% 0.65/1.06 The job began on n007.cluster.edu, Mon Jun 13 11:50:54 2022
% 0.65/1.06 The command was "./eqp09e".
% 0.65/1.06
% 0.65/1.06 set(prolog_style_variables).
% 0.65/1.06 set(lrpo).
% 0.65/1.06 set(basic_paramod).
% 0.65/1.06 set(functional_subsume).
% 0.65/1.06 set(ordered_paramod).
% 0.65/1.06 set(prime_paramod).
% 0.65/1.06 set(para_pairs).
% 0.65/1.06 assign(pick_given_ratio,4).
% 0.65/1.06 clear(print_kept).
% 0.65/1.06 clear(print_new_demod).
% 0.65/1.06 clear(print_back_demod).
% 0.65/1.06 clear(print_given).
% 0.65/1.06 assign(max_mem,64000).
% 0.65/1.06 end_of_commands.
% 0.65/1.06
% 0.65/1.06 Usable:
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Sos:
% 0.65/1.06 0 (wt=-1) [] divide(divide(identity,divide(divide(divide(A,B),C),A)),C) = B.
% 0.65/1.06 0 (wt=-1) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.65/1.06 0 (wt=-1) [] inverse(A) = divide(identity,A).
% 0.65/1.06 0 (wt=-1) [] identity = divide(A,A).
% 0.65/1.06 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Demodulators:
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Passive:
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Starting to process input.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 1 (wt=13) [] divide(divide(identity,divide(divide(divide(A,B),C),A)),C) = B.
% 0.65/1.06 1 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.65/1.06 2 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.65/1.06 3 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.65/1.06 4 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 5 (wt=11) [demod([2,2])] -(divide(a,divide(identity,b)) = divide(b,divide(identity,a))).
% 0.65/1.06 ---------------- PROOF FOUND ----------------
% 0.65/1.06 % SZS status Unsatisfiable
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 After processing input:
% 0.65/1.06
% 0.65/1.06 Usable:
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Sos:
% 0.65/1.06 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.65/1.06 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.65/1.06 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.65/1.06 5 (wt=11) [demod([2,2])] -(divide(a,divide(identity,b)) = divide(b,divide(identity,a))).
% 0.65/1.06 1 (wt=13) [] divide(divide(identity,divide(divide(divide(A,B),C),A)),C) = B.
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Demodulators:
% 0.65/1.06 1 (wt=13) [] divide(divide(identity,divide(divide(divide(A,B),C),A)),C) = B.
% 0.65/1.06 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.65/1.06 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.65/1.06 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Passive:
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 UNIT CONFLICT from 46 and 5 at 0.00 seconds.
% 0.65/1.06
% 0.65/1.06 ---------------- PROOF ----------------
% 0.65/1.06 % SZS output start Refutation
% See solution above
% 0.65/1.06 ------------ end of proof -------------
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 ------------- memory usage ------------
% 0.65/1.06 Memory dynamically allocated (tp_alloc): 488.
% 0.65/1.06 type (bytes each) gets frees in use avail bytes
% 0.65/1.06 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.65/1.06 term ( 16) 3128 2539 589 28 11.9 K
% 0.65/1.06 gen_ptr ( 8) 3427 1006 2421 19 19.1 K
% 0.65/1.06 context ( 808) 2696 2694 2 3 3.9 K
% 0.65/1.06 trail ( 12) 166 166 0 4 0.0 K
% 0.65/1.06 bt_node ( 68) 1150 1147 3 12 1.0 K
% 0.65/1.06 ac_position (285432) 0 0 0 0 0.0 K
% 0.65/1.06 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.65/1.06 ac_match_free_vars_pos (4020)
% 0.65/1.06 0 0 0 0 0.0 K
% 0.65/1.06 discrim ( 12) 581 236 345 0 4.0 K
% 0.65/1.06 flat ( 40) 4286 4286 0 21 0.8 K
% 0.65/1.06 discrim_pos ( 12) 168 168 0 1 0.0 K
% 0.65/1.06 fpa_head ( 12) 287 0 287 0 3.4 K
% 0.65/1.06 fpa_tree ( 28) 192 192 0 13 0.4 K
% 0.65/1.06 fpa_pos ( 36) 83 83 0 1 0.0 K
% 0.65/1.06 literal ( 12) 182 136 46 1 0.6 K
% 0.65/1.06 clause ( 24) 182 136 46 1 1.1 K
% 0.65/1.06 list ( 12) 96 40 56 3 0.7 K
% 0.65/1.06 list_pos ( 20) 220 102 118 0 2.3 K
% 0.65/1.06 pair_index ( 40) 2 0 2 0 0.1 K
% 0.65/1.06
% 0.65/1.06 -------------- statistics -------------
% 0.65/1.06 Clauses input 5
% 0.65/1.06 Usable input 0
% 0.65/1.06 Sos input 5
% 0.65/1.06 Demodulators input 0
% 0.65/1.06 Passive input 0
% 0.65/1.06
% 0.65/1.06 Processed BS (before search) 5
% 0.65/1.06 Forward subsumed BS 0
% 0.65/1.06 Kept BS 5
% 0.65/1.06 New demodulators BS 4
% 0.65/1.06 Back demodulated BS 0
% 0.65/1.06
% 0.65/1.06 Clauses or pairs given 137
% 0.65/1.06 Clauses generated 126
% 0.65/1.06 Forward subsumed 85
% 0.65/1.06 Deleted by weight 0
% 0.65/1.06 Deleted by variable count 0
% 0.65/1.06 Kept 41
% 0.65/1.06 New demodulators 33
% 0.65/1.06 Back demodulated 18
% 0.65/1.06 Ordered paramod prunes 0
% 0.65/1.06 Basic paramod prunes 305
% 0.65/1.06 Prime paramod prunes 16
% 0.65/1.06 Semantic prunes 0
% 0.65/1.06
% 0.65/1.06 Rewrite attmepts 1130
% 0.65/1.06 Rewrites 146
% 0.65/1.06
% 0.65/1.06 FPA overloads 0
% 0.65/1.06 FPA underloads 0
% 0.65/1.06
% 0.65/1.06 Usable size 0
% 0.65/1.06 Sos size 27
% 0.65/1.06 Demodulators size 19
% 0.65/1.06 Passive size 0
% 0.65/1.06 Disabled size 18
% 0.65/1.06
% 0.65/1.06 Proofs found 1
% 0.65/1.06
% 0.65/1.06 ----------- times (seconds) ----------- Mon Jun 13 11:50:54 2022
% 0.65/1.06
% 0.65/1.06 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.65/1.06 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.65/1.06 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.65/1.06 input time 0.00
% 0.65/1.06 paramodulation time 0.00
% 0.65/1.06 demodulation time 0.00
% 0.65/1.06 orient time 0.00
% 0.65/1.06 weigh time 0.00
% 0.65/1.06 forward subsume time 0.00
% 0.65/1.06 back demod find time 0.00
% 0.65/1.06 conflict time 0.00
% 0.65/1.06 LRPO time 0.00
% 0.65/1.06 store clause time 0.00
% 0.65/1.06 disable clause time 0.00
% 0.65/1.06 prime paramod time 0.00
% 0.65/1.06 semantics time 0.00
% 0.65/1.06
% 0.65/1.06 EQP interrupted
%------------------------------------------------------------------------------