%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG016-6 : TPTP v8.1.0. Released v1.0.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 : Mon Jul 18 20:25:31 EDT 2022
% Result : Unsatisfiable 0.77s 1.14s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 4 RR)
% Number of literals : 20 ( 0 equ; 3 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG016-6.p',unknown),
[] ).
cnf(2,plain,
equal(add(A,additive_identity),A),
file('RNG016-6.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(additive_identity,A),additive_identity),
file('RNG016-6.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,additive_identity),additive_identity),
file('RNG016-6.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG016-6.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG016-6.p',unknown),
[] ).
cnf(7,plain,
equal(additive_inverse(additive_inverse(A)),A),
file('RNG016-6.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG016-6.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG016-6.p',unknown),
[] ).
cnf(11,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(16,plain,
~ equal(add(multiply(x,z),additive_inverse(multiply(y,z))),add(multiply(x,z),multiply(additive_inverse(y),z))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),1]),
[iquote('demod([9]),flip(1)')] ).
cnf(19,plain,
equal(add(multiply(A,B),multiply(A,additive_inverse(B))),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,8]),4]),1]),
[iquote('para(6,8),demod([4]),flip(1)')] ).
cnf(20,plain,
equal(add(additive_inverse(A),add(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,11]),1]),1]),
[iquote('para(5,11),demod([1]),flip(1)')] ).
cnf(21,plain,
equal(add(multiply(additive_inverse(A),B),multiply(A,B)),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,9]),3]),1]),
[iquote('para(5,9),demod([3]),flip(1)')] ).
cnf(100,plain,
equal(additive_inverse(multiply(A,B)),multiply(A,additive_inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,20]),2]),
[iquote('para(19,20),demod([2])')] ).
cnf(129,plain,
~ equal(add(multiply(x,z),multiply(y,additive_inverse(z))),add(multiply(x,z),multiply(additive_inverse(y),z))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),100]),
[iquote('back_demod(16),demod([100])')] ).
cnf(139,plain,
equal(multiply(additive_inverse(A),additive_inverse(B)),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,20]),100,2]),
[iquote('para(21,20),demod([100,2])')] ).
cnf(146,plain,
equal(multiply(A,additive_inverse(B)),multiply(additive_inverse(A),B)),
inference(para,[status(thm),theory(equality)],[7,139]),
[iquote('para(7,139)')] ).
cnf(1808,plain,
~ equal(add(multiply(x,z),multiply(additive_inverse(y),z)),add(multiply(x,z),multiply(additive_inverse(y),z))),
inference(para,[status(thm),theory(equality)],[146,129]),
[iquote('para(146,129)')] ).
cnf(1809,plain,
$false,
inference(conflict,[status(thm)],[1808]),
[iquote('xx_conflict(1808)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09 % Problem : RNG016-6 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.09 % Command : tptp2X_and_run_eqp %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Mon May 30 16:02:42 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.77/1.14 ----- EQP 0.9e, May 2009 -----
% 0.77/1.14 The job began on n032.cluster.edu, Mon May 30 16:02:43 2022
% 0.77/1.14 The command was "./eqp09e".
% 0.77/1.14
% 0.77/1.14 set(prolog_style_variables).
% 0.77/1.14 set(lrpo).
% 0.77/1.14 set(basic_paramod).
% 0.77/1.14 set(functional_subsume).
% 0.77/1.14 set(ordered_paramod).
% 0.77/1.14 set(prime_paramod).
% 0.77/1.14 set(para_pairs).
% 0.77/1.14 assign(pick_given_ratio,4).
% 0.77/1.14 clear(print_kept).
% 0.77/1.14 clear(print_new_demod).
% 0.77/1.14 clear(print_back_demod).
% 0.77/1.14 clear(print_given).
% 0.77/1.14 assign(max_mem,64000).
% 0.77/1.14 end_of_commands.
% 0.77/1.14
% 0.77/1.14 Usable:
% 0.77/1.14 end_of_list.
% 0.77/1.14
% 0.77/1.14 Sos:
% 0.77/1.14 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.77/1.14 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.77/1.14 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.77/1.14 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.77/1.14 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.77/1.14 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.77/1.14 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.77/1.14 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.77/1.14 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.77/1.14 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.77/1.14 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.77/1.14 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.77/1.14 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.77/1.14 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.77/1.14 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.77/1.14 0 (wt=-1) [] -(multiply(add(x,additive_inverse(y)),z) = add(multiply(x,z),additive_inverse(multiply(y,z)))).
% 0.77/1.14 end_of_list.
% 0.77/1.14
% 0.77/1.14 Demodulators:
% 0.77/1.14 end_of_list.
% 0.77/1.14
% 0.77/1.14 Passive:
% 0.77/1.14 end_of_list.
% 0.77/1.14
% 0.77/1.14 Starting to process input.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.77/1.14 1 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.77/1.14 2 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.77/1.14 3 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.77/1.14 4 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.77/1.14 5 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.77/1.14 6 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.77/1.14 7 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.77/1.14 8 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.77/1.14 9 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.77/1.14 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.77/1.14
% 0.77/1.14 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.77/1.14 11 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.77/1.14 12 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.77/1.14 13 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.77/1.14 14 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.77/1.14 15 is a new demodulator.
% 0.77/1.14
% 0.77/1.14 ** KEPT: 16 (wt=17) [demod([9]),flip(1)] -(add(multiply(x,z),additive_inverse(multiply(y,z))) = add(multiply(x,z),multiply(additive_inverse(y),z))).
% 0.77/1.14 ---------------- PROOF FOUND ----------------
% 0.77/1.14 % SZS status Unsatisfiable
% 0.77/1.14
% 0.77/1.14
% 0.77/1.14 After processing input:
% 0.77/1.14
% 0.77/1.14 Usable:
% 0.77/1.14 end_of_list.
% 0.77/1.14
% 0.77/1.14 Sos:
% 0.77/1.14 1 (wt=5) [] add(additive_identity,A) = A.
% 0.77/1.14 2 (wt=5) [] add(A,additive_identity) = A.
% 0.77/1.14 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.77/1.14 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.77/1.14 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.77/1.14 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.77/1.14 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.77/1.14 10 (wt=7) [] add(A,B) = add(B,A).
% 0.77/1.14 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.77/1.14 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.77/1.14 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.77/1.14 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.77/1.14 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.77/1.14 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.77/1.14 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.77/1.14 16 (wt=17) [demod([9]),flip(1)] -(add(multiply(x,z),additive_inverse(multiply(y,z))) = add(multiply(x,z),multiply(additive_inverse(y),z))).
% 0.77/1.14 end_of_list.
% 0.77/1.14
% 0.77/1.14 Demodulators:
% 0.77/1.14 1 (wt=5) [] add(additive_identity,A) = A.
% 0.77/1.14 2 (wt=5) [] add(A,additive_identity) = A.
% 0.77/1.14 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.77/1.14 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.77/1.14 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.77/1.14 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.77/1.14 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.77/1.14 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.77/1.14 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.77/1.14 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.77/1.14 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.77/1.14 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.77/1.14 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.77/1.14 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.77/1.14 end_of_list.
% 0.77/1.14
% 0.77/1.14 Passive:
% 0.77/1.14 end_of_list.
% 0.77/1.14
% 0.77/1.14 UNIT CONFLICT from 1808 and x=x at 0.18 seconds.
% 0.77/1.14
% 0.77/1.14 ---------------- PROOF ----------------
% 0.77/1.14 % SZS output start Refutation
% See solution above
% 0.77/1.14 ------------ end of proof -------------
% 0.77/1.14
% 0.77/1.14
% 0.77/1.14 ------------- memory usage ------------
% 0.77/1.14 Memory dynamically allocated (tp_alloc): 6835.
% 0.77/1.14 type (bytes each) gets frees in use avail bytes
% 0.77/1.14 sym_ent ( 96) 60 0 60 0 5.6 K
% 0.77/1.14 term ( 16) 338543 255615 82928 20 1613.0 K
% 0.77/1.14 gen_ptr ( 8) 544010 77316 466694 19 3646.2 K
% 0.77/1.14 context ( 808) 163905 163903 2 14 12.6 K
% 0.77/1.14 trail ( 12) 16235 16235 0 5 0.1 K
% 0.77/1.14 bt_node ( 68) 45697 45693 4 19 1.5 K
% 0.77/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.77/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.77/1.14 ac_match_free_vars_pos (4020)
% 0.77/1.14 0 0 0 0 0.0 K
% 0.77/1.14 discrim ( 12) 85005 40638 44367 227 522.6 K
% 0.77/1.14 flat ( 40) 560206 560206 0 239 9.3 K
% 0.77/1.14 discrim_pos ( 12) 13439 13439 0 1 0.0 K
% 0.77/1.14 fpa_head ( 12) 9847 0 9847 0 115.4 K
% 0.77/1.14 fpa_tree ( 28) 9594 9594 0 39 1.1 K
% 0.77/1.14 fpa_pos ( 36) 3010 3010 0 1 0.0 K
% 0.77/1.14 literal ( 12) 7652 5844 1808 0 21.2 K
% 0.77/1.14 clause ( 24) 7652 5844 1808 0 42.4 K
% 0.77/1.14 list ( 12) 1262 1206 56 3 0.7 K
% 0.77/1.14 list_pos ( 20) 8375 4131 4244 0 82.9 K
% 0.77/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.77/1.14
% 0.77/1.14 -------------- statistics -------------
% 0.77/1.14 Clauses input 16
% 0.77/1.14 Usable input 0
% 0.77/1.14 Sos input 16
% 0.77/1.14 Demodulators input 0
% 0.77/1.14 Passive input 0
% 0.77/1.14
% 0.77/1.14 Processed BS (before search) 17
% 0.77/1.14 Forward subsumed BS 1
% 0.77/1.14 Kept BS 16
% 0.77/1.14 New demodulators BS 14
% 0.77/1.14 Back demodulated BS 0
% 0.77/1.14
% 0.77/1.14 Clauses or pairs given 9690
% 0.77/1.14 Clauses generated 4404
% 0.77/1.14 Forward subsumed 2612
% 0.77/1.14 Deleted by weight 0
% 0.77/1.14 Deleted by variable count 0
% 0.77/1.14 Kept 1792
% 0.77/1.14 New demodulators 1189
% 0.77/1.14 Back demodulated 857
% 0.77/1.14 Ordered paramod prunes 0
% 0.77/1.14 Basic paramod prunes 21923
% 0.77/1.14 Prime paramod prunes 385
% 0.77/1.14 Semantic prunes 0
% 0.77/1.14
% 0.77/1.14 Rewrite attmepts 89800
% 0.77/1.14 Rewrites 12300
% 0.77/1.14
% 0.77/1.14 FPA overloads 0
% 0.77/1.14 FPA underloads 0
% 0.77/1.14
% 0.77/1.14 Usable size 0
% 0.77/1.14 Sos size 950
% 0.77/1.14 Demodulators size 537
% 0.77/1.14 Passive size 0
% 0.77/1.14 Disabled size 857
% 0.77/1.14
% 0.77/1.14 Proofs found 1
% 0.77/1.14
% 0.77/1.14 ----------- times (seconds) ----------- Mon May 30 16:02:43 2022
% 0.77/1.14
% 0.77/1.14 user CPU time 0.18 (0 hr, 0 min, 0 sec)
% 0.77/1.14 system CPU time 0.10 (0 hr, 0 min, 0 sec)
% 0.77/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.77/1.14 input time 0.00
% 0.77/1.14 paramodulation time 0.02
% 0.77/1.14 demodulation time 0.03
% 0.77/1.14 orient time 0.01
% 0.77/1.14 weigh time 0.00
% 0.77/1.14 forward subsume time 0.01
% 0.77/1.14 back demod find time 0.02
% 0.77/1.14 conflict time 0.00
% 0.77/1.14 LRPO time 0.01
% 0.77/1.14 store clause time 0.05
% 0.77/1.14 disable clause time 0.00
% 0.77/1.14 prime paramod time 0.00
% 0.77/1.14 semantics time 0.00
% 0.77/1.14
% 0.77/1.14 EQP interrupted
%------------------------------------------------------------------------------