TSTP Solution File: RNG008-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG008-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n027.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.65s 1.07s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 7 RR)
% Number of literals : 23 ( 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 : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG008-4.p',unknown),
[] ).
cnf(2,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG008-4.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG008-4.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG008-4.p',unknown),
[] ).
cnf(6,plain,
equal(additive_inverse(additive_inverse(A)),A),
file('RNG008-4.p',unknown),
[] ).
cnf(10,plain,
equal(additive_inverse(multiply(A,B)),multiply(A,additive_inverse(B))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(11,plain,
equal(multiply(additive_inverse(A),B),multiply(A,additive_inverse(B))),
inference(demod,[status(thm),theory(equality)],[10]),
[iquote('demod([10])')] ).
cnf(13,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
file('RNG008-4.p',unknown),
[] ).
cnf(14,plain,
equal(add(A,B),add(B,A)),
file('RNG008-4.p',unknown),
[] ).
cnf(16,plain,
equal(multiply(A,A),A),
file('RNG008-4.p',unknown),
[] ).
cnf(17,plain,
equal(multiply(a,b),c),
file('RNG008-4.p',unknown),
[] ).
cnf(18,plain,
~ equal(multiply(b,a),c),
file('RNG008-4.p',unknown),
[] ).
cnf(23,plain,
equal(add(A,additive_inverse(A)),additive_identity),
inference(para,[status(thm),theory(equality)],[6,2]),
[iquote('para(6,2)')] ).
cnf(29,plain,
equal(additive_inverse(A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,16]),6,16]),1]),
[iquote('para(11,16),demod([6,16]),flip(1)')] ).
cnf(31,plain,
equal(add(A,A),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[23]),29]),
[iquote('back_demod(23),demod([29])')] ).
cnf(39,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)],[16,3]),4,16,4,16,13]),1]),
[iquote('para(16,3),demod([4,16,4,16,13]),flip(1)')] ).
cnf(51,plain,
equal(add(A,add(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,13]),1]),1]),
[iquote('para(31,13),demod([1]),flip(1)')] ).
cnf(54,plain,
equal(add(A,add(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,14]),13]),1]),
[iquote('para(51,14),demod([13]),flip(1)')] ).
cnf(72,plain,
equal(add(b,add(c,add(multiply(b,a),a))),add(b,a)),
inference(para,[status(thm),theory(equality)],[17,39]),
[iquote('para(17,39)')] ).
cnf(95,plain,
equal(add(c,add(multiply(b,a),a)),a),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[72,51]),51]),1]),
[iquote('para(72,51),demod([51]),flip(1)')] ).
cnf(96,plain,
equal(add(multiply(b,a),add(a,c)),a),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[95,14]),13]),1]),
[iquote('para(95,14),demod([13]),flip(1)')] ).
cnf(110,plain,
equal(multiply(b,a),c),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[96,54]),13,54]),1]),
[iquote('para(96,54),demod([13,54]),flip(1)')] ).
cnf(111,plain,
$false,
inference(conflict,[status(thm)],[110,18]),
[iquote('conflict(110,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : RNG008-4 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon May 30 12:35:16 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.65/1.07 ----- EQP 0.9e, May 2009 -----
% 0.65/1.07 The job began on n027.cluster.edu, Mon May 30 12:35:17 2022
% 0.65/1.07 The command was "./eqp09e".
% 0.65/1.07
% 0.65/1.07 set(prolog_style_variables).
% 0.65/1.07 set(lrpo).
% 0.65/1.07 set(basic_paramod).
% 0.65/1.07 set(functional_subsume).
% 0.65/1.07 set(ordered_paramod).
% 0.65/1.07 set(prime_paramod).
% 0.65/1.07 set(para_pairs).
% 0.65/1.07 assign(pick_given_ratio,4).
% 0.65/1.07 clear(print_kept).
% 0.65/1.07 clear(print_new_demod).
% 0.65/1.07 clear(print_back_demod).
% 0.65/1.07 clear(print_given).
% 0.65/1.07 assign(max_mem,64000).
% 0.65/1.07 end_of_commands.
% 0.65/1.07
% 0.65/1.07 Usable:
% 0.65/1.07 end_of_list.
% 0.65/1.07
% 0.65/1.07 Sos:
% 0.65/1.07 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.65/1.07 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.65/1.07 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.65/1.07 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.65/1.07 0 (wt=-1) [] additive_inverse(additive_identity) = additive_identity.
% 0.65/1.07 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.65/1.07 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.65/1.07 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.65/1.07 0 (wt=-1) [] additive_inverse(add(A,B)) = add(additive_inverse(A),additive_inverse(B)).
% 0.65/1.07 0 (wt=-1) [] multiply(A,additive_inverse(B)) = additive_inverse(multiply(A,B)).
% 0.65/1.07 0 (wt=-1) [] multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)).
% 0.65/1.07 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.65/1.07 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.65/1.07 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.65/1.07 0 (wt=-1) [] multiply(A,A) = A.
% 0.65/1.07 0 (wt=-1) [] multiply(a,b) = c.
% 0.65/1.07 0 (wt=-1) [] -(multiply(b,a) = c).
% 0.65/1.07 end_of_list.
% 0.65/1.07
% 0.65/1.07 Demodulators:
% 0.65/1.07 end_of_list.
% 0.65/1.07
% 0.65/1.07 Passive:
% 0.65/1.07 end_of_list.
% 0.65/1.07
% 0.65/1.07 Starting to process input.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.65/1.07 1 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 2 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.65/1.07 2 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 3 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.65/1.07 3 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 4 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.65/1.07 4 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 5 (wt=4) [] additive_inverse(additive_identity) = additive_identity.
% 0.65/1.07 5 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 6 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.65/1.07 6 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 7 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.65/1.07 7 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 8 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.65/1.07 8 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 9 (wt=10) [] additive_inverse(add(A,B)) = add(additive_inverse(A),additive_inverse(B)).
% 0.65/1.07 9 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 10 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(A,additive_inverse(B)).
% 0.65/1.07 10 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 11 (wt=9) [demod([10])] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.65/1.07
% 0.65/1.07 ** KEPT: 12 (wt=9) [flip(11)] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.65/1.07 clause forward subsumed: 0 (wt=9) [flip(12)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.65/1.07
% 0.65/1.07 ** KEPT: 13 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.65/1.07 13 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 14 (wt=7) [] add(A,B) = add(B,A).
% 0.65/1.07 clause forward subsumed: 0 (wt=7) [flip(14)] add(B,A) = add(A,B).
% 0.65/1.07
% 0.65/1.07 ** KEPT: 15 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.65/1.07 15 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 16 (wt=5) [] multiply(A,A) = A.
% 0.65/1.07 16 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 17 (wt=5) [] multiply(a,b) = c.
% 0.65/1.07 17 is a new demodulator.
% 0.65/1.07
% 0.65/1.07 ** KEPT: 18 (wt=5) [] -(multiply(b,a) = c).
% 0.65/1.07 ---------------- PROOF FOUND ----------------
% 0.65/1.07 % SZS status Unsatisfiable
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 After processing input:
% 0.65/1.07
% 0.65/1.07 Usable:
% 0.65/1.07 end_of_list.
% 0.65/1.07
% 0.65/1.07 Sos:
% 0.65/1.07 5 (wt=4) [] additive_inverse(additive_identity) = additive_identity.
% 0.65/1.07 1 (wt=5) [] add(additive_identity,A) = A.
% 0.65/1.07 6 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.65/1.07 7 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.65/1.07 8 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.65/1.07 16 (wt=5) [] multiply(A,A) = A.
% 0.65/1.07 17 (wt=5) [] multiply(a,b) = c.
% 0.65/1.07 18 (wt=5) [] -(multiply(b,a) = c).
% 0.65/1.07 2 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.65/1.07 14 (wt=7) [] add(A,B) = add(B,A).
% 0.65/1.07 10 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(A,additive_inverse(B)).
% 0.65/1.07 11 (wt=9) [demod([10])] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.65/1.07 12 (wt=9) [flip(11)] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.65/1.07 9 (wt=10) [] additive_inverse(add(A,B)) = add(additive_inverse(A),additive_inverse(B)).
% 0.65/1.07 13 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.65/1.07 15 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.65/1.07 3 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.65/1.07 4 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.65/1.07 end_of_list.
% 0.65/1.07
% 0.65/1.07 Demodulators:
% 0.65/1.07 1 (wt=5) [] add(additive_identity,A) = A.
% 0.65/1.07 2 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.65/1.07 3 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.65/1.07 4 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.65/1.07 5 (wt=4) [] additive_inverse(additive_identity) = additive_identity.
% 0.65/1.07 6 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.65/1.07 7 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.65/1.07 8 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.65/1.07 9 (wt=10) [] additive_inverse(add(A,B)) = add(additive_inverse(A),additive_inverse(B)).
% 0.65/1.07 10 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(A,additive_inverse(B)).
% 0.65/1.07 13 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.65/1.07 15 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.65/1.07 16 (wt=5) [] multiply(A,A) = A.
% 0.65/1.07 17 (wt=5) [] multiply(a,b) = c.
% 0.65/1.07 end_of_list.
% 0.65/1.07
% 0.65/1.07 Passive:
% 0.65/1.07 end_of_list.
% 0.65/1.07
% 0.65/1.07 UNIT CONFLICT from 110 and 18 at 0.01 seconds.
% 0.65/1.07
% 0.65/1.07 ---------------- PROOF ----------------
% 0.65/1.07 % SZS output start Refutation
% See solution above
% 0.65/1.07 ------------ end of proof -------------
% 0.65/1.07
% 0.65/1.07
% 0.65/1.07 ------------- memory usage ------------
% 0.65/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.65/1.07 type (bytes each) gets frees in use avail bytes
% 0.65/1.07 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.65/1.07 term ( 16) 16566 14554 2012 19 39.2 K
% 0.65/1.07 gen_ptr ( 8) 11184 2858 8326 22 65.2 K
% 0.65/1.07 context ( 808) 11580 11578 2 5 5.5 K
% 0.65/1.07 trail ( 12) 1374 1374 0 3 0.0 K
% 0.65/1.07 bt_node ( 68) 3992 3989 3 12 1.0 K
% 0.65/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.65/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.65/1.07 ac_match_free_vars_pos (4020)
% 0.65/1.07 0 0 0 0 0.0 K
% 0.65/1.07 discrim ( 12) 1416 173 1243 0 14.6 K
% 0.65/1.07 flat ( 40) 27536 27536 0 47 1.8 K
% 0.65/1.07 discrim_pos ( 12) 1015 1015 0 1 0.0 K
% 0.65/1.07 fpa_head ( 12) 378 0 378 0 4.4 K
% 0.65/1.07 fpa_tree ( 28) 220 220 0 9 0.2 K
% 0.65/1.07 fpa_pos ( 36) 172 172 0 1 0.0 K
% 0.65/1.07 literal ( 12) 843 733 110 1 1.3 K
% 0.65/1.07 clause ( 24) 843 733 110 1 2.6 K
% 0.65/1.07 list ( 12) 121 65 56 3 0.7 K
% 0.65/1.07 list_pos ( 20) 448 120 328 0 6.4 K
% 0.65/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.65/1.07
% 0.65/1.07 -------------- statistics -------------
% 0.65/1.07 Clauses input 17
% 0.65/1.07 Usable input 0
% 0.65/1.07 Sos input 17
% 0.65/1.07 Demodulators input 0
% 0.65/1.07 Passive input 0
% 0.65/1.07
% 0.65/1.07 Processed BS (before search) 20
% 0.65/1.07 Forward subsumed BS 2
% 0.65/1.07 Kept BS 18
% 0.65/1.07 New demodulators BS 14
% 0.65/1.07 Back demodulated BS 0
% 0.65/1.07
% 0.65/1.07 Clauses or pairs given 671
% 0.65/1.07 Clauses generated 461
% 0.65/1.07 Forward subsumed 369
% 0.65/1.07 Deleted by weight 0
% 0.65/1.07 Deleted by variable count 0
% 0.65/1.07 Kept 92
% 0.65/1.07 New demodulators 48
% 0.65/1.07 Back demodulated 21
% 0.65/1.07 Ordered paramod prunes 0
% 0.65/1.07 Basic paramod prunes 701
% 0.65/1.07 Prime paramod prunes 29
% 0.65/1.07 Semantic prunes 0
% 0.65/1.07
% 0.65/1.07 Rewrite attmepts 5608
% 0.65/1.07 Rewrites 841
% 0.65/1.07
% 0.65/1.07 FPA overloads 0
% 0.65/1.07 FPA underloads 0
% 0.65/1.07
% 0.65/1.07 Usable size 0
% 0.65/1.07 Sos size 88
% 0.65/1.07 Demodulators size 43
% 0.65/1.07 Passive size 0
% 0.65/1.07 Disabled size 21
% 0.65/1.07
% 0.65/1.07 Proofs found 1
% 0.65/1.07
% 0.65/1.07 ----------- times (seconds) ----------- Mon May 30 12:35:17 2022
% 0.65/1.07
% 0.65/1.07 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.65/1.07 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.65/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.65/1.07 input time 0.00
% 0.65/1.07 paramodulation time 0.00
% 0.65/1.07 demodulation time 0.00
% 0.65/1.07 orient time 0.00
% 0.65/1.07 weigh time 0.00
% 0.65/1.07 forward subsume time 0.00
% 0.65/1.07 back demod find time 0.00
% 0.65/1.07 conflict time 0.00
% 0.65/1.07 LRPO time 0.00
% 0.65/1.07 store clause time 0.00
% 0.65/1.07 disable clause time 0.00
% 0.65/1.07 prime paramod time 0.00
% 0.65/1.07 semantics time 0.00
% 0.65/1.07
% 0.65/1.07 EQP interrupted
%------------------------------------------------------------------------------