%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP589-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n032.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:06 EDT 2022
% Result : Unsatisfiable 0.49s 0.90s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 2 RR)
% Number of literals : 13 ( 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 : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B),C),
file('GRP589-1.p',unknown),
[] ).
cnf(2,plain,
equal(inverse(double_divide(A,B)),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2]),
[iquote('back_demod(1),demod([2,2])')] ).
cnf(4,plain,
~ equal(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(6,plain,
equal(multiply(A,multiply(multiply(inverse(B),C),double_divide(C,A))),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(7,plain,
equal(double_divide(multiply(multiply(inverse(A),multiply(multiply(inverse(B),C),double_divide(C,D))),B),D),A),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(22,plain,
equal(double_divide(multiply(inverse(A),A),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[6,7]),
[iquote('para(6,7)')] ).
cnf(23,plain,
equal(multiply(inverse(A),multiply(inverse(B),B)),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,2]),1]),
[iquote('para(22,2),flip(1)')] ).
cnf(25,plain,
equal(double_divide(inverse(multiply(inverse(A),A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[23,22]),
[iquote('para(23,22)')] ).
cnf(33,plain,
equal(double_divide(multiply(inverse(A),B),inverse(B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,3]),23]),
[iquote('para(22,3),demod([23])')] ).
cnf(36,plain,
equal(double_divide(inverse(A),inverse(multiply(inverse(B),B))),A),
inference(para,[status(thm),theory(equality)],[23,33]),
[iquote('para(23,33)')] ).
cnf(43,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[36,25]),
[iquote('para(36,25)')] ).
cnf(44,plain,
$false,
inference(conflict,[status(thm)],[43,4]),
[iquote('conflict(43,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : GRP589-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.10 % Command : tptp2X_and_run_eqp %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Mon Jun 13 13:34:56 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.49/0.90 ----- EQP 0.9e, May 2009 -----
% 0.49/0.90 The job began on n032.cluster.edu, Mon Jun 13 13:34:57 2022
% 0.49/0.90 The command was "./eqp09e".
% 0.49/0.90
% 0.49/0.90 set(prolog_style_variables).
% 0.49/0.90 set(lrpo).
% 0.49/0.90 set(basic_paramod).
% 0.49/0.90 set(functional_subsume).
% 0.49/0.90 set(ordered_paramod).
% 0.49/0.90 set(prime_paramod).
% 0.49/0.90 set(para_pairs).
% 0.49/0.90 assign(pick_given_ratio,4).
% 0.49/0.90 clear(print_kept).
% 0.49/0.90 clear(print_new_demod).
% 0.49/0.90 clear(print_back_demod).
% 0.49/0.90 clear(print_given).
% 0.49/0.90 assign(max_mem,64000).
% 0.49/0.90 end_of_commands.
% 0.49/0.90
% 0.49/0.90 Usable:
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Sos:
% 0.49/0.90 0 (wt=-1) [] double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C.
% 0.49/0.90 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.49/0.90 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Demodulators:
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Passive:
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Starting to process input.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C.
% 0.49/0.90 1 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.49/0.90 2 is a new demodulator.
% 0.49/0.90 -> 2 back demodulating 1.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.49/0.90 3 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.49/0.90 ---------------- PROOF FOUND ----------------
% 0.49/0.90 % SZS status Unsatisfiable
% 0.49/0.90
% 0.49/0.90
% 0.49/0.90 After processing input:
% 0.49/0.90
% 0.49/0.90 Usable:
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Sos:
% 0.49/0.90 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.49/0.90 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.49/0.90 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Demodulators:
% 0.49/0.90 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.49/0.90 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Passive:
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 UNIT CONFLICT from 43 and 4 at 0.00 seconds.
% 0.49/0.90
% 0.49/0.90 ---------------- PROOF ----------------
% 0.49/0.90 % SZS output start Refutation
% See solution above
% 0.49/0.90 ------------ end of proof -------------
% 0.49/0.90
% 0.49/0.90
% 0.49/0.90 ------------- memory usage ------------
% 0.49/0.90 Memory dynamically allocated (tp_alloc): 488.
% 0.49/0.90 type (bytes each) gets frees in use avail bytes
% 0.49/0.90 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.49/0.90 term ( 16) 2008 1337 671 18 13.3 K
% 0.49/0.90 gen_ptr ( 8) 3157 174 2983 12 23.4 K
% 0.49/0.90 context ( 808) 1614 1612 2 2 3.2 K
% 0.49/0.90 trail ( 12) 185 185 0 7 0.1 K
% 0.49/0.90 bt_node ( 68) 725 720 5 13 1.2 K
% 0.49/0.90 ac_position (285432) 0 0 0 0 0.0 K
% 0.49/0.90 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.49/0.90 ac_match_free_vars_pos (4020)
% 0.49/0.90 0 0 0 0 0.0 K
% 0.49/0.90 discrim ( 12) 738 25 713 0 8.4 K
% 0.49/0.90 flat ( 40) 2815 2815 0 22 0.9 K
% 0.49/0.90 discrim_pos ( 12) 17 17 0 1 0.0 K
% 0.49/0.90 fpa_head ( 12) 409 0 409 0 4.8 K
% 0.49/0.90 fpa_tree ( 28) 191 191 0 9 0.2 K
% 0.49/0.90 fpa_pos ( 36) 84 84 0 1 0.0 K
% 0.49/0.90 literal ( 12) 107 64 43 1 0.5 K
% 0.49/0.90 clause ( 24) 107 64 43 1 1.0 K
% 0.49/0.90 list ( 12) 100 44 56 4 0.7 K
% 0.49/0.90 list_pos ( 20) 172 8 164 0 3.2 K
% 0.49/0.90 pair_index ( 40) 2 0 2 0 0.1 K
% 0.49/0.90
% 0.49/0.90 -------------- statistics -------------
% 0.49/0.90 Clauses input 3
% 0.49/0.90 Usable input 0
% 0.49/0.90 Sos input 3
% 0.49/0.90 Demodulators input 0
% 0.49/0.90 Passive input 0
% 0.49/0.90
% 0.49/0.90 Processed BS (before search) 4
% 0.49/0.90 Forward subsumed BS 0
% 0.49/0.90 Kept BS 4
% 0.49/0.90 New demodulators BS 3
% 0.49/0.90 Back demodulated BS 1
% 0.49/0.90
% 0.49/0.90 Clauses or pairs given 98
% 0.49/0.90 Clauses generated 61
% 0.49/0.90 Forward subsumed 22
% 0.49/0.90 Deleted by weight 0
% 0.49/0.90 Deleted by variable count 0
% 0.49/0.90 Kept 39
% 0.49/0.90 New demodulators 38
% 0.49/0.90 Back demodulated 0
% 0.49/0.90 Ordered paramod prunes 0
% 0.49/0.90 Basic paramod prunes 345
% 0.49/0.90 Prime paramod prunes 0
% 0.49/0.90 Semantic prunes 0
% 0.49/0.90
% 0.49/0.90 Rewrite attmepts 489
% 0.49/0.90 Rewrites 17
% 0.49/0.90
% 0.49/0.90 FPA overloads 0
% 0.49/0.90 FPA underloads 0
% 0.49/0.90
% 0.49/0.90 Usable size 0
% 0.49/0.90 Sos size 41
% 0.49/0.90 Demodulators size 40
% 0.49/0.90 Passive size 0
% 0.49/0.90 Disabled size 1
% 0.49/0.90
% 0.49/0.90 Proofs found 1
% 0.49/0.90
% 0.49/0.90 ----------- times (seconds) ----------- Mon Jun 13 13:34:57 2022
% 0.49/0.90
% 0.49/0.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.49/0.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.49/0.90 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.49/0.90 input time 0.00
% 0.49/0.90 paramodulation time 0.00
% 0.49/0.90 demodulation time 0.00
% 0.49/0.90 orient time 0.00
% 0.49/0.90 weigh time 0.00
% 0.49/0.90 forward subsume time 0.00
% 0.49/0.90 back demod find time 0.00
% 0.49/0.90 conflict time 0.00
% 0.49/0.90 LRPO time 0.00
% 0.49/0.90 store clause time 0.00
% 0.49/0.90 disable clause time 0.00
% 0.49/0.90 prime paramod time 0.00
% 0.49/0.90 semantics time 0.00
% 0.49/0.90
% 0.49/0.90 EQP interrupted
%------------------------------------------------------------------------------