%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP565-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.67s 1.07s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 3 RR)
% Number of literals : 17 ( 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 : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 36 ( 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('GRP565-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP565-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP565-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(identity,identity),identity),
inference(demod,[status(thm),theory(equality)],[3,2,4]),
[iquote('demod([3,2,4])')] ).
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(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(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(27,plain,
equal(double_divide(identity,identity),identity),
inference(para,[status(thm),theory(equality)],[24,4]),
[iquote('para(24,4)')] ).
cnf(28,plain,
$false,
inference(conflict,[status(thm)],[27,5]),
[iquote('conflict(27,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP565-1 : TPTP v8.1.0. Released v2.6.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 : Tue Jun 14 08:59:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.67/1.07 ----- EQP 0.9e, May 2009 -----
% 0.67/1.07 The job began on n007.cluster.edu, Tue Jun 14 08:59:55 2022
% 0.67/1.07 The command was "./eqp09e".
% 0.67/1.07
% 0.67/1.07 set(prolog_style_variables).
% 0.67/1.07 set(lrpo).
% 0.67/1.07 set(basic_paramod).
% 0.67/1.07 set(functional_subsume).
% 0.67/1.07 set(ordered_paramod).
% 0.67/1.07 set(prime_paramod).
% 0.67/1.07 set(para_pairs).
% 0.67/1.07 assign(pick_given_ratio,4).
% 0.67/1.07 clear(print_kept).
% 0.67/1.07 clear(print_new_demod).
% 0.67/1.07 clear(print_back_demod).
% 0.67/1.07 clear(print_given).
% 0.67/1.07 assign(max_mem,64000).
% 0.67/1.07 end_of_commands.
% 0.67/1.07
% 0.67/1.07 Usable:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Sos:
% 0.67/1.07 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.67/1.07 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.67/1.07 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.67/1.07 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.67/1.07 0 (wt=-1) [] -(multiply(inverse(a1),a1) = identity).
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Demodulators:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Passive:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Starting to process input.
% 0.67/1.07
% 0.67/1.07 ** 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.67/1.07 1 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.67/1.07 2 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.67/1.07 3 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.67/1.07 4 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.67/1.07 ---------------- PROOF FOUND ----------------
% 0.67/1.07 % SZS status Unsatisfiable
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 After processing input:
% 0.67/1.07
% 0.67/1.07 Usable:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Sos:
% 0.67/1.07 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.67/1.07 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.67/1.07 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.67/1.07 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.67/1.07 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.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Demodulators:
% 0.67/1.07 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.67/1.07 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.67/1.07 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.67/1.07 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Passive:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 UNIT CONFLICT from 27 and 5 at 0.00 seconds.
% 0.67/1.07
% 0.67/1.07 ---------------- PROOF ----------------
% 0.67/1.07 % SZS output start Refutation
% See solution above
% 0.67/1.07 ------------ end of proof -------------
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 ------------- memory usage ------------
% 0.67/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.67/1.07 type (bytes each) gets frees in use avail bytes
% 0.67/1.07 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.67/1.07 term ( 16) 1911 1429 482 33 9.9 K
% 0.67/1.07 gen_ptr ( 8) 2616 596 2020 24 16.0 K
% 0.67/1.07 context ( 808) 1584 1582 2 2 3.2 K
% 0.67/1.07 trail ( 12) 87 87 0 5 0.1 K
% 0.67/1.07 bt_node ( 68) 711 704 7 8 1.0 K
% 0.67/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.67/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.67/1.07 ac_match_free_vars_pos (4020)
% 0.67/1.07 0 0 0 0 0.0 K
% 0.67/1.07 discrim ( 12) 443 242 201 178 4.4 K
% 0.67/1.07 flat ( 40) 3392 3392 0 33 1.3 K
% 0.67/1.07 discrim_pos ( 12) 41 41 0 1 0.0 K
% 0.67/1.07 fpa_head ( 12) 227 0 227 0 2.7 K
% 0.67/1.07 fpa_tree ( 28) 123 123 0 15 0.4 K
% 0.67/1.07 fpa_pos ( 36) 44 44 0 1 0.0 K
% 0.67/1.07 literal ( 12) 81 54 27 1 0.3 K
% 0.67/1.07 clause ( 24) 81 54 27 1 0.7 K
% 0.67/1.07 list ( 12) 76 20 56 3 0.7 K
% 0.67/1.07 list_pos ( 20) 129 65 64 19 1.6 K
% 0.67/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.67/1.07
% 0.67/1.07 -------------- statistics -------------
% 0.67/1.07 Clauses input 5
% 0.67/1.07 Usable input 0
% 0.67/1.07 Sos input 5
% 0.67/1.07 Demodulators input 0
% 0.67/1.07 Passive input 0
% 0.67/1.07
% 0.67/1.07 Processed BS (before search) 5
% 0.67/1.07 Forward subsumed BS 0
% 0.67/1.07 Kept BS 5
% 0.67/1.07 New demodulators BS 4
% 0.67/1.07 Back demodulated BS 0
% 0.67/1.07
% 0.67/1.07 Clauses or pairs given 44
% 0.67/1.07 Clauses generated 45
% 0.67/1.07 Forward subsumed 23
% 0.67/1.07 Deleted by weight 0
% 0.67/1.07 Deleted by variable count 0
% 0.67/1.07 Kept 22
% 0.67/1.07 New demodulators 13
% 0.67/1.07 Back demodulated 13
% 0.67/1.07 Ordered paramod prunes 0
% 0.67/1.07 Basic paramod prunes 51
% 0.67/1.07 Prime paramod prunes 0
% 0.67/1.07 Semantic prunes 0
% 0.67/1.07
% 0.67/1.07 Rewrite attmepts 726
% 0.67/1.07 Rewrites 36
% 0.67/1.07
% 0.67/1.07 FPA overloads 0
% 0.67/1.07 FPA underloads 0
% 0.67/1.07
% 0.67/1.07 Usable size 0
% 0.67/1.07 Sos size 13
% 0.67/1.07 Demodulators size 12
% 0.67/1.07 Passive size 0
% 0.67/1.07 Disabled size 13
% 0.67/1.07
% 0.67/1.07 Proofs found 1
% 0.67/1.07
% 0.67/1.07 ----------- times (seconds) ----------- Tue Jun 14 08:59:55 2022
% 0.67/1.07
% 0.67/1.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.67/1.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.67/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.67/1.07 input time 0.00
% 0.67/1.07 paramodulation time 0.00
% 0.67/1.07 demodulation time 0.00
% 0.67/1.07 orient time 0.00
% 0.67/1.07 weigh time 0.00
% 0.67/1.07 forward subsume time 0.00
% 0.67/1.07 back demod find time 0.00
% 0.67/1.07 conflict time 0.00
% 0.67/1.07 LRPO time 0.00
% 0.67/1.07 store clause time 0.00
% 0.67/1.07 disable clause time 0.00
% 0.67/1.07 prime paramod time 0.00
% 0.67/1.07 semantics time 0.00
% 0.67/1.07
% 0.67/1.07 EQP interrupted
%------------------------------------------------------------------------------