TSTP Solution File: RNG017-6 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG017-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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 1.56s 1.95s
% Output : Refutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 3 RR)
% Number of literals : 26 ( 0 equ; 2 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 : 45 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG017-6.p',unknown),
[] ).
cnf(2,plain,
equal(add(A,additive_identity),A),
file('RNG017-6.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(additive_identity,A),additive_identity),
file('RNG017-6.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,additive_identity),additive_identity),
file('RNG017-6.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG017-6.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG017-6.p',unknown),
[] ).
cnf(7,plain,
equal(additive_inverse(additive_inverse(A)),A),
file('RNG017-6.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG017-6.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG017-6.p',unknown),
[] ).
cnf(10,plain,
equal(add(A,B),add(B,A)),
file('RNG017-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(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))),add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),z))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),1]),
[iquote('demod([8]),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(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(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(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,additive_inverse(y)),multiply(x,additive_inverse(z))),add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),z))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),100,100]),
[iquote('back_demod(16),demod([100,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(255,plain,
equal(add(multiply(A,additive_inverse(B)),multiply(A,additive_inverse(C))),add(multiply(additive_inverse(A),C),multiply(additive_inverse(A),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[87,146]),8,8]),
[iquote('para(87,146),demod([8,8])')] ).
cnf(5992,plain,
equal(add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C)),add(multiply(A,additive_inverse(B)),multiply(A,additive_inverse(C)))),
inference(para,[status(thm),theory(equality)],[255,10]),
[iquote('para(255,10)')] ).
cnf(5993,plain,
equal(add(multiply(A,additive_inverse(B)),multiply(A,additive_inverse(C))),add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C))),
inference(flip,[status(thm),theory(equality)],[5992]),
[iquote('flip(5992)')] ).
cnf(5994,plain,
$false,
inference(conflict,[status(thm)],[5993,129]),
[iquote('conflict(5993,129)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG017-6 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon May 30 21:25:37 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.56/1.95 ----- EQP 0.9e, May 2009 -----
% 1.56/1.95 The job began on n022.cluster.edu, Mon May 30 21:25:38 2022
% 1.56/1.95 The command was "./eqp09e".
% 1.56/1.95
% 1.56/1.95 set(prolog_style_variables).
% 1.56/1.95 set(lrpo).
% 1.56/1.95 set(basic_paramod).
% 1.56/1.95 set(functional_subsume).
% 1.56/1.95 set(ordered_paramod).
% 1.56/1.95 set(prime_paramod).
% 1.56/1.95 set(para_pairs).
% 1.56/1.95 assign(pick_given_ratio,4).
% 1.56/1.95 clear(print_kept).
% 1.56/1.95 clear(print_new_demod).
% 1.56/1.95 clear(print_back_demod).
% 1.56/1.95 clear(print_given).
% 1.56/1.95 assign(max_mem,64000).
% 1.56/1.95 end_of_commands.
% 1.56/1.95
% 1.56/1.95 Usable:
% 1.56/1.95 end_of_list.
% 1.56/1.95
% 1.56/1.95 Sos:
% 1.56/1.95 0 (wt=-1) [] add(additive_identity,A) = A.
% 1.56/1.95 0 (wt=-1) [] add(A,additive_identity) = A.
% 1.56/1.95 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 1.56/1.95 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 1.56/1.95 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 1.56/1.95 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 1.56/1.95 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 1.56/1.95 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 1.56/1.95 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 1.56/1.95 0 (wt=-1) [] add(A,B) = add(B,A).
% 1.56/1.95 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 1.56/1.95 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 1.56/1.95 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 1.56/1.95 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 1.56/1.95 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 1.56/1.95 0 (wt=-1) [] -(multiply(additive_inverse(x),add(y,z)) = add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z)))).
% 1.56/1.95 end_of_list.
% 1.56/1.95
% 1.56/1.95 Demodulators:
% 1.56/1.95 end_of_list.
% 1.56/1.95
% 1.56/1.95 Passive:
% 1.56/1.95 end_of_list.
% 1.56/1.95
% 1.56/1.95 Starting to process input.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 1.56/1.95 1 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 1.56/1.95 2 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 1.56/1.95 3 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 1.56/1.95 4 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 1.56/1.95 5 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 1.56/1.95 6 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 1.56/1.95 7 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 1.56/1.95 8 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 1.56/1.95 9 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 1.56/1.95 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 1.56/1.95
% 1.56/1.95 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 1.56/1.95 11 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 1.56/1.95 12 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 1.56/1.95 13 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 1.56/1.95 14 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 1.56/1.95 15 is a new demodulator.
% 1.56/1.95
% 1.56/1.95 ** KEPT: 16 (wt=19) [demod([8]),flip(1)] -(add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))) = add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),z))).
% 1.56/1.95 ---------------- PROOF FOUND ----------------
% 1.56/1.95 % SZS status Unsatisfiable
% 1.56/1.95
% 1.56/1.95
% 1.56/1.95 After processing input:
% 1.56/1.95
% 1.56/1.95 Usable:
% 1.56/1.95 end_of_list.
% 1.56/1.95
% 1.56/1.95 Sos:
% 1.56/1.95 1 (wt=5) [] add(additive_identity,A) = A.
% 1.56/1.95 2 (wt=5) [] add(A,additive_identity) = A.
% 1.56/1.95 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 1.56/1.95 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 1.56/1.95 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 1.56/1.95 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 1.56/1.95 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 1.56/1.95 10 (wt=7) [] add(A,B) = add(B,A).
% 1.56/1.95 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 1.56/1.95 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 1.56/1.95 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 1.56/1.95 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 1.56/1.95 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 1.56/1.95 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 1.56/1.95 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 1.56/1.95 16 (wt=19) [demod([8]),flip(1)] -(add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))) = add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),z))).
% 1.56/1.95 end_of_list.
% 1.56/1.95
% 1.56/1.95 Demodulators:
% 1.56/1.95 1 (wt=5) [] add(additive_identity,A) = A.
% 1.56/1.95 2 (wt=5) [] add(A,additive_identity) = A.
% 1.56/1.95 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 1.56/1.95 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 1.56/1.95 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 1.56/1.95 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 1.56/1.95 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 1.56/1.95 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 1.56/1.95 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 1.56/1.95 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 1.56/1.95 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 1.56/1.95 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 1.56/1.95 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 1.56/1.95 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 1.56/1.95 end_of_list.
% 1.56/1.95
% 1.56/1.95 Passive:
% 1.56/1.95 end_of_list.
% 1.56/1.95
% 1.56/1.95 UNIT CONFLICT from 5993 and 129 at 0.61 seconds.
% 1.56/1.95
% 1.56/1.95 ---------------- PROOF ----------------
% 1.56/1.95 % SZS output start Refutation
% See solution above
% 1.56/1.95 ------------ end of proof -------------
% 1.56/1.95
% 1.56/1.95
% 1.56/1.95 ------------- memory usage ------------
% 1.56/1.96 Memory dynamically allocated (tp_alloc): 18066.
% 1.56/1.96 type (bytes each) gets frees in use avail bytes
% 1.56/1.96 sym_ent ( 96) 60 0 60 0 5.6 K
% 1.56/1.96 term ( 16) 1042928 792645 250283 25 4865.4 K
% 1.56/1.96 gen_ptr ( 8) 1469989 149726 1320263 25 10314.8 K
% 1.56/1.96 context ( 808) 627137 627135 2 14 12.6 K
% 1.56/1.96 trail ( 12) 39074 39074 0 6 0.1 K
% 1.56/1.96 bt_node ( 68) 206840 206837 3 20 1.5 K
% 1.56/1.96 ac_position (285432) 0 0 0 0 0.0 K
% 1.56/1.96 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.56/1.96 ac_match_free_vars_pos (4020)
% 1.56/1.96 0 0 0 0 0.0 K
% 1.56/1.96 discrim ( 12) 169563 48182 121381 0 1422.4 K
% 1.56/1.96 flat ( 40) 2422512 2422512 0 239 9.3 K
% 1.56/1.96 discrim_pos ( 12) 42409 42409 0 1 0.0 K
% 1.56/1.96 fpa_head ( 12) 12450 0 12450 0 145.9 K
% 1.56/1.96 fpa_tree ( 28) 18363 18363 0 41 1.1 K
% 1.56/1.96 fpa_pos ( 36) 7719 7719 0 1 0.0 K
% 1.56/1.96 literal ( 12) 33012 27019 5993 1 70.2 K
% 1.56/1.96 clause ( 24) 33012 27019 5993 1 140.5 K
% 1.56/1.96 list ( 12) 1785 1729 56 3 0.7 K
% 1.56/1.96 list_pos ( 20) 21822 4976 16846 0 329.0 K
% 1.56/1.96 pair_index ( 40) 2 0 2 0 0.1 K
% 1.56/1.96
% 1.56/1.96 -------------- statistics -------------
% 1.56/1.96 Clauses input 16
% 1.56/1.96 Usable input 0
% 1.56/1.96 Sos input 16
% 1.56/1.96 Demodulators input 0
% 1.56/1.96 Passive input 0
% 1.56/1.96
% 1.56/1.96 Processed BS (before search) 17
% 1.56/1.96 Forward subsumed BS 1
% 1.56/1.96 Kept BS 16
% 1.56/1.96 New demodulators BS 14
% 1.56/1.96 Back demodulated BS 0
% 1.56/1.96
% 1.56/1.96 Clauses or pairs given 31715
% 1.56/1.96 Clauses generated 18205
% 1.56/1.96 Forward subsumed 12228
% 1.56/1.96 Deleted by weight 0
% 1.56/1.96 Deleted by variable count 0
% 1.56/1.96 Kept 5977
% 1.56/1.96 New demodulators 1712
% 1.56/1.96 Back demodulated 1041
% 1.56/1.96 Ordered paramod prunes 0
% 1.56/1.96 Basic paramod prunes 87361
% 1.56/1.96 Prime paramod prunes 1256
% 1.56/1.96 Semantic prunes 0
% 1.56/1.96
% 1.56/1.96 Rewrite attmepts 342712
% 1.56/1.96 Rewrites 35112
% 1.56/1.96
% 1.56/1.96 FPA overloads 0
% 1.56/1.96 FPA underloads 0
% 1.56/1.96
% 1.56/1.96 Usable size 0
% 1.56/1.96 Sos size 4951
% 1.56/1.96 Demodulators size 952
% 1.56/1.96 Passive size 0
% 1.56/1.96 Disabled size 1041
% 1.56/1.96
% 1.56/1.96 Proofs found 1
% 1.56/1.96
% 1.56/1.96 ----------- times (seconds) ----------- Mon May 30 21:25:39 2022
% 1.56/1.96
% 1.56/1.96 user CPU time 0.61 (0 hr, 0 min, 0 sec)
% 1.56/1.96 system CPU time 0.29 (0 hr, 0 min, 0 sec)
% 1.56/1.96 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.56/1.96 input time 0.00
% 1.56/1.96 paramodulation time 0.06
% 1.56/1.96 demodulation time 0.10
% 1.56/1.96 orient time 0.04
% 1.56/1.96 weigh time 0.01
% 1.56/1.96 forward subsume time 0.04
% 1.56/1.96 back demod find time 0.03
% 1.56/1.96 conflict time 0.01
% 1.56/1.96 LRPO time 0.02
% 1.56/1.96 store clause time 0.20
% 1.56/1.96 disable clause time 0.02
% 1.56/1.96 prime paramod time 0.02
% 1.56/1.96 semantics time 0.00
% 1.56/1.96
% 1.56/1.96 EQP interrupted
%------------------------------------------------------------------------------