%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP526-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n006.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.43s 1.08s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 3 RR)
% Number of literals : 21 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 39 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,divide(divide(A,B),divide(C,B))),C),
file('GRP526-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP526-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('GRP526-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(multiply(inverse(b2),b2),a2),a2),
file('GRP526-1.p',unknown),
[] ).
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(45,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(47,plain,
equal(inverse(inverse(divide(A,divide(B,B)))),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[45,5]),1]),
[iquote('para(45,5),flip(1)')] ).
cnf(52,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(53,plain,
equal(multiply(A,B),divide(A,inverse(B))),
inference(flip,[status(thm),theory(equality)],[52]),
[iquote('flip(52)')] ).
cnf(60,plain,
equal(multiply(divide(A,A),B),inverse(inverse(B))),
inference(para,[status(thm),theory(equality)],[52,5]),
[iquote('para(52,5)')] ).
cnf(61,plain,
equal(inverse(inverse(A)),multiply(divide(B,B),A)),
inference(flip,[status(thm),theory(equality)],[60]),
[iquote('flip(60)')] ).
cnf(63,plain,
~ equal(multiply(divide(inverse(b2),inverse(b2)),a2),a2),
inference(para,[status(thm),theory(equality)],[53,6]),
[iquote('para(53,6)')] ).
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(67,plain,
equal(divide(A,A),inverse(divide(B,B))),
inference(para,[status(thm),theory(equality)],[66,5]),
[iquote('para(66,5)')] ).
cnf(68,plain,
equal(inverse(divide(A,A)),divide(B,B)),
inference(flip,[status(thm),theory(equality)],[67]),
[iquote('flip(67)')] ).
cnf(81,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[68,45]),
[iquote('para(68,45)')] ).
cnf(82,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[47]),81]),
[iquote('back_demod(47),demod([81])')] ).
cnf(83,plain,
equal(multiply(divide(A,A),B),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[61]),82]),1]),
[iquote('back_demod(61),demod([82]),flip(1)')] ).
cnf(84,plain,
$false,
inference(conflict,[status(thm)],[83,63]),
[iquote('conflict(83,63)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP526-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n006.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 09:26:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.08 ----- EQP 0.9e, May 2009 -----
% 0.43/1.08 The job began on n006.cluster.edu, Tue Jun 14 09:26:57 2022
% 0.43/1.08 The command was "./eqp09e".
% 0.43/1.08
% 0.43/1.08 set(prolog_style_variables).
% 0.43/1.08 set(lrpo).
% 0.43/1.08 set(basic_paramod).
% 0.43/1.08 set(functional_subsume).
% 0.43/1.08 set(ordered_paramod).
% 0.43/1.08 set(prime_paramod).
% 0.43/1.08 set(para_pairs).
% 0.43/1.08 assign(pick_given_ratio,4).
% 0.43/1.08 clear(print_kept).
% 0.43/1.08 clear(print_new_demod).
% 0.43/1.08 clear(print_back_demod).
% 0.43/1.08 clear(print_given).
% 0.43/1.08 assign(max_mem,64000).
% 0.43/1.08 end_of_commands.
% 0.43/1.08
% 0.43/1.08 Usable:
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Sos:
% 0.43/1.08 0 (wt=-1) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.43/1.08 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.43/1.08 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.43/1.08 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Demodulators:
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Passive:
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Starting to process input.
% 0.43/1.08
% 0.43/1.08 ** KEPT: 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.43/1.08 1 is a new demodulator.
% 0.43/1.08
% 0.43/1.08 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.43/1.08
% 0.43/1.08 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.43/1.08 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.43/1.08
% 0.43/1.08 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.43/1.08
% 0.43/1.08 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.43/1.08 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.43/1.08
% 0.43/1.08 ** KEPT: 6 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.43/1.08 ---------------- PROOF FOUND ----------------
% 0.43/1.08 % SZS status Unsatisfiable
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 After processing input:
% 0.43/1.08
% 0.43/1.08 Usable:
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Sos:
% 0.43/1.08 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.43/1.08 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.43/1.08 6 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.43/1.08 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.43/1.08 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.43/1.08 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Demodulators:
% 0.43/1.08 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Passive:
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 UNIT CONFLICT from 83 and 63 at 0.00 seconds.
% 0.43/1.08
% 0.43/1.08 ---------------- PROOF ----------------
% 0.43/1.08 % SZS output start Refutation
% See solution above
% 0.43/1.08 ------------ end of proof -------------
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 ------------- memory usage ------------
% 0.43/1.08 Memory dynamically allocated (tp_alloc): 488.
% 0.43/1.08 type (bytes each) gets frees in use avail bytes
% 0.43/1.08 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.43/1.08 term ( 16) 2965 2028 937 14 18.2 K
% 0.43/1.08 gen_ptr ( 8) 3568 357 3211 20 25.2 K
% 0.43/1.08 context ( 808) 1944 1942 2 2 3.2 K
% 0.43/1.08 trail ( 12) 174 174 0 4 0.0 K
% 0.43/1.08 bt_node ( 68) 528 524 4 5 0.6 K
% 0.43/1.08 ac_position (285432) 0 0 0 0 0.0 K
% 0.43/1.08 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.43/1.08 ac_match_free_vars_pos (4020)
% 0.43/1.08 0 0 0 0 0.0 K
% 0.43/1.08 discrim ( 12) 660 40 620 38 7.7 K
% 0.43/1.08 flat ( 40) 4376 4376 0 15 0.6 K
% 0.43/1.08 discrim_pos ( 12) 68 68 0 1 0.0 K
% 0.43/1.08 fpa_head ( 12) 495 0 495 0 5.8 K
% 0.43/1.08 fpa_tree ( 28) 103 103 0 11 0.3 K
% 0.43/1.08 fpa_pos ( 36) 101 101 0 1 0.0 K
% 0.43/1.08 literal ( 12) 292 209 83 1 1.0 K
% 0.43/1.08 clause ( 24) 292 209 83 1 2.0 K
% 0.43/1.08 list ( 12) 77 19 58 1 0.7 K
% 0.43/1.08 list_pos ( 20) 293 29 264 5 5.3 K
% 0.43/1.08 pair_index ( 40) 2 0 2 0 0.1 K
% 0.43/1.08
% 0.43/1.08 -------------- statistics -------------
% 0.43/1.08 Clauses input 4
% 0.43/1.08 Usable input 0
% 0.43/1.08 Sos input 4
% 0.43/1.08 Demodulators input 0
% 0.43/1.08 Passive input 0
% 0.43/1.08
% 0.43/1.08 Processed BS (before search) 8
% 0.43/1.08 Forward subsumed BS 2
% 0.43/1.08 Kept BS 6
% 0.43/1.08 New demodulators BS 1
% 0.43/1.08 Back demodulated BS 0
% 0.43/1.08
% 0.43/1.08 Clauses or pairs given 113
% 0.43/1.08 Clauses generated 143
% 0.43/1.08 Forward subsumed 66
% 0.43/1.08 Deleted by weight 0
% 0.43/1.08 Deleted by variable count 0
% 0.43/1.08 Kept 77
% 0.43/1.08 New demodulators 17
% 0.43/1.08 Back demodulated 6
% 0.43/1.08 Ordered paramod prunes 0
% 0.43/1.08 Basic paramod prunes 87
% 0.43/1.08 Prime paramod prunes 1
% 0.43/1.08 Semantic prunes 0
% 0.43/1.08
% 0.43/1.08 Rewrite attmepts 857
% 0.43/1.08 Rewrites 15
% 0.43/1.08
% 0.43/1.08 FPA overloads 0
% 0.43/1.08 FPA underloads 0
% 0.43/1.08
% 0.43/1.08 Usable size 0
% 0.43/1.08 Sos size 76
% 0.43/1.08 Demodulators size 17
% 0.43/1.08 Passive size 0
% 0.43/1.08 Disabled size 6
% 0.43/1.08
% 0.43/1.08 Proofs found 1
% 0.43/1.08
% 0.43/1.08 ----------- times (seconds) ----------- Tue Jun 14 09:26:57 2022
% 0.43/1.08
% 0.43/1.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.43/1.08 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.43/1.08 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.43/1.08 input time 0.00
% 0.43/1.08 paramodulation time 0.00
% 0.43/1.08 demodulation time 0.00
% 0.43/1.08 orient time 0.00
% 0.43/1.08 weigh time 0.00
% 0.43/1.08 forward subsume time 0.00
% 0.43/1.08 back demod find time 0.00
% 0.43/1.08 conflict time 0.00
% 0.43/1.08 LRPO time 0.00
% 0.43/1.08 store clause time 0.00
% 0.43/1.08 disable clause time 0.00
% 0.43/1.08 prime paramod time 0.00
% 0.43/1.08 semantics time 0.00
% 0.43/1.08
% 0.43/1.08 EQP interrupted
%------------------------------------------------------------------------------