TSTP Solution File: GRP539-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP539-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:53 EDT 2022
% Result : Unsatisfiable 0.74s 1.16s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 3 RR)
% Number of literals : 21 ( 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; 4 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,B),divide(divide(A,C),B)),C),
file('GRP539-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP539-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(6,plain,
equal(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),6]),1]),
[iquote('back_demod(3),demod([6]),flip(1)')] ).
cnf(9,plain,
~ equal(divide(divide(a3,divide(identity,b3)),divide(identity,c3)),divide(a3,divide(identity,divide(b3,divide(identity,c3))))),
inference(demod,[status(thm),theory(equality)],[8,8,8,8]),
[iquote('demod([8,8,8,8])')] ).
cnf(10,plain,
equal(divide(A,divide(divide(divide(B,C),D),divide(divide(B,A),C))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(11,plain,
equal(divide(divide(divide(A,B),C),divide(D,C)),divide(divide(A,D),B)),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(14,plain,
equal(divide(identity,divide(divide(A,B),A)),B),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(16,plain,
equal(divide(divide(A,divide(A,B)),identity),B),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(17,plain,
equal(divide(identity,divide(identity,A)),A),
inference(para,[status(thm),theory(equality)],[6,14]),
[iquote('para(6,14)')] ).
cnf(22,plain,
equal(divide(A,identity),A),
inference(para,[status(thm),theory(equality)],[17,16]),
[iquote('para(17,16)')] ).
cnf(23,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),22]),
[iquote('back_demod(16),demod([22])')] ).
cnf(28,plain,
equal(divide(A,divide(B,divide(divide(C,A),D))),divide(divide(C,B),D)),
inference(para,[status(thm),theory(equality)],[1,10]),
[iquote('para(1,10)')] ).
cnf(29,plain,
equal(divide(divide(A,B),C),divide(D,divide(B,divide(divide(A,D),C)))),
inference(flip,[status(thm),theory(equality)],[28]),
[iquote('flip(28)')] ).
cnf(43,plain,
equal(divide(divide(A,B),C),divide(identity,divide(B,divide(A,C)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,11]),1]),
[iquote('para(6,11),flip(1)')] ).
cnf(51,plain,
equal(divide(identity,divide(A,divide(B,C))),divide(D,divide(A,divide(identity,divide(D,divide(B,C)))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[29]),43,43]),
[iquote('back_demod(29),demod([43,43])')] ).
cnf(52,plain,
equal(divide(A,divide(B,divide(identity,divide(A,divide(C,D))))),divide(identity,divide(B,divide(C,D)))),
inference(flip,[status(thm),theory(equality)],[51]),
[iquote('flip(51)')] ).
cnf(60,plain,
~ equal(divide(a3,divide(identity,divide(b3,divide(identity,c3)))),divide(b3,divide(identity,divide(a3,divide(identity,c3))))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),43,43,23]),1]),
[iquote('back_demod(9),demod([43,43,23]),flip(1)')] ).
cnf(230,plain,
equal(divide(A,divide(identity,divide(B,divide(C,D)))),divide(B,divide(identity,divide(A,divide(C,D))))),
inference(para,[status(thm),theory(equality)],[52,23]),
[iquote('para(52,23)')] ).
cnf(231,plain,
$false,
inference(conflict,[status(thm)],[230,60]),
[iquote('conflict(230,60)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : GRP539-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 20:56:54 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.74/1.16 ----- EQP 0.9e, May 2009 -----
% 0.74/1.16 The job began on n019.cluster.edu, Mon Jun 13 20:56:55 2022
% 0.74/1.16 The command was "./eqp09e".
% 0.74/1.16
% 0.74/1.16 set(prolog_style_variables).
% 0.74/1.16 set(lrpo).
% 0.74/1.16 set(basic_paramod).
% 0.74/1.16 set(functional_subsume).
% 0.74/1.16 set(ordered_paramod).
% 0.74/1.16 set(prime_paramod).
% 0.74/1.16 set(para_pairs).
% 0.74/1.16 assign(pick_given_ratio,4).
% 0.74/1.16 clear(print_kept).
% 0.74/1.16 clear(print_new_demod).
% 0.74/1.16 clear(print_back_demod).
% 0.74/1.16 clear(print_given).
% 0.74/1.16 assign(max_mem,64000).
% 0.74/1.16 end_of_commands.
% 0.74/1.16
% 0.74/1.16 Usable:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Sos:
% 0.74/1.16 0 (wt=-1) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.74/1.16 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.74/1.16 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.74/1.16 0 (wt=-1) [] identity = divide(A,A).
% 0.74/1.16 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Demodulators:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Passive:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Starting to process input.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 1 (wt=11) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.74/1.16 1 is a new demodulator.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.74/1.16
% 0.74/1.16 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.74/1.16 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.74/1.16
% 0.74/1.16 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.74/1.16
% 0.74/1.16 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.74/1.16 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.74/1.16
% 0.74/1.16 ** KEPT: 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.16 6 is a new demodulator.
% 0.74/1.16 -> 6 back demodulating 5.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.74/1.16 7 is a new demodulator.
% 0.74/1.16 -> 7 back demodulating 4.
% 0.74/1.16 clause forward subsumed: 0 (wt=7) [back_demod(4),demod([7,6])] divide(identity,A) = divide(identity,A).
% 0.74/1.16 -> 6 back demodulating 3.
% 0.74/1.16
% 0.74/1.16 ** KEPT: 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.16 8 is a new demodulator.
% 0.74/1.16 -> 8 back demodulating 2.
% 0.74/1.16 clause forward subsumed: 0 (wt=11) [back_demod(2),demod([8,6])] divide(A,divide(identity,B)) = divide(A,divide(identity,B)).
% 0.74/1.16
% 0.74/1.16 ** KEPT: 9 (wt=19) [demod([8,8,8,8])] -(divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3))))).
% 0.74/1.16 ---------------- PROOF FOUND ----------------
% 0.74/1.16 % SZS status Unsatisfiable
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 After processing input:
% 0.74/1.16
% 0.74/1.16 Usable:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Sos:
% 0.74/1.16 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.16 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.74/1.16 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.16 1 (wt=11) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.74/1.16 9 (wt=19) [demod([8,8,8,8])] -(divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3))))).
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Demodulators:
% 0.74/1.16 1 (wt=11) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.74/1.16 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.16 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.74/1.16 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 Passive:
% 0.74/1.16 end_of_list.
% 0.74/1.16
% 0.74/1.16 UNIT CONFLICT from 230 and 60 at 0.02 seconds.
% 0.74/1.16
% 0.74/1.16 ---------------- PROOF ----------------
% 0.74/1.16 % SZS output start Refutation
% See solution above
% 0.74/1.16 ------------ end of proof -------------
% 0.74/1.16
% 0.74/1.16
% 0.74/1.16 ------------- memory usage ------------
% 0.74/1.16 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.16 type (bytes each) gets frees in use avail bytes
% 0.74/1.16 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.74/1.16 term ( 16) 29108 24397 4711 20 91.5 K
% 0.74/1.16 gen_ptr ( 8) 29263 6367 22896 20 179.0 K
% 0.74/1.16 context ( 808) 15643 15641 2 10 9.5 K
% 0.74/1.16 trail ( 12) 6195 6195 0 6 0.1 K
% 0.74/1.16 bt_node ( 68) 3680 3677 3 14 1.1 K
% 0.74/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.16 ac_match_free_vars_pos (4020)
% 0.74/1.16 0 0 0 0 0.0 K
% 0.74/1.16 discrim ( 12) 2695 1253 1442 283 20.2 K
% 0.74/1.16 flat ( 40) 65771 65771 0 49 1.9 K
% 0.74/1.16 discrim_pos ( 12) 1715 1715 0 1 0.0 K
% 0.74/1.16 fpa_head ( 12) 284 0 284 0 3.3 K
% 0.74/1.16 fpa_tree ( 28) 461 461 0 39 1.1 K
% 0.74/1.16 fpa_pos ( 36) 307 307 0 1 0.0 K
% 0.74/1.16 literal ( 12) 1290 1060 230 1 2.7 K
% 0.74/1.16 clause ( 24) 1290 1060 230 1 5.4 K
% 0.74/1.16 list ( 12) 136 80 56 4 0.7 K
% 0.74/1.16 list_pos ( 20) 985 479 506 9 10.1 K
% 0.74/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.16
% 0.74/1.16 -------------- statistics -------------
% 0.74/1.16 Clauses input 5
% 0.74/1.16 Usable input 0
% 0.74/1.16 Sos input 5
% 0.74/1.16 Demodulators input 0
% 0.74/1.16 Passive input 0
% 0.74/1.16
% 0.74/1.16 Processed BS (before search) 13
% 0.74/1.16 Forward subsumed BS 4
% 0.74/1.16 Kept BS 9
% 0.74/1.16 New demodulators BS 4
% 0.74/1.16 Back demodulated BS 4
% 0.74/1.16
% 0.74/1.16 Clauses or pairs given 405
% 0.74/1.16 Clauses generated 766
% 0.74/1.16 Forward subsumed 545
% 0.74/1.16 Deleted by weight 0
% 0.74/1.16 Deleted by variable count 0
% 0.74/1.16 Kept 221
% 0.74/1.16 New demodulators 73
% 0.74/1.16 Back demodulated 103
% 0.74/1.16 Ordered paramod prunes 0
% 0.74/1.16 Basic paramod prunes 627
% 0.74/1.16 Prime paramod prunes 42
% 0.74/1.16 Semantic prunes 0
% 0.74/1.16
% 0.74/1.16 Rewrite attmepts 10322
% 0.74/1.16 Rewrites 1430
% 0.74/1.16
% 0.74/1.16 FPA overloads 0
% 0.74/1.16 FPA underloads 0
% 0.74/1.16
% 0.74/1.16 Usable size 0
% 0.74/1.16 Sos size 122
% 0.74/1.16 Demodulators size 33
% 0.74/1.16 Passive size 0
% 0.74/1.16 Disabled size 107
% 0.74/1.16
% 0.74/1.16 Proofs found 1
% 0.74/1.16
% 0.74/1.16 ----------- times (seconds) ----------- Mon Jun 13 20:56:55 2022
% 0.74/1.16
% 0.74/1.16 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.74/1.16 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.74/1.16 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.16 input time 0.00
% 0.74/1.16 paramodulation time 0.00
% 0.74/1.16 demodulation time 0.01
% 0.74/1.16 orient time 0.00
% 0.74/1.16 weigh time 0.00
% 0.74/1.16 forward subsume time 0.00
% 0.74/1.16 back demod find time 0.00
% 0.74/1.16 conflict time 0.00
% 0.74/1.16 LRPO time 0.00
% 0.74/1.16 store clause time 0.01
% 0.74/1.16 disable clause time 0.00
% 0.74/1.16 prime paramod time 0.00
% 0.74/1.16 semantics time 0.00
% 0.74/1.16
% 0.74/1.16 EQP interrupted
%------------------------------------------------------------------------------