TSTP Solution File: RNG008-7 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG008-7 : 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:29 EDT 2022
% Result : Unsatisfiable 0.69s 1.13s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 6 RR)
% Number of literals : 35 ( 0 equ; 1 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 47 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG008-7.p',unknown),
[] ).
cnf(2,plain,
equal(add(A,additive_identity),A),
file('RNG008-7.p',unknown),
[] ).
cnf(3,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG008-7.p',unknown),
[] ).
cnf(4,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG008-7.p',unknown),
[] ).
cnf(5,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(6,plain,
equal(add(A,B),add(B,A)),
file('RNG008-7.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG008-7.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG008-7.p',unknown),
[] ).
cnf(10,plain,
equal(multiply(A,A),A),
file('RNG008-7.p',unknown),
[] ).
cnf(11,plain,
equal(multiply(a,b),c),
file('RNG008-7.p',unknown),
[] ).
cnf(12,plain,
~ equal(multiply(b,a),c),
file('RNG008-7.p',unknown),
[] ).
cnf(14,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)],[3,5]),1]),1]),
[iquote('para(3,5),demod([1]),flip(1)')] ).
cnf(20,plain,
equal(additive_inverse(additive_inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,14]),2]),
[iquote('para(3,14),demod([2])')] ).
cnf(21,plain,
equal(add(additive_inverse(A),add(B,A)),B),
inference(para,[status(thm),theory(equality)],[6,14]),
[iquote('para(6,14)')] ).
cnf(22,plain,
equal(add(A,add(B,additive_inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,14]),5]),
[iquote('para(6,14),demod([5])')] ).
cnf(23,plain,
equal(add(multiply(A,additive_identity),multiply(A,B)),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,8]),1]),
[iquote('para(1,8),flip(1)')] ).
cnf(26,plain,
equal(add(multiply(A,B),multiply(A,additive_inverse(B))),multiply(A,additive_identity)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,8]),1]),
[iquote('para(4,8),flip(1)')] ).
cnf(28,plain,
equal(add(multiply(additive_identity,A),multiply(B,A)),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,9]),1]),
[iquote('para(1,9),flip(1)')] ).
cnf(32,plain,
equal(add(multiply(A,B),multiply(additive_inverse(A),B)),multiply(additive_identity,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,9]),1]),
[iquote('para(4,9),flip(1)')] ).
cnf(37,plain,
equal(add(A,add(multiply(B,A),add(multiply(A,B),B))),add(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,8]),9,10,9,10,5]),1]),
[iquote('para(10,8),demod([9,10,9,10,5]),flip(1)')] ).
cnf(48,plain,
equal(add(multiply(A,additive_identity),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,23]),10]),
[iquote('para(10,23),demod([10])')] ).
cnf(55,plain,
equal(multiply(A,additive_identity),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[48,21]),3]),1]),
[iquote('para(48,21),demod([3]),flip(1)')] ).
cnf(56,plain,
equal(add(multiply(A,B),multiply(A,additive_inverse(B))),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[26]),55]),
[iquote('back_demod(26),demod([55])')] ).
cnf(61,plain,
equal(add(A,multiply(A,additive_inverse(A))),additive_identity),
inference(para,[status(thm),theory(equality)],[10,56]),
[iquote('para(10,56)')] ).
cnf(83,plain,
equal(multiply(A,additive_inverse(A)),additive_inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,14]),2]),1]),
[iquote('para(61,14),demod([2]),flip(1)')] ).
cnf(109,plain,
equal(multiply(additive_identity,A),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[28,21]),3]),1]),
[iquote('para(28,21),demod([3]),flip(1)')] ).
cnf(110,plain,
equal(add(multiply(A,B),multiply(additive_inverse(A),B)),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),109]),
[iquote('back_demod(32),demod([109])')] ).
cnf(115,plain,
equal(add(additive_inverse(A),additive_inverse(A)),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,110]),83]),
[iquote('para(10,110),demod([83])')] ).
cnf(116,plain,
equal(add(A,A),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,115]),20]),
[iquote('para(20,115),demod([20])')] ).
cnf(117,plain,
equal(additive_inverse(A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[116,14]),2]),
[iquote('para(116,14),demod([2])')] ).
cnf(125,plain,
equal(add(A,add(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[22]),117]),
[iquote('back_demod(22),demod([117])')] ).
cnf(137,plain,
equal(add(b,add(c,add(multiply(b,a),a))),add(b,a)),
inference(para,[status(thm),theory(equality)],[11,37]),
[iquote('para(11,37)')] ).
cnf(204,plain,
equal(add(c,add(multiply(b,a),b)),b),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[137,125]),5,5,125]),
[iquote('para(137,125),demod([5,5,125])')] ).
cnf(213,plain,
equal(multiply(b,a),c),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[204,125]),5,116,2]),
[iquote('para(204,125),demod([5,116,2])')] ).
cnf(214,plain,
$false,
inference(conflict,[status(thm)],[213,12]),
[iquote('conflict(213,12)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : RNG008-7 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon May 30 11:32:55 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.69/1.13 ----- EQP 0.9e, May 2009 -----
% 0.69/1.13 The job began on n019.cluster.edu, Mon May 30 11:32:56 2022
% 0.69/1.13 The command was "./eqp09e".
% 0.69/1.13
% 0.69/1.13 set(prolog_style_variables).
% 0.69/1.13 set(lrpo).
% 0.69/1.13 set(basic_paramod).
% 0.69/1.13 set(functional_subsume).
% 0.69/1.13 set(ordered_paramod).
% 0.69/1.13 set(prime_paramod).
% 0.69/1.13 set(para_pairs).
% 0.69/1.13 assign(pick_given_ratio,4).
% 0.69/1.13 clear(print_kept).
% 0.69/1.13 clear(print_new_demod).
% 0.69/1.13 clear(print_back_demod).
% 0.69/1.13 clear(print_given).
% 0.69/1.13 assign(max_mem,64000).
% 0.69/1.13 end_of_commands.
% 0.69/1.13
% 0.69/1.13 Usable:
% 0.69/1.13 end_of_list.
% 0.69/1.13
% 0.69/1.13 Sos:
% 0.69/1.13 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.69/1.13 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.69/1.13 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.69/1.13 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.69/1.13 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.69/1.13 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.69/1.13 0 (wt=-1) [] multiply(A,multiply(B,C)) = multiply(multiply(A,B),C).
% 0.69/1.13 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.69/1.13 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.69/1.13 0 (wt=-1) [] multiply(A,A) = A.
% 0.69/1.13 0 (wt=-1) [] multiply(a,b) = c.
% 0.69/1.13 0 (wt=-1) [] -(multiply(b,a) = c).
% 0.69/1.13 end_of_list.
% 0.69/1.13
% 0.69/1.13 Demodulators:
% 0.69/1.13 end_of_list.
% 0.69/1.13
% 0.69/1.13 Passive:
% 0.69/1.13 end_of_list.
% 0.69/1.13
% 0.69/1.13 Starting to process input.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.69/1.13 1 is a new demodulator.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.69/1.13 2 is a new demodulator.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 3 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.69/1.13 3 is a new demodulator.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 4 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.69/1.13 4 is a new demodulator.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 5 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.69/1.13 5 is a new demodulator.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 6 (wt=7) [] add(A,B) = add(B,A).
% 0.69/1.13 clause forward subsumed: 0 (wt=7) [flip(6)] add(B,A) = add(A,B).
% 0.69/1.13
% 0.69/1.13 ** KEPT: 7 (wt=11) [flip(1)] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.69/1.13 7 is a new demodulator.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.69/1.13 8 is a new demodulator.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.69/1.13 9 is a new demodulator.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 10 (wt=5) [] multiply(A,A) = A.
% 0.69/1.13 10 is a new demodulator.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 11 (wt=5) [] multiply(a,b) = c.
% 0.69/1.13 11 is a new demodulator.
% 0.69/1.13
% 0.69/1.13 ** KEPT: 12 (wt=5) [] -(multiply(b,a) = c).
% 0.69/1.13 ---------------- PROOF FOUND ----------------
% 0.69/1.13 % SZS status Unsatisfiable
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 After processing input:
% 0.69/1.13
% 0.69/1.13 Usable:
% 0.69/1.13 end_of_list.
% 0.69/1.13
% 0.69/1.13 Sos:
% 0.69/1.13 1 (wt=5) [] add(additive_identity,A) = A.
% 0.69/1.13 2 (wt=5) [] add(A,additive_identity) = A.
% 0.69/1.13 10 (wt=5) [] multiply(A,A) = A.
% 0.69/1.13 11 (wt=5) [] multiply(a,b) = c.
% 0.69/1.13 12 (wt=5) [] -(multiply(b,a) = c).
% 0.69/1.13 3 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.69/1.13 4 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.69/1.13 6 (wt=7) [] add(A,B) = add(B,A).
% 0.69/1.13 5 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.69/1.13 7 (wt=11) [flip(1)] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.69/1.13 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.69/1.13 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.69/1.13 end_of_list.
% 0.69/1.13
% 0.69/1.13 Demodulators:
% 0.69/1.13 1 (wt=5) [] add(additive_identity,A) = A.
% 0.69/1.13 2 (wt=5) [] add(A,additive_identity) = A.
% 0.69/1.13 3 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.69/1.13 4 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.69/1.13 5 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.69/1.13 7 (wt=11) [flip(1)] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.69/1.13 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.69/1.13 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.69/1.13 10 (wt=5) [] multiply(A,A) = A.
% 0.69/1.13 11 (wt=5) [] multiply(a,b) = c.
% 0.69/1.13 end_of_list.
% 0.69/1.13
% 0.69/1.13 Passive:
% 0.69/1.13 end_of_list.
% 0.69/1.13
% 0.69/1.13 UNIT CONFLICT from 213 and 12 at 0.01 seconds.
% 0.69/1.13
% 0.69/1.13 ---------------- PROOF ----------------
% 0.69/1.13 % SZS output start Refutation
% See solution above
% 0.69/1.13 ------------ end of proof -------------
% 0.69/1.13
% 0.69/1.13
% 0.69/1.13 ------------- memory usage ------------
% 0.69/1.13 Memory dynamically allocated (tp_alloc): 488.
% 0.69/1.13 type (bytes each) gets frees in use avail bytes
% 0.69/1.13 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.69/1.13 term ( 16) 17486 14563 2923 19 56.6 K
% 0.69/1.13 gen_ptr ( 8) 15914 4999 10915 34 85.5 K
% 0.69/1.13 context ( 808) 15731 15729 2 4 4.7 K
% 0.69/1.13 trail ( 12) 1278 1278 0 3 0.0 K
% 0.69/1.13 bt_node ( 68) 6484 6481 3 8 0.7 K
% 0.69/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.69/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.69/1.13 ac_match_free_vars_pos (4020)
% 0.69/1.13 0 0 0 0 0.0 K
% 0.69/1.13 discrim ( 12) 2249 851 1398 0 16.4 K
% 0.79/1.13 flat ( 40) 28172 28172 0 23 0.9 K
% 0.79/1.13 discrim_pos ( 12) 1200 1200 0 1 0.0 K
% 0.79/1.13 fpa_head ( 12) 577 0 577 0 6.8 K
% 0.79/1.13 fpa_tree ( 28) 588 588 0 9 0.2 K
% 0.79/1.13 fpa_pos ( 36) 377 377 0 1 0.0 K
% 0.79/1.13 literal ( 12) 1120 907 213 1 2.5 K
% 0.79/1.13 clause ( 24) 1120 907 213 1 5.0 K
% 0.79/1.13 list ( 12) 223 167 56 3 0.7 K
% 0.79/1.13 list_pos ( 20) 992 458 534 0 10.4 K
% 0.79/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.79/1.13
% 0.79/1.13 -------------- statistics -------------
% 0.79/1.13 Clauses input 12
% 0.79/1.13 Usable input 0
% 0.79/1.13 Sos input 12
% 0.79/1.13 Demodulators input 0
% 0.79/1.13 Passive input 0
% 0.79/1.13
% 0.79/1.13 Processed BS (before search) 13
% 0.79/1.13 Forward subsumed BS 1
% 0.79/1.13 Kept BS 12
% 0.79/1.13 New demodulators BS 10
% 0.79/1.13 Back demodulated BS 0
% 0.79/1.13
% 0.79/1.13 Clauses or pairs given 1294
% 0.79/1.13 Clauses generated 703
% 0.79/1.13 Forward subsumed 502
% 0.79/1.13 Deleted by weight 0
% 0.79/1.13 Deleted by variable count 0
% 0.79/1.13 Kept 201
% 0.79/1.13 New demodulators 154
% 0.79/1.13 Back demodulated 90
% 0.79/1.13 Ordered paramod prunes 0
% 0.79/1.13 Basic paramod prunes 2250
% 0.79/1.13 Prime paramod prunes 68
% 0.79/1.13 Semantic prunes 0
% 0.79/1.13
% 0.79/1.13 Rewrite attmepts 5968
% 0.79/1.13 Rewrites 1003
% 0.79/1.13
% 0.79/1.13 FPA overloads 0
% 0.79/1.13 FPA underloads 0
% 0.79/1.13
% 0.79/1.13 Usable size 0
% 0.79/1.13 Sos size 122
% 0.79/1.13 Demodulators size 78
% 0.79/1.13 Passive size 0
% 0.79/1.13 Disabled size 90
% 0.79/1.13
% 0.79/1.13 Proofs found 1
% 0.79/1.13
% 0.79/1.13 ----------- times (seconds) ----------- Mon May 30 11:32:56 2022
% 0.79/1.13
% 0.79/1.13 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.79/1.13 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.79/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.79/1.13 input time 0.00
% 0.79/1.13 paramodulation time 0.00
% 0.79/1.13 demodulation time 0.00
% 0.79/1.13 orient time 0.00
% 0.79/1.13 weigh time 0.00
% 0.79/1.13 forward subsume time 0.00
% 0.79/1.13 back demod find time 0.00
% 0.79/1.13 conflict time 0.00
% 0.79/1.13 LRPO time 0.00
% 0.79/1.13 store clause time 0.00
% 0.79/1.13 disable clause time 0.00
% 0.79/1.13 prime paramod time 0.00
% 0.79/1.13 semantics time 0.00
% 0.79/1.13
% 0.79/1.13 EQP interrupted
%------------------------------------------------------------------------------