%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP537-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n026.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:52 EDT 2022
% Result : Unsatisfiable 0.72s 1.12s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 2 RR)
% Number of literals : 10 ( 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 : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,B),divide(divide(A,C),B)),C),
file('GRP537-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP537-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('GRP537-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(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(inverse(A),divide(identity,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),6]),1]),
[iquote('back_demod(5),demod([6]),flip(1)')] ).
cnf(8,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),6]),1]),
[iquote('back_demod(3),demod([6]),flip(1)')] ).
cnf(9,plain,
~ equal(identity,identity),
inference(demod,[status(thm),theory(equality)],[7,8,6,7,8,6]),
[iquote('demod([7,8,6,7,8,6])')] ).
cnf(10,plain,
$false,
inference(conflict,[status(thm)],[9]),
[iquote('xx_conflict(9)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP537-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jun 14 08:00:51 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.72/1.12 ----- EQP 0.9e, May 2009 -----
% 0.72/1.12 The job began on n026.cluster.edu, Tue Jun 14 08:00:52 2022
% 0.72/1.12 The command was "./eqp09e".
% 0.72/1.12
% 0.72/1.12 set(prolog_style_variables).
% 0.72/1.12 set(lrpo).
% 0.72/1.12 set(basic_paramod).
% 0.72/1.12 set(functional_subsume).
% 0.72/1.12 set(ordered_paramod).
% 0.72/1.12 set(prime_paramod).
% 0.72/1.12 set(para_pairs).
% 0.72/1.12 assign(pick_given_ratio,4).
% 0.72/1.12 clear(print_kept).
% 0.72/1.12 clear(print_new_demod).
% 0.72/1.12 clear(print_back_demod).
% 0.72/1.12 clear(print_given).
% 0.72/1.12 assign(max_mem,64000).
% 0.72/1.12 end_of_commands.
% 0.72/1.12
% 0.72/1.12 Usable:
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Sos:
% 0.72/1.12 0 (wt=-1) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.72/1.12 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.72/1.12 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.72/1.12 0 (wt=-1) [] identity = divide(A,A).
% 0.72/1.12 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Demodulators:
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Passive:
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Starting to process input.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 1 (wt=11) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.72/1.12 1 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.72/1.12
% 0.72/1.12 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.72/1.12 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.72/1.12
% 0.72/1.12 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.72/1.12
% 0.72/1.12 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.72/1.12 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.72/1.12
% 0.72/1.12 ** KEPT: 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.12 6 is a new demodulator.
% 0.72/1.12 -> 6 back demodulating 5.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.72/1.12 7 is a new demodulator.
% 0.72/1.12 -> 7 back demodulating 4.
% 0.72/1.12 clause forward subsumed: 0 (wt=7) [back_demod(4),demod([7,6])] divide(identity,A) = divide(identity,A).
% 0.72/1.12 -> 6 back demodulating 3.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.12 8 is a new demodulator.
% 0.72/1.12 -> 8 back demodulating 2.
% 0.72/1.12 clause forward subsumed: 0 (wt=11) [back_demod(2),demod([8,6])] divide(A,divide(identity,B)) = divide(A,divide(identity,B)).
% 0.72/1.12
% 0.72/1.12 ** KEPT: 9 (wt=3) [demod([7,8,6,7,8,6])] -(identity = identity).
% 0.72/1.12 ---------------- PROOF FOUND ----------------
% 0.72/1.12 % SZS status Unsatisfiable
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 UNIT CONFLICT from 9 and x=x at 0.00 seconds.
% 0.72/1.12
% 0.72/1.12 ---------------- PROOF ----------------
% 0.72/1.12 % SZS output start Refutation
% See solution above
% 0.72/1.12 ------------ end of proof -------------
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 ------------- memory usage ------------
% 0.72/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.12 type (bytes each) gets frees in use avail bytes
% 0.72/1.12 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.72/1.12 term ( 16) 571 495 76 29 2.0 K
% 0.72/1.12 gen_ptr ( 8) 330 118 212 9 1.7 K
% 0.72/1.12 context ( 808) 116 116 0 3 2.4 K
% 0.72/1.12 trail ( 12) 24 24 0 3 0.0 K
% 0.72/1.12 bt_node ( 68) 1 1 0 1 0.1 K
% 0.72/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.12 ac_match_free_vars_pos (4020)
% 0.72/1.12 0 0 0 0 0.0 K
% 0.72/1.12 discrim ( 12) 66 20 46 11 0.7 K
% 0.72/1.12 flat ( 40) 226 226 0 11 0.4 K
% 0.72/1.12 discrim_pos ( 12) 14 14 0 1 0.0 K
% 0.72/1.12 fpa_head ( 12) 56 0 56 0 0.7 K
% 0.72/1.12 fpa_tree ( 28) 6 6 0 3 0.1 K
% 0.72/1.12 fpa_pos ( 36) 12 12 0 1 0.0 K
% 0.72/1.12 literal ( 12) 23 14 9 1 0.1 K
% 0.72/1.12 clause ( 24) 23 14 9 1 0.2 K
% 0.72/1.12 list ( 12) 63 5 58 2 0.7 K
% 0.72/1.12 list_pos ( 20) 43 23 20 7 0.5 K
% 0.72/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.12
% 0.72/1.12 -------------- statistics -------------
% 0.72/1.12 Clauses input 5
% 0.72/1.12 Usable input 0
% 0.72/1.12 Sos input 5
% 0.72/1.12 Demodulators input 0
% 0.72/1.12 Passive input 0
% 0.72/1.12
% 0.72/1.12 Processed BS (before search) 13
% 0.72/1.12 Forward subsumed BS 4
% 0.72/1.12 Kept BS 9
% 0.72/1.12 New demodulators BS 4
% 0.72/1.12 Back demodulated BS 4
% 0.72/1.12
% 0.72/1.12 Clauses or pairs given 0
% 0.72/1.12 Clauses generated 0
% 0.72/1.12 Forward subsumed 0
% 0.72/1.12 Deleted by weight 0
% 0.72/1.12 Deleted by variable count 0
% 0.72/1.12 Kept 0
% 0.72/1.12 New demodulators 0
% 0.72/1.12 Back demodulated 0
% 0.72/1.12 Ordered paramod prunes 0
% 0.72/1.12 Basic paramod prunes 0
% 0.72/1.12 Prime paramod prunes 0
% 0.72/1.12 Semantic prunes 0
% 0.72/1.12
% 0.72/1.12 Rewrite attmepts 83
% 0.72/1.12 Rewrites 12
% 0.72/1.12
% 0.72/1.12 FPA overloads 0
% 0.72/1.12 FPA underloads 0
% 0.72/1.12
% 0.72/1.12 Usable size 0
% 0.72/1.12 Sos size 4
% 0.72/1.12 Demodulators size 4
% 0.72/1.12 Passive size 0
% 0.72/1.12 Disabled size 4
% 0.72/1.12
% 0.72/1.12 Proofs found 1
% 0.72/1.12
% 0.72/1.12 ----------- times (seconds) ----------- Tue Jun 14 08:00:52 2022
% 0.72/1.12
% 0.72/1.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.12 input time 0.00
% 0.72/1.12 paramodulation time 0.00
% 0.72/1.12 demodulation time 0.00
% 0.72/1.12 orient time 0.00
% 0.72/1.12 weigh time 0.00
% 0.72/1.12 forward subsume time 0.00
% 0.72/1.12 back demod find time 0.00
% 0.72/1.12 conflict time 0.00
% 0.72/1.12 LRPO time 0.00
% 0.72/1.12 store clause time 0.00
% 0.72/1.12 disable clause time 0.00
% 0.72/1.12 prime paramod time 0.00
% 0.72/1.12 semantics time 0.00
% 0.72/1.12
% 0.72/1.12 EQP interrupted
%------------------------------------------------------------------------------