%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP525-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:47:49 EDT 2022
% Result : Unsatisfiable 0.45s 0.87s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 2 RR)
% Number of literals : 12 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,divide(divide(A,B),divide(C,B))),C),
file('GRP525-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP525-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(4,plain,
equal(inverse(A),divide(divide(B,B),A)),
file('GRP525-1.p',unknown),
[] ).
cnf(5,plain,
equal(divide(divide(A,A),B),inverse(B)),
inference(flip,[status(thm),theory(equality)],[4]),
[iquote('flip(4)')] ).
cnf(6,plain,
~ equal(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(divide(divide(A,A),B),divide(divide(C,C),B)),
inference(para,[status(thm),theory(equality)],[4,4]),
[iquote('para(4,4)')] ).
cnf(54,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(66,plain,
equal(divide(A,A),divide(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,1]),1]),
[iquote('para(7,1),demod([1])')] ).
cnf(69,plain,
equal(divide(A,A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[66,54]),
[iquote('para(66,54)')] ).
cnf(102,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[69,54]),
[iquote('para(69,54)')] ).
cnf(103,plain,
$false,
inference(conflict,[status(thm)],[102,6]),
[iquote('conflict(102,6)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : GRP525-1 : TPTP v8.1.0. Released v2.6.0.
% 0.05/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 08:45:11 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.45/0.87 ----- EQP 0.9e, May 2009 -----
% 0.45/0.87 The job began on n032.cluster.edu, Mon Jun 13 08:45:12 2022
% 0.45/0.87 The command was "./eqp09e".
% 0.45/0.87
% 0.45/0.87 set(prolog_style_variables).
% 0.45/0.87 set(lrpo).
% 0.45/0.87 set(basic_paramod).
% 0.45/0.87 set(functional_subsume).
% 0.45/0.87 set(ordered_paramod).
% 0.45/0.87 set(prime_paramod).
% 0.45/0.87 set(para_pairs).
% 0.45/0.87 assign(pick_given_ratio,4).
% 0.45/0.87 clear(print_kept).
% 0.45/0.87 clear(print_new_demod).
% 0.45/0.87 clear(print_back_demod).
% 0.45/0.87 clear(print_given).
% 0.45/0.87 assign(max_mem,64000).
% 0.45/0.87 end_of_commands.
% 0.45/0.87
% 0.45/0.87 Usable:
% 0.45/0.87 end_of_list.
% 0.45/0.87
% 0.45/0.87 Sos:
% 0.45/0.87 0 (wt=-1) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.45/0.87 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.45/0.87 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.45/0.87 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.45/0.87 end_of_list.
% 0.45/0.87
% 0.45/0.87 Demodulators:
% 0.45/0.87 end_of_list.
% 0.45/0.87
% 0.45/0.87 Passive:
% 0.45/0.87 end_of_list.
% 0.45/0.87
% 0.45/0.87 Starting to process input.
% 0.45/0.87
% 0.45/0.87 ** KEPT: 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.45/0.87 1 is a new demodulator.
% 0.45/0.87
% 0.45/0.87 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.45/0.87
% 0.45/0.87 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.45/0.87 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.45/0.87
% 0.45/0.87 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.45/0.87
% 0.45/0.87 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.45/0.87 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.45/0.87
% 0.45/0.87 ** KEPT: 6 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.45/0.87 ---------------- PROOF FOUND ----------------
% 0.45/0.87 % SZS status Unsatisfiable
% 0.45/0.87
% 0.45/0.87
% 0.45/0.87 After processing input:
% 0.45/0.87
% 0.45/0.87 Usable:
% 0.45/0.87 end_of_list.
% 0.45/0.87
% 0.45/0.87 Sos:
% 0.45/0.87 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.45/0.87 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.45/0.87 6 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.45/0.87 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.45/0.87 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.45/0.87 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.45/0.87 end_of_list.
% 0.45/0.87
% 0.45/0.87 Demodulators:
% 0.45/0.87 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.45/0.87 end_of_list.
% 0.45/0.87
% 0.45/0.87 Passive:
% 0.45/0.87 end_of_list.
% 0.45/0.87
% 0.45/0.87 UNIT CONFLICT from 102 and 6 at 0.00 seconds.
% 0.45/0.87
% 0.45/0.87 ---------------- PROOF ----------------
% 0.45/0.87 % SZS output start Refutation
% See solution above
% 0.45/0.87 ------------ end of proof -------------
% 0.45/0.87
% 0.45/0.87
% 0.45/0.87 ------------- memory usage ------------
% 0.45/0.87 Memory dynamically allocated (tp_alloc): 488.
% 0.45/0.87 type (bytes each) gets frees in use avail bytes
% 0.45/0.87 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.45/0.87 term ( 16) 4105 2946 1159 14 22.5 K
% 0.45/0.87 gen_ptr ( 8) 4876 912 3964 11 31.1 K
% 0.45/0.87 context ( 808) 2866 2864 2 2 3.2 K
% 0.45/0.87 trail ( 12) 271 271 0 4 0.0 K
% 0.45/0.87 bt_node ( 68) 830 827 3 6 0.6 K
% 0.45/0.87 ac_position (285432) 0 0 0 0 0.0 K
% 0.45/0.87 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.45/0.87 ac_match_free_vars_pos (4020)
% 0.45/0.87 0 0 0 0 0.0 K
% 0.45/0.87 discrim ( 12) 814 205 609 58 7.8 K
% 0.45/0.87 flat ( 40) 6508 6508 0 16 0.6 K
% 0.45/0.87 discrim_pos ( 12) 149 149 0 1 0.0 K
% 0.45/0.87 fpa_head ( 12) 498 0 498 0 5.8 K
% 0.45/0.88 fpa_tree ( 28) 187 187 0 17 0.5 K
% 0.45/0.88 fpa_pos ( 36) 134 134 0 1 0.0 K
% 0.45/0.88 literal ( 12) 409 307 102 1 1.2 K
% 0.45/0.88 clause ( 24) 409 307 102 1 2.4 K
% 0.45/0.88 list ( 12) 91 35 56 4 0.7 K
% 0.45/0.88 list_pos ( 20) 401 127 274 0 5.4 K
% 0.45/0.88 pair_index ( 40) 2 0 2 0 0.1 K
% 0.45/0.88
% 0.45/0.88 -------------- statistics -------------
% 0.45/0.88 Clauses input 4
% 0.45/0.88 Usable input 0
% 0.45/0.88 Sos input 4
% 0.45/0.88 Demodulators input 0
% 0.45/0.88 Passive input 0
% 0.45/0.88
% 0.45/0.88 Processed BS (before search) 8
% 0.45/0.88 Forward subsumed BS 2
% 0.45/0.88 Kept BS 6
% 0.45/0.88 New demodulators BS 1
% 0.45/0.88 Back demodulated BS 0
% 0.45/0.88
% 0.45/0.88 Clauses or pairs given 236
% 0.45/0.88 Clauses generated 215
% 0.45/0.88 Forward subsumed 119
% 0.45/0.88 Deleted by weight 0
% 0.45/0.88 Deleted by variable count 0
% 0.45/0.88 Kept 96
% 0.45/0.88 New demodulators 31
% 0.45/0.88 Back demodulated 29
% 0.45/0.88 Ordered paramod prunes 0
% 0.45/0.88 Basic paramod prunes 284
% 0.45/0.88 Prime paramod prunes 3
% 0.45/0.88 Semantic prunes 0
% 0.45/0.88
% 0.45/0.88 Rewrite attmepts 1304
% 0.45/0.88 Rewrites 57
% 0.45/0.88
% 0.45/0.88 FPA overloads 0
% 0.45/0.88 FPA underloads 0
% 0.45/0.88
% 0.45/0.88 Usable size 0
% 0.45/0.88 Sos size 72
% 0.45/0.88 Demodulators size 29
% 0.45/0.88 Passive size 0
% 0.45/0.88 Disabled size 29
% 0.45/0.88
% 0.45/0.88 Proofs found 1
% 0.45/0.88
% 0.45/0.88 ----------- times (seconds) ----------- Mon Jun 13 08:45:12 2022
% 0.45/0.88
% 0.45/0.88 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.45/0.88 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.45/0.88 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.45/0.88 input time 0.00
% 0.45/0.88 paramodulation time 0.00
% 0.45/0.88 demodulation time 0.00
% 0.45/0.88 orient time 0.00
% 0.45/0.88 weigh time 0.00
% 0.45/0.88 forward subsume time 0.00
% 0.45/0.88 back demod find time 0.00
% 0.45/0.88 conflict time 0.00
% 0.45/0.88 LRPO time 0.00
% 0.45/0.88 store clause time 0.00
% 0.45/0.88 disable clause time 0.00
% 0.45/0.88 prime paramod time 0.00
% 0.45/0.88 semantics time 0.00
% 0.45/0.88
% 0.45/0.88 EQP interrupted
%------------------------------------------------------------------------------