%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP552-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n023.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:56 EDT 2022
% Result : Unsatisfiable 0.76s 1.16s
% Output : Refutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 2 RR)
% Number of literals : 22 ( 0 equ; 1 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(identity,A),divide(divide(divide(B,A),C),B)),C),
file('GRP552-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
file('GRP552-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(divide(A,B),C),A)),divide(divide(C,D),divide(identity,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,B),divide(C,identity))),
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(identity,A),divide(B,identity))),divide(divide(B,C),divide(identity,A))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),7]),
[iquote('back_demod(6),demod([7])')] ).
cnf(9,plain,
equal(divide(divide(identity,A),divide(divide(identity,A),divide(B,identity))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),7]),
[iquote('back_demod(1),demod([7])')] ).
cnf(10,plain,
equal(divide(identity,divide(identity,divide(A,identity))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,9]),4]),
[iquote('para(4,9),demod([4])')] ).
cnf(11,plain,
equal(divide(divide(identity,A),divide(divide(identity,A),identity)),identity),
inference(para,[status(thm),theory(equality)],[4,9]),
[iquote('para(4,9)')] ).
cnf(12,plain,
equal(divide(A,divide(A,identity)),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,11]),10]),
[iquote('para(10,11),demod([10])')] ).
cnf(13,plain,
equal(divide(divide(identity,A),identity),divide(identity,A)),
inference(para,[status(thm),theory(equality)],[12,9]),
[iquote('para(12,9)')] ).
cnf(15,plain,
equal(divide(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,13]),10]),
[iquote('para(10,13),demod([10])')] ).
cnf(16,plain,
equal(divide(identity,divide(identity,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),15]),
[iquote('back_demod(10),demod([15])')] ).
cnf(17,plain,
equal(divide(divide(identity,A),divide(divide(identity,A),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),15]),
[iquote('back_demod(9),demod([15])')] ).
cnf(18,plain,
equal(divide(divide(identity,divide(divide(identity,A),B)),divide(divide(B,C),divide(identity,A))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),15]),
[iquote('back_demod(8),demod([15])')] ).
cnf(20,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,17]),16]),
[iquote('para(16,17),demod([16])')] ).
cnf(22,plain,
equal(divide(divide(identity,divide(divide(identity,A),B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,18]),20]),
[iquote('para(4,18),demod([20])')] ).
cnf(24,plain,
equal(divide(divide(identity,divide(A,B)),divide(identity,A)),B),
inference(para,[status(thm),theory(equality)],[20,22]),
[iquote('para(20,22)')] ).
cnf(32,plain,
equal(divide(divide(identity,A),divide(identity,B)),divide(B,A)),
inference(para,[status(thm),theory(equality)],[20,24]),
[iquote('para(20,24)')] ).
cnf(44,plain,
equal(divide(A,divide(identity,B)),divide(B,divide(identity,A))),
inference(para,[status(thm),theory(equality)],[20,32]),
[iquote('para(20,32)')] ).
cnf(45,plain,
$false,
inference(conflict,[status(thm)],[44,5]),
[iquote('conflict(44,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP552-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % 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 15:57:21 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.76/1.16 ----- EQP 0.9e, May 2009 -----
% 0.76/1.16 The job began on n023.cluster.edu, Mon Jun 13 15:57:21 2022
% 0.76/1.16 The command was "./eqp09e".
% 0.76/1.16
% 0.76/1.16 set(prolog_style_variables).
% 0.76/1.16 set(lrpo).
% 0.76/1.16 set(basic_paramod).
% 0.76/1.16 set(functional_subsume).
% 0.76/1.16 set(ordered_paramod).
% 0.76/1.16 set(prime_paramod).
% 0.76/1.16 set(para_pairs).
% 0.76/1.16 assign(pick_given_ratio,4).
% 0.76/1.16 clear(print_kept).
% 0.76/1.16 clear(print_new_demod).
% 0.76/1.16 clear(print_back_demod).
% 0.76/1.16 clear(print_given).
% 0.76/1.16 assign(max_mem,64000).
% 0.76/1.16 end_of_commands.
% 0.76/1.16
% 0.76/1.16 Usable:
% 0.76/1.16 end_of_list.
% 0.76/1.16
% 0.76/1.16 Sos:
% 0.76/1.16 0 (wt=-1) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.76/1.16 0 (wt=-1) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.76/1.16 0 (wt=-1) [] inverse(A) = divide(identity,A).
% 0.76/1.16 0 (wt=-1) [] identity = divide(A,A).
% 0.76/1.16 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.76/1.16 end_of_list.
% 0.76/1.16
% 0.76/1.16 Demodulators:
% 0.76/1.16 end_of_list.
% 0.76/1.16
% 0.76/1.16 Passive:
% 0.76/1.16 end_of_list.
% 0.76/1.16
% 0.76/1.16 Starting to process input.
% 0.76/1.16
% 0.76/1.16 ** KEPT: 1 (wt=13) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.76/1.16 1 is a new demodulator.
% 0.76/1.16
% 0.76/1.16 ** KEPT: 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.76/1.16 2 is a new demodulator.
% 0.76/1.16
% 0.76/1.16 ** KEPT: 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.76/1.16 3 is a new demodulator.
% 0.76/1.16
% 0.76/1.16 ** KEPT: 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.76/1.16 4 is a new demodulator.
% 0.76/1.16
% 0.76/1.16 ** KEPT: 5 (wt=11) [demod([2,2])] -(divide(a,divide(identity,b)) = divide(b,divide(identity,a))).
% 0.76/1.16 ---------------- PROOF FOUND ----------------
% 0.76/1.16 % SZS status Unsatisfiable
% 0.76/1.16
% 0.76/1.16
% 0.76/1.16 After processing input:
% 0.76/1.16
% 0.76/1.16 Usable:
% 0.76/1.16 end_of_list.
% 0.76/1.16
% 0.76/1.16 Sos:
% 0.76/1.16 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.76/1.16 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.76/1.16 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.76/1.16 5 (wt=11) [demod([2,2])] -(divide(a,divide(identity,b)) = divide(b,divide(identity,a))).
% 0.76/1.16 1 (wt=13) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.76/1.16 end_of_list.
% 0.76/1.16
% 0.76/1.16 Demodulators:
% 0.76/1.16 1 (wt=13) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.76/1.16 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.76/1.16 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.76/1.16 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.76/1.16 end_of_list.
% 0.76/1.16
% 0.76/1.16 Passive:
% 0.76/1.16 end_of_list.
% 0.76/1.16
% 0.76/1.16 UNIT CONFLICT from 44 and 5 at 0.00 seconds.
% 0.76/1.16
% 0.76/1.16 ---------------- PROOF ----------------
% 0.76/1.16 % SZS output start Refutation
% See solution above
% 0.76/1.16 ------------ end of proof -------------
% 0.76/1.16
% 0.76/1.16
% 0.76/1.16 ------------- memory usage ------------
% 0.76/1.16 Memory dynamically allocated (tp_alloc): 488.
% 0.76/1.16 type (bytes each) gets frees in use avail bytes
% 0.76/1.16 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.76/1.16 term ( 16) 2973 2404 569 20 11.3 K
% 0.76/1.16 gen_ptr ( 8) 3116 1031 2085 21 16.5 K
% 0.76/1.16 context ( 808) 2464 2462 2 3 3.9 K
% 0.76/1.16 trail ( 12) 166 166 0 4 0.0 K
% 0.76/1.16 bt_node ( 68) 972 969 3 12 1.0 K
% 0.76/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.76/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.76/1.16 ac_match_free_vars_pos (4020)
% 0.76/1.16 0 0 0 0 0.0 K
% 0.76/1.16 discrim ( 12) 528 263 265 49 3.7 K
% 0.76/1.16 flat ( 40) 4260 4260 0 27 1.1 K
% 0.76/1.16 discrim_pos ( 12) 143 143 0 1 0.0 K
% 0.76/1.16 fpa_head ( 12) 199 0 199 0 2.3 K
% 0.76/1.16 fpa_tree ( 28) 145 145 0 13 0.4 K
% 0.76/1.16 fpa_pos ( 36) 77 77 0 1 0.0 K
% 0.76/1.16 literal ( 12) 185 141 44 1 0.5 K
% 0.76/1.16 clause ( 24) 185 141 44 1 1.1 K
% 0.76/1.16 list ( 12) 92 36 56 3 0.7 K
% 0.76/1.16 list_pos ( 20) 205 98 107 6 2.2 K
% 0.76/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.76/1.16
% 0.76/1.16 -------------- statistics -------------
% 0.76/1.16 Clauses input 5
% 0.76/1.16 Usable input 0
% 0.76/1.16 Sos input 5
% 0.76/1.16 Demodulators input 0
% 0.76/1.16 Passive input 0
% 0.76/1.16
% 0.76/1.16 Processed BS (before search) 5
% 0.76/1.16 Forward subsumed BS 0
% 0.76/1.16 Kept BS 5
% 0.76/1.16 New demodulators BS 4
% 0.76/1.16 Back demodulated BS 0
% 0.76/1.16
% 0.76/1.16 Clauses or pairs given 114
% 0.76/1.16 Clauses generated 126
% 0.76/1.16 Forward subsumed 87
% 0.76/1.16 Deleted by weight 0
% 0.76/1.16 Deleted by variable count 0
% 0.76/1.16 Kept 39
% 0.76/1.16 New demodulators 29
% 0.76/1.16 Back demodulated 19
% 0.76/1.16 Ordered paramod prunes 0
% 0.76/1.16 Basic paramod prunes 163
% 0.76/1.16 Prime paramod prunes 11
% 0.76/1.16 Semantic prunes 0
% 0.76/1.16
% 0.76/1.16 Rewrite attmepts 1101
% 0.76/1.16 Rewrites 122
% 0.76/1.16
% 0.76/1.16 FPA overloads 0
% 0.76/1.16 FPA underloads 0
% 0.76/1.16
% 0.76/1.16 Usable size 0
% 0.76/1.16 Sos size 24
% 0.76/1.16 Demodulators size 16
% 0.76/1.16 Passive size 0
% 0.76/1.16 Disabled size 19
% 0.76/1.16
% 0.76/1.16 Proofs found 1
% 0.76/1.16
% 0.76/1.16 ----------- times (seconds) ----------- Mon Jun 13 15:57:21 2022
% 0.76/1.16
% 0.76/1.16 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.76/1.16 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.76/1.16 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.76/1.16 input time 0.00
% 0.76/1.16 paramodulation time 0.00
% 0.76/1.16 demodulation time 0.00
% 0.76/1.16 orient time 0.00
% 0.76/1.16 weigh time 0.00
% 0.76/1.16 forward subsume time 0.00
% 0.76/1.16 back demod find time 0.00
% 0.76/1.16 conflict time 0.00
% 0.76/1.16 LRPO time 0.00
% 0.76/1.16 store clause time 0.00
% 0.76/1.16 disable clause time 0.00
% 0.76/1.16 prime paramod time 0.00
% 0.76/1.16 semantics time 0.00
% 0.76/1.16
% 0.76/1.16 EQP interrupted
%------------------------------------------------------------------------------