%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP566-1 : TPTP v8.1.0. Released v2.6.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:48:00 EDT 2022
% Result : Unsatisfiable 0.46s 1.11s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 3 RR)
% Number of literals : 24 ( 0 equ; 1 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 : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(identity,identity)),B),
file('GRP566-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP566-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP566-1.p',unknown),
[] ).
cnf(4,plain,
equal(double_divide(A,double_divide(A,identity)),identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),1]),
[iquote('demod([3]),flip(1)')] ).
cnf(5,plain,
~ equal(double_divide(double_divide(a2,identity),identity),a2),
inference(demod,[status(thm),theory(equality)],[2]),
[iquote('demod([2])')] ).
cnf(6,plain,
equal(double_divide(double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(double_divide(D,B),identity)),double_divide(identity,identity)),D),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),4]),
[iquote('para(1,1),demod([4])')] ).
cnf(7,plain,
equal(double_divide(double_divide(identity,double_divide(A,double_divide(identity,identity))),double_divide(identity,identity)),double_divide(B,double_divide(double_divide(A,double_divide(B,C)),double_divide(identity,C)))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(8,plain,
equal(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(double_divide(identity,double_divide(B,double_divide(identity,identity))),double_divide(identity,identity))),
inference(flip,[status(thm),theory(equality)],[7]),
[iquote('flip(7)')] ).
cnf(9,plain,
equal(double_divide(double_divide(A,double_divide(double_divide(B,identity),double_divide(identity,double_divide(A,identity)))),double_divide(identity,identity)),B),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(10,plain,
equal(double_divide(double_divide(A,identity),double_divide(identity,identity)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),4]),
[iquote('para(4,1),demod([4])')] ).
cnf(13,plain,
equal(double_divide(double_divide(identity,double_divide(A,double_divide(identity,identity))),double_divide(identity,identity)),double_divide(double_divide(B,double_divide(double_divide(C,double_divide(B,D)),double_divide(identity,D))),double_divide(double_divide(A,C),identity))),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(14,plain,
equal(double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(double_divide(D,B),identity)),double_divide(double_divide(identity,double_divide(D,double_divide(identity,identity))),double_divide(identity,identity))),
inference(flip,[status(thm),theory(equality)],[13]),
[iquote('flip(13)')] ).
cnf(17,plain,
equal(double_divide(double_divide(double_divide(A,double_divide(double_divide(double_divide(identity,identity),double_divide(A,B)),double_divide(identity,B))),double_divide(C,identity)),double_divide(identity,identity)),double_divide(D,double_divide(double_divide(C,double_divide(D,E)),double_divide(identity,E)))),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(18,plain,
equal(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(double_divide(double_divide(D,double_divide(double_divide(double_divide(identity,identity),double_divide(D,E)),double_divide(identity,E))),double_divide(B,identity)),double_divide(identity,identity))),
inference(flip,[status(thm),theory(equality)],[17]),
[iquote('flip(17)')] ).
cnf(19,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(A,identity),identity)),double_divide(identity,identity)),A),
inference(para,[status(thm),theory(equality)],[4,9]),
[iquote('para(4,9)')] ).
cnf(21,plain,
equal(double_divide(double_divide(identity,double_divide(A,double_divide(identity,identity))),double_divide(identity,identity)),double_divide(A,identity)),
inference(para,[status(thm),theory(equality)],[10,1]),
[iquote('para(10,1)')] ).
cnf(22,plain,
equal(double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(double_divide(D,B),identity)),double_divide(D,identity)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),21]),
[iquote('back_demod(14),demod([21])')] ).
cnf(23,plain,
equal(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(B,identity)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),21]),
[iquote('back_demod(8),demod([21])')] ).
cnf(24,plain,
equal(double_divide(double_divide(A,identity),double_divide(double_divide(B,A),identity)),double_divide(B,identity)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[22]),23]),
[iquote('back_demod(22),demod([23])')] ).
cnf(25,plain,
equal(double_divide(double_divide(double_divide(double_divide(identity,identity),identity),double_divide(A,identity)),double_divide(identity,identity)),double_divide(A,identity)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[18]),23,23]),1]),
[iquote('back_demod(18),demod([23,23]),flip(1)')] ).
cnf(27,plain,
equal(double_divide(identity,identity),identity),
inference(para,[status(thm),theory(equality)],[24,4]),
[iquote('para(24,4)')] ).
cnf(29,plain,
equal(double_divide(double_divide(identity,double_divide(A,identity)),identity),double_divide(A,identity)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[25]),27,27,27]),
[iquote('back_demod(25),demod([27,27,27])')] ).
cnf(30,plain,
equal(double_divide(double_divide(A,identity),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[19]),27,29]),
[iquote('back_demod(19),demod([27,29])')] ).
cnf(31,plain,
$false,
inference(conflict,[status(thm)],[30,5]),
[iquote('conflict(30,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP566-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 01:21:09 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.11 ----- EQP 0.9e, May 2009 -----
% 0.46/1.11 The job began on n007.cluster.edu, Tue Jun 14 01:21:10 2022
% 0.46/1.11 The command was "./eqp09e".
% 0.46/1.11
% 0.46/1.11 set(prolog_style_variables).
% 0.46/1.11 set(lrpo).
% 0.46/1.11 set(basic_paramod).
% 0.46/1.11 set(functional_subsume).
% 0.46/1.11 set(ordered_paramod).
% 0.46/1.11 set(prime_paramod).
% 0.46/1.11 set(para_pairs).
% 0.46/1.11 assign(pick_given_ratio,4).
% 0.46/1.11 clear(print_kept).
% 0.46/1.11 clear(print_new_demod).
% 0.46/1.11 clear(print_back_demod).
% 0.46/1.11 clear(print_given).
% 0.46/1.11 assign(max_mem,64000).
% 0.46/1.11 end_of_commands.
% 0.46/1.11
% 0.46/1.11 Usable:
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Sos:
% 0.46/1.11 0 (wt=-1) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(identity,identity)) = B.
% 0.46/1.11 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.46/1.11 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.46/1.11 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.46/1.11 0 (wt=-1) [] -(multiply(identity,a2) = a2).
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Demodulators:
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Passive:
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Starting to process input.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(identity,identity)) = B.
% 0.46/1.11 1 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.46/1.11 2 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.46/1.11 3 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.46/1.11 4 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.46/1.11 ---------------- PROOF FOUND ----------------
% 0.46/1.11 % SZS status Unsatisfiable
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 After processing input:
% 0.46/1.11
% 0.46/1.11 Usable:
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Sos:
% 0.46/1.11 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.46/1.11 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.46/1.11 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.46/1.11 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.46/1.11 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(identity,identity)) = B.
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Demodulators:
% 0.46/1.11 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(identity,C))),double_divide(identity,identity)) = B.
% 0.46/1.11 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.46/1.11 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.46/1.11 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Passive:
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 UNIT CONFLICT from 30 and 5 at 0.00 seconds.
% 0.46/1.11
% 0.46/1.11 ---------------- PROOF ----------------
% 0.46/1.11 % SZS output start Refutation
% See solution above
% 0.46/1.11 ------------ end of proof -------------
% 0.46/1.11
% 0.46/1.11
% 0.46/1.11 ------------- memory usage ------------
% 0.46/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.46/1.11 type (bytes each) gets frees in use avail bytes
% 0.46/1.11 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.46/1.11 term ( 16) 2115 1602 513 35 10.6 K
% 0.46/1.11 gen_ptr ( 8) 2839 719 2120 23 16.7 K
% 0.46/1.11 context ( 808) 1663 1661 2 2 3.2 K
% 0.46/1.11 trail ( 12) 91 91 0 5 0.1 K
% 0.46/1.11 bt_node ( 68) 722 715 7 8 1.0 K
% 0.46/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.46/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.46/1.11 ac_match_free_vars_pos (4020)
% 0.46/1.11 0 0 0 0 0.0 K
% 0.46/1.11 discrim ( 12) 468 310 158 223 4.5 K
% 0.46/1.11 flat ( 40) 3565 3565 0 33 1.3 K
% 0.46/1.11 discrim_pos ( 12) 48 48 0 1 0.0 K
% 0.46/1.11 fpa_head ( 12) 234 0 234 0 2.7 K
% 0.46/1.11 fpa_tree ( 28) 135 135 0 15 0.4 K
% 0.46/1.11 fpa_pos ( 36) 50 50 0 1 0.0 K
% 0.46/1.11 literal ( 12) 90 60 30 1 0.4 K
% 0.46/1.11 clause ( 24) 90 60 30 1 0.7 K
% 0.46/1.11 list ( 12) 79 22 57 2 0.7 K
% 0.46/1.11 list_pos ( 20) 152 85 67 16 1.6 K
% 0.46/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.46/1.11
% 0.46/1.11 -------------- statistics -------------
% 0.46/1.11 Clauses input 5
% 0.46/1.11 Usable input 0
% 0.46/1.11 Sos input 5
% 0.46/1.11 Demodulators input 0
% 0.46/1.11 Passive input 0
% 0.46/1.11
% 0.46/1.11 Processed BS (before search) 5
% 0.46/1.11 Forward subsumed BS 0
% 0.46/1.11 Kept BS 5
% 0.46/1.11 New demodulators BS 4
% 0.46/1.11 Back demodulated BS 0
% 0.46/1.11
% 0.46/1.11 Clauses or pairs given 42
% 0.46/1.11 Clauses generated 49
% 0.46/1.11 Forward subsumed 24
% 0.46/1.11 Deleted by weight 0
% 0.46/1.11 Deleted by variable count 0
% 0.46/1.11 Kept 25
% 0.46/1.11 New demodulators 16
% 0.46/1.11 Back demodulated 17
% 0.46/1.11 Ordered paramod prunes 0
% 0.46/1.11 Basic paramod prunes 51
% 0.46/1.11 Prime paramod prunes 0
% 0.46/1.11 Semantic prunes 0
% 0.46/1.11
% 0.46/1.11 Rewrite attmepts 781
% 0.46/1.11 Rewrites 43
% 0.46/1.11
% 0.46/1.11 FPA overloads 0
% 0.46/1.11 FPA underloads 0
% 0.46/1.11
% 0.46/1.11 Usable size 0
% 0.46/1.11 Sos size 12
% 0.46/1.11 Demodulators size 11
% 0.46/1.11 Passive size 0
% 0.46/1.11 Disabled size 17
% 0.46/1.11
% 0.46/1.11 Proofs found 1
% 0.46/1.11
% 0.46/1.11 ----------- times (seconds) ----------- Tue Jun 14 01:21:10 2022
% 0.46/1.11
% 0.46/1.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.46/1.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.46/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.46/1.11 input time 0.00
% 0.46/1.11 paramodulation time 0.00
% 0.46/1.11 demodulation time 0.00
% 0.46/1.11 orient time 0.00
% 0.46/1.11 weigh time 0.00
% 0.46/1.11 forward subsume time 0.00
% 0.46/1.11 back demod find time 0.00
% 0.46/1.11 conflict time 0.00
% 0.46/1.11 LRPO time 0.00
% 0.46/1.11 store clause time 0.00
% 0.46/1.11 disable clause time 0.00
% 0.46/1.11 prime paramod time 0.00
% 0.46/1.11 semantics time 0.00
% 0.46/1.11
% 0.46/1.11 EQP interrupted
%------------------------------------------------------------------------------