%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG019-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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.72s 1.19s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 2 RR)
% Number of literals : 23 ( 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 : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 52 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG019-6.p',unknown),
[] ).
cnf(2,plain,
equal(add(A,additive_identity),A),
file('RNG019-6.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,additive_identity),additive_identity),
file('RNG019-6.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG019-6.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG019-6.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG019-6.p',unknown),
[] ).
cnf(10,plain,
equal(add(A,B),add(B,A)),
file('RNG019-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(14,plain,
equal(add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))),associator(A,B,C)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(16,plain,
~ equal(add(associator(x,y,u),associator(x,y,v)),associator(x,y,add(u,v))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('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(23,plain,
equal(add(additive_inverse(A),add(B,A)),B),
inference(para,[status(thm),theory(equality)],[10,20]),
[iquote('para(10,20)')] ).
cnf(32,plain,
equal(add(additive_inverse(add(A,B)),B),additive_inverse(A)),
inference(para,[status(thm),theory(equality)],[20,23]),
[iquote('para(20,23)')] ).
cnf(47,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(multiply(A,B),D),additive_inverse(add(multiply(A,multiply(B,C)),multiply(A,multiply(B,D)))))),associator(A,B,add(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,14]),8,8,11]),
[iquote('para(8,14),demod([8,8,11])')] ).
cnf(51,plain,
equal(add(multiply(multiply(A,B),C),add(additive_inverse(multiply(A,multiply(B,C))),D)),add(associator(A,B,C),D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,11]),1]),
[iquote('para(14,11),flip(1)')] ).
cnf(87,plain,
equal(additive_inverse(add(A,B)),add(additive_inverse(B),additive_inverse(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,23]),1]),
[iquote('para(32,23),flip(1)')] ).
cnf(93,plain,
equal(add(multiply(multiply(A,B),C),add(associator(A,B,D),additive_inverse(multiply(A,multiply(B,C))))),associator(A,B,add(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[47]),87,51]),
[iquote('back_demod(47),demod([87,51])')] ).
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(105,plain,
equal(add(multiply(multiply(A,B),C),add(associator(A,B,D),multiply(A,multiply(B,additive_inverse(C))))),associator(A,B,add(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[93]),100,100]),
[iquote('back_demod(93),demod([100,100])')] ).
cnf(124,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(A,multiply(B,additive_inverse(C))),D)),add(associator(A,B,C),D)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[51]),100,100]),
[iquote('back_demod(51),demod([100,100])')] ).
cnf(651,plain,
equal(add(associator(A,B,C),associator(A,B,D)),associator(A,B,add(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,105]),124]),
[iquote('para(10,105),demod([124])')] ).
cnf(652,plain,
$false,
inference(conflict,[status(thm)],[651,16]),
[iquote('conflict(651,16)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : RNG019-6 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 20:23:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.72/1.19 ----- EQP 0.9e, May 2009 -----
% 0.72/1.19 The job began on n019.cluster.edu, Mon May 30 20:23:26 2022
% 0.72/1.19 The command was "./eqp09e".
% 0.72/1.19
% 0.72/1.19 set(prolog_style_variables).
% 0.72/1.19 set(lrpo).
% 0.72/1.19 set(basic_paramod).
% 0.72/1.19 set(functional_subsume).
% 0.72/1.19 set(ordered_paramod).
% 0.72/1.19 set(prime_paramod).
% 0.72/1.19 set(para_pairs).
% 0.72/1.19 assign(pick_given_ratio,4).
% 0.72/1.19 clear(print_kept).
% 0.72/1.19 clear(print_new_demod).
% 0.72/1.19 clear(print_back_demod).
% 0.72/1.19 clear(print_given).
% 0.72/1.19 assign(max_mem,64000).
% 0.72/1.19 end_of_commands.
% 0.72/1.19
% 0.72/1.19 Usable:
% 0.72/1.19 end_of_list.
% 0.72/1.19
% 0.72/1.19 Sos:
% 0.72/1.19 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.72/1.19 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.72/1.19 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.72/1.19 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.72/1.19 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.72/1.19 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.72/1.19 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.72/1.19 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.19 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.72/1.19 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.72/1.19 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.72/1.19 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.72/1.19 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.72/1.19 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.72/1.19 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.72/1.19 0 (wt=-1) [] -(associator(x,y,add(u,v)) = add(associator(x,y,u),associator(x,y,v))).
% 0.72/1.19 end_of_list.
% 0.72/1.19
% 0.72/1.19 Demodulators:
% 0.72/1.19 end_of_list.
% 0.72/1.19
% 0.72/1.19 Passive:
% 0.72/1.19 end_of_list.
% 0.72/1.19
% 0.72/1.19 Starting to process input.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.72/1.19 1 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.72/1.19 2 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.72/1.19 3 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.72/1.19 4 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.72/1.19 5 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.72/1.19 6 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.72/1.19 7 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.19 8 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.72/1.19 9 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.72/1.19 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.72/1.19
% 0.72/1.19 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.72/1.19 11 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.72/1.19 12 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.72/1.19 13 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.72/1.19 14 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.72/1.19 15 is a new demodulator.
% 0.72/1.19
% 0.72/1.19 ** KEPT: 16 (wt=16) [flip(1)] -(add(associator(x,y,u),associator(x,y,v)) = associator(x,y,add(u,v))).
% 0.72/1.19 ---------------- PROOF FOUND ----------------
% 0.72/1.19 % SZS status Unsatisfiable
% 0.72/1.19
% 0.72/1.19
% 0.72/1.19 After processing input:
% 0.72/1.19
% 0.72/1.19 Usable:
% 0.72/1.19 end_of_list.
% 0.72/1.19
% 0.72/1.19 Sos:
% 0.72/1.19 1 (wt=5) [] add(additive_identity,A) = A.
% 0.72/1.19 2 (wt=5) [] add(A,additive_identity) = A.
% 0.72/1.19 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.72/1.19 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.72/1.19 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.72/1.19 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.72/1.19 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.72/1.19 10 (wt=7) [] add(A,B) = add(B,A).
% 0.72/1.19 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.72/1.19 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.72/1.19 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.72/1.19 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.72/1.19 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.19 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.72/1.19 16 (wt=16) [flip(1)] -(add(associator(x,y,u),associator(x,y,v)) = associator(x,y,add(u,v))).
% 0.72/1.19 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.72/1.19 end_of_list.
% 0.72/1.19
% 0.72/1.19 Demodulators:
% 0.72/1.19 1 (wt=5) [] add(additive_identity,A) = A.
% 0.72/1.19 2 (wt=5) [] add(A,additive_identity) = A.
% 0.72/1.19 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.72/1.19 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.72/1.19 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.72/1.19 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.72/1.19 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.72/1.19 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.19 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.72/1.19 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.72/1.19 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.72/1.19 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.72/1.19 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.72/1.19 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.72/1.19 end_of_list.
% 0.72/1.19
% 0.72/1.19 Passive:
% 0.72/1.19 end_of_list.
% 0.72/1.19
% 0.72/1.19 UNIT CONFLICT from 651 and 16 at 0.06 seconds.
% 0.72/1.19
% 0.72/1.19 ---------------- PROOF ----------------
% 0.72/1.19 % SZS output start Refutation
% See solution above
% 0.72/1.19 ------------ end of proof -------------
% 0.72/1.19
% 0.72/1.19
% 0.72/1.19 ------------- memory usage ------------
% 0.72/1.19 Memory dynamically allocated (tp_alloc): 1953.
% 0.72/1.19 type (bytes each) gets frees in use avail bytes
% 0.72/1.19 sym_ent ( 96) 61 0 61 0 5.7 K
% 0.72/1.19 term ( 16) 96173 76483 19690 43 382.9 K
% 0.72/1.19 gen_ptr ( 8) 109192 14380 94812 22 740.9 K
% 0.72/1.19 context ( 808) 68054 68052 2 6 6.3 K
% 0.72/1.19 trail ( 12) 3321 3321 0 5 0.1 K
% 0.72/1.19 bt_node ( 68) 22736 22733 3 20 1.5 K
% 0.72/1.19 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.19 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.19 ac_match_free_vars_pos (4020)
% 0.72/1.19 0 0 0 0 0.0 K
% 0.72/1.19 discrim ( 12) 18841 2423 16418 0 192.4 K
% 0.72/1.19 flat ( 40) 183639 183639 0 107 4.2 K
% 0.72/1.19 discrim_pos ( 12) 5384 5384 0 1 0.0 K
% 0.72/1.19 fpa_head ( 12) 2749 0 2749 0 32.2 K
% 0.72/1.19 fpa_tree ( 28) 2313 2313 0 19 0.5 K
% 0.72/1.19 fpa_pos ( 36) 1080 1080 0 1 0.0 K
% 0.72/1.19 literal ( 12) 3288 2637 651 1 7.6 K
% 0.72/1.19 clause ( 24) 3288 2637 651 1 15.3 K
% 0.72/1.19 list ( 12) 488 432 56 3 0.7 K
% 0.72/1.19 list_pos ( 20) 2608 518 2090 0 40.8 K
% 0.72/1.19 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.19
% 0.72/1.19 -------------- statistics -------------
% 0.72/1.19 Clauses input 16
% 0.72/1.19 Usable input 0
% 0.72/1.19 Sos input 16
% 0.72/1.19 Demodulators input 0
% 0.72/1.19 Passive input 0
% 0.72/1.19
% 0.72/1.19 Processed BS (before search) 17
% 0.72/1.19 Forward subsumed BS 1
% 0.72/1.19 Kept BS 16
% 0.72/1.19 New demodulators BS 14
% 0.72/1.19 Back demodulated BS 0
% 0.72/1.19
% 0.72/1.19 Clauses or pairs given 4700
% 0.72/1.19 Clauses generated 2033
% 0.72/1.19 Forward subsumed 1398
% 0.72/1.19 Deleted by weight 0
% 0.72/1.19 Deleted by variable count 0
% 0.72/1.19 Kept 635
% 0.72/1.19 New demodulators 415
% 0.72/1.19 Back demodulated 105
% 0.72/1.19 Ordered paramod prunes 0
% 0.72/1.19 Basic paramod prunes 9485
% 0.72/1.19 Prime paramod prunes 184
% 0.72/1.19 Semantic prunes 0
% 0.72/1.19
% 0.72/1.19 Rewrite attmepts 32472
% 0.72/1.19 Rewrites 4844
% 0.72/1.19
% 0.72/1.19 FPA overloads 0
% 0.72/1.19 FPA underloads 0
% 0.72/1.19
% 0.72/1.19 Usable size 0
% 0.72/1.19 Sos size 545
% 0.72/1.19 Demodulators size 350
% 0.72/1.19 Passive size 0
% 0.72/1.19 Disabled size 105
% 0.72/1.19
% 0.72/1.19 Proofs found 1
% 0.72/1.19
% 0.72/1.19 ----------- times (seconds) ----------- Mon May 30 20:23:26 2022
% 0.72/1.19
% 0.72/1.19 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.72/1.19 system CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.72/1.19 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.19 input time 0.00
% 0.72/1.19 paramodulation time 0.01
% 0.72/1.19 demodulation time 0.01
% 0.72/1.19 orient time 0.01
% 0.72/1.19 weigh time 0.00
% 0.72/1.19 forward subsume time 0.01
% 0.72/1.19 back demod find time 0.00
% 0.72/1.19 conflict time 0.00
% 0.72/1.19 LRPO time 0.00
% 0.72/1.19 store clause time 0.01
% 0.72/1.19 disable clause time 0.00
% 0.72/1.19 prime paramod time 0.00
% 0.72/1.19 semantics time 0.00
% 0.72/1.19
% 0.72/1.19 EQP interrupted
%------------------------------------------------------------------------------