TSTP Solution File: RNG013-6 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG013-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n018.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:30 EDT 2022
% Result : Unsatisfiable 0.49s 1.13s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 3 RR)
% Number of literals : 19 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG013-6.p',unknown),
[] ).
cnf(2,plain,
equal(add(A,additive_identity),A),
file('RNG013-6.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(additive_identity,A),additive_identity),
file('RNG013-6.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,additive_identity),additive_identity),
file('RNG013-6.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG013-6.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG013-6.p',unknown),
[] ).
cnf(7,plain,
equal(additive_inverse(additive_inverse(A)),A),
file('RNG013-6.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG013-6.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG013-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(additive_inverse(multiply(a,b)),multiply(additive_inverse(a),b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(18,plain,
equal(add(multiply(A,additive_inverse(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,8]),4]),1]),
[iquote('para(5,8),demod([4]),flip(1)')] ).
cnf(21,plain,
equal(add(multiply(A,B),multiply(additive_inverse(A),B)),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,9]),3]),1]),
[iquote('para(6,9),demod([3]),flip(1)')] ).
cnf(24,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(120,plain,
equal(additive_inverse(multiply(A,additive_inverse(B))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,24]),2]),
[iquote('para(18,24),demod([2])')] ).
cnf(121,plain,
equal(additive_inverse(multiply(A,B)),multiply(A,additive_inverse(B))),
inference(para,[status(thm),theory(equality)],[120,7]),
[iquote('para(120,7)')] ).
cnf(151,plain,
~ equal(multiply(a,additive_inverse(b)),multiply(additive_inverse(a),b)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),121]),
[iquote('back_demod(16),demod([121])')] ).
cnf(161,plain,
equal(multiply(A,additive_inverse(B)),multiply(additive_inverse(A),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,24]),121,2]),
[iquote('para(21,24),demod([121,2])')] ).
cnf(162,plain,
$false,
inference(conflict,[status(thm)],[161,151]),
[iquote('conflict(161,151)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : RNG013-6 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n018.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 12:28:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.49/1.13 ----- EQP 0.9e, May 2009 -----
% 0.49/1.13 The job began on n018.cluster.edu, Mon May 30 12:28:57 2022
% 0.49/1.13 The command was "./eqp09e".
% 0.49/1.13
% 0.49/1.13 set(prolog_style_variables).
% 0.49/1.13 set(lrpo).
% 0.49/1.13 set(basic_paramod).
% 0.49/1.13 set(functional_subsume).
% 0.49/1.13 set(ordered_paramod).
% 0.49/1.13 set(prime_paramod).
% 0.49/1.13 set(para_pairs).
% 0.49/1.13 assign(pick_given_ratio,4).
% 0.49/1.13 clear(print_kept).
% 0.49/1.13 clear(print_new_demod).
% 0.49/1.13 clear(print_back_demod).
% 0.49/1.13 clear(print_given).
% 0.49/1.13 assign(max_mem,64000).
% 0.49/1.13 end_of_commands.
% 0.49/1.13
% 0.49/1.13 Usable:
% 0.49/1.13 end_of_list.
% 0.49/1.13
% 0.49/1.13 Sos:
% 0.49/1.13 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.49/1.13 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.49/1.13 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.49/1.13 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.49/1.13 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.49/1.13 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.49/1.13 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.49/1.13 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.49/1.13 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.49/1.13 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.49/1.13 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.49/1.13 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.49/1.13 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.49/1.13 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.49/1.13 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.49/1.13 0 (wt=-1) [] -(multiply(additive_inverse(a),b) = additive_inverse(multiply(a,b))).
% 0.49/1.13 end_of_list.
% 0.49/1.13
% 0.49/1.13 Demodulators:
% 0.49/1.13 end_of_list.
% 0.49/1.13
% 0.49/1.13 Passive:
% 0.49/1.13 end_of_list.
% 0.49/1.13
% 0.49/1.13 Starting to process input.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.49/1.13 1 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.49/1.13 2 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.49/1.13 3 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.49/1.13 4 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.49/1.13 5 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.49/1.13 6 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.49/1.13 7 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.49/1.13 8 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.49/1.13 9 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.49/1.13 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.49/1.13
% 0.49/1.13 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.49/1.13 11 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.49/1.13 12 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.49/1.13 13 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.49/1.13 14 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.49/1.13 15 is a new demodulator.
% 0.49/1.13
% 0.49/1.13 ** KEPT: 16 (wt=9) [flip(1)] -(additive_inverse(multiply(a,b)) = multiply(additive_inverse(a),b)).
% 0.49/1.13 ---------------- PROOF FOUND ----------------
% 0.49/1.13 % SZS status Unsatisfiable
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 After processing input:
% 0.49/1.13
% 0.49/1.13 Usable:
% 0.49/1.13 end_of_list.
% 0.49/1.13
% 0.49/1.13 Sos:
% 0.49/1.13 1 (wt=5) [] add(additive_identity,A) = A.
% 0.49/1.13 2 (wt=5) [] add(A,additive_identity) = A.
% 0.49/1.13 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.49/1.13 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.49/1.13 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.49/1.13 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.49/1.13 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.49/1.13 10 (wt=7) [] add(A,B) = add(B,A).
% 0.49/1.13 16 (wt=9) [flip(1)] -(additive_inverse(multiply(a,b)) = multiply(additive_inverse(a),b)).
% 0.49/1.13 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.49/1.13 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.49/1.13 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.49/1.13 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.49/1.13 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.49/1.13 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.49/1.13 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.49/1.13 end_of_list.
% 0.49/1.13
% 0.49/1.13 Demodulators:
% 0.49/1.13 1 (wt=5) [] add(additive_identity,A) = A.
% 0.49/1.13 2 (wt=5) [] add(A,additive_identity) = A.
% 0.49/1.13 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.49/1.13 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.49/1.13 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.49/1.13 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.49/1.13 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.49/1.13 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.49/1.13 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.49/1.13 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.49/1.13 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.49/1.13 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.49/1.13 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.49/1.13 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.49/1.13 end_of_list.
% 0.49/1.13
% 0.49/1.13 Passive:
% 0.49/1.13 end_of_list.
% 0.49/1.13
% 0.49/1.13 UNIT CONFLICT from 161 and 151 at 0.02 seconds.
% 0.49/1.13
% 0.49/1.13 ---------------- PROOF ----------------
% 0.49/1.13 % SZS output start Refutation
% See solution above
% 0.49/1.13 ------------ end of proof -------------
% 0.49/1.13
% 0.49/1.13
% 0.49/1.13 ------------- memory usage ------------
% 0.49/1.13 Memory dynamically allocated (tp_alloc): 488.
% 0.49/1.13 type (bytes each) gets frees in use avail bytes
% 0.49/1.13 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.49/1.13 term ( 16) 15317 12482 2835 18 55.1 K
% 0.49/1.13 gen_ptr ( 8) 15011 3551 11460 18 89.7 K
% 0.49/1.13 context ( 808) 11337 11335 2 5 5.5 K
% 0.49/1.13 trail ( 12) 686 686 0 4 0.0 K
% 0.49/1.13 bt_node ( 68) 4014 4011 3 12 1.0 K
% 0.49/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.49/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.49/1.13 ac_match_free_vars_pos (4020)
% 0.49/1.13 0 0 0 0 0.0 K
% 0.49/1.13 discrim ( 12) 2598 884 1714 0 20.1 K
% 0.49/1.13 flat ( 40) 25203 25203 0 47 1.8 K
% 0.49/1.13 discrim_pos ( 12) 866 866 0 1 0.0 K
% 0.49/1.13 fpa_head ( 12) 908 0 908 0 10.6 K
% 0.49/1.13 fpa_tree ( 28) 425 425 0 9 0.2 K
% 0.49/1.13 fpa_pos ( 36) 293 293 0 1 0.0 K
% 0.49/1.13 literal ( 12) 711 550 161 1 1.9 K
% 0.49/1.13 clause ( 24) 711 550 161 1 3.8 K
% 0.49/1.13 list ( 12) 191 135 56 3 0.7 K
% 0.49/1.13 list_pos ( 20) 728 261 467 0 9.1 K
% 0.49/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.49/1.13
% 0.49/1.13 -------------- statistics -------------
% 0.49/1.13 Clauses input 16
% 0.49/1.13 Usable input 0
% 0.49/1.13 Sos input 16
% 0.49/1.13 Demodulators input 0
% 0.49/1.13 Passive input 0
% 0.49/1.13
% 0.49/1.13 Processed BS (before search) 17
% 0.49/1.13 Forward subsumed BS 1
% 0.49/1.13 Kept BS 16
% 0.49/1.13 New demodulators BS 14
% 0.49/1.13 Back demodulated BS 0
% 0.49/1.13
% 0.49/1.13 Clauses or pairs given 890
% 0.49/1.13 Clauses generated 428
% 0.49/1.13 Forward subsumed 283
% 0.49/1.13 Deleted by weight 0
% 0.49/1.13 Deleted by variable count 0
% 0.49/1.13 Kept 145
% 0.49/1.13 New demodulators 118
% 0.49/1.13 Back demodulated 50
% 0.49/1.13 Ordered paramod prunes 0
% 0.49/1.13 Basic paramod prunes 1060
% 0.49/1.13 Prime paramod prunes 24
% 0.49/1.13 Semantic prunes 0
% 0.49/1.13
% 0.49/1.13 Rewrite attmepts 5044
% 0.49/1.13 Rewrites 780
% 0.49/1.13
% 0.49/1.13 FPA overloads 0
% 0.49/1.13 FPA underloads 0
% 0.49/1.13
% 0.49/1.13 Usable size 0
% 0.49/1.13 Sos size 110
% 0.49/1.13 Demodulators size 87
% 0.49/1.13 Passive size 0
% 0.49/1.13 Disabled size 50
% 0.49/1.13
% 0.49/1.13 Proofs found 1
% 0.49/1.13
% 0.49/1.13 ----------- times (seconds) ----------- Mon May 30 12:28:57 2022
% 0.49/1.13
% 0.49/1.13 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.49/1.13 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.49/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.49/1.13 input time 0.00
% 0.49/1.13 paramodulation time 0.00
% 0.49/1.13 demodulation time 0.00
% 0.49/1.13 orient time 0.00
% 0.49/1.13 weigh time 0.00
% 0.49/1.13 forward subsume time 0.00
% 0.49/1.13 back demod find time 0.00
% 0.49/1.13 conflict time 0.00
% 0.49/1.13 LRPO time 0.00
% 0.49/1.13 store clause time 0.00
% 0.49/1.13 disable clause time 0.00
% 0.49/1.13 prime paramod time 0.00
% 0.49/1.13 semantics time 0.00
% 0.49/1.13
% 0.49/1.13 EQP interrupted
%------------------------------------------------------------------------------