TSTP Solution File: RNG020-6 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG020-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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.21s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 2 RR)
% Number of literals : 24 ( 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 : 55 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG020-6.p',unknown),
[] ).
cnf(2,plain,
equal(add(A,additive_identity),A),
file('RNG020-6.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,additive_identity),additive_identity),
file('RNG020-6.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG020-6.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG020-6.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG020-6.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG020-6.p',unknown),
[] ).
cnf(10,plain,
equal(add(A,B),add(B,A)),
file('RNG020-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,u,y),associator(x,v,y)),associator(x,add(u,v),y)),
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(46,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(multiply(A,D),C),additive_inverse(add(multiply(A,multiply(B,C)),multiply(A,multiply(D,C)))))),associator(A,add(B,D),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,14]),9,9,8,11]),
[iquote('para(8,14),demod([9,9,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(94,plain,
equal(add(multiply(multiply(A,B),C),add(associator(A,D,C),additive_inverse(multiply(A,multiply(B,C))))),associator(A,add(B,D),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),87,51]),
[iquote('back_demod(46),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(104,plain,
equal(add(multiply(multiply(A,B),C),add(associator(A,D,C),multiply(A,multiply(B,additive_inverse(C))))),associator(A,add(B,D),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[94]),100,100]),
[iquote('back_demod(94),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(602,plain,
equal(add(associator(A,B,C),associator(A,D,C)),associator(A,add(B,D),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,104]),124]),
[iquote('para(10,104),demod([124])')] ).
cnf(603,plain,
$false,
inference(conflict,[status(thm)],[602,16]),
[iquote('conflict(602,16)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG020-6 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 05:16:12 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.21 ----- EQP 0.9e, May 2009 -----
% 0.72/1.21 The job began on n025.cluster.edu, Mon May 30 05:16:12 2022
% 0.72/1.21 The command was "./eqp09e".
% 0.72/1.21
% 0.72/1.21 set(prolog_style_variables).
% 0.72/1.21 set(lrpo).
% 0.72/1.21 set(basic_paramod).
% 0.72/1.21 set(functional_subsume).
% 0.72/1.21 set(ordered_paramod).
% 0.72/1.21 set(prime_paramod).
% 0.72/1.21 set(para_pairs).
% 0.72/1.21 assign(pick_given_ratio,4).
% 0.72/1.21 clear(print_kept).
% 0.72/1.21 clear(print_new_demod).
% 0.72/1.21 clear(print_back_demod).
% 0.72/1.21 clear(print_given).
% 0.72/1.21 assign(max_mem,64000).
% 0.72/1.21 end_of_commands.
% 0.72/1.21
% 0.72/1.21 Usable:
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Sos:
% 0.72/1.21 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.72/1.21 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.72/1.21 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.72/1.21 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.72/1.21 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.72/1.21 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.72/1.21 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.72/1.21 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.21 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.72/1.21 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.72/1.21 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.72/1.21 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.72/1.21 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.72/1.21 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.72/1.21 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.72/1.21 0 (wt=-1) [] -(associator(x,add(u,v),y) = add(associator(x,u,y),associator(x,v,y))).
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Demodulators:
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Passive:
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Starting to process input.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.72/1.21 1 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.72/1.21 2 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.72/1.21 3 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.72/1.21 4 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.72/1.21 5 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.72/1.21 6 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.72/1.21 7 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.21 8 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.72/1.21 9 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.72/1.21 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.72/1.21
% 0.72/1.21 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.72/1.21 11 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.72/1.21 12 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.72/1.21 13 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** 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.21 14 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.72/1.21 15 is a new demodulator.
% 0.72/1.21
% 0.72/1.21 ** KEPT: 16 (wt=16) [flip(1)] -(add(associator(x,u,y),associator(x,v,y)) = associator(x,add(u,v),y)).
% 0.72/1.21 ---------------- PROOF FOUND ----------------
% 0.72/1.21 % SZS status Unsatisfiable
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 After processing input:
% 0.72/1.21
% 0.72/1.21 Usable:
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Sos:
% 0.72/1.21 1 (wt=5) [] add(additive_identity,A) = A.
% 0.72/1.21 2 (wt=5) [] add(A,additive_identity) = A.
% 0.72/1.21 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.72/1.21 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.72/1.21 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.72/1.21 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.72/1.21 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.72/1.21 10 (wt=7) [] add(A,B) = add(B,A).
% 0.72/1.21 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.72/1.21 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.72/1.21 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.72/1.21 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.72/1.21 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.21 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.72/1.21 16 (wt=16) [flip(1)] -(add(associator(x,u,y),associator(x,v,y)) = associator(x,add(u,v),y)).
% 0.72/1.21 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.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Demodulators:
% 0.72/1.21 1 (wt=5) [] add(additive_identity,A) = A.
% 0.72/1.21 2 (wt=5) [] add(A,additive_identity) = A.
% 0.72/1.21 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.72/1.21 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.72/1.21 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.72/1.21 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.72/1.21 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.72/1.21 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.21 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.72/1.21 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.72/1.21 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.72/1.21 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.72/1.21 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.21 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 Passive:
% 0.72/1.21 end_of_list.
% 0.72/1.21
% 0.72/1.21 UNIT CONFLICT from 602 and 16 at 0.06 seconds.
% 0.72/1.21
% 0.72/1.21 ---------------- PROOF ----------------
% 0.72/1.21 % SZS output start Refutation
% See solution above
% 0.72/1.21 ------------ end of proof -------------
% 0.72/1.21
% 0.72/1.21
% 0.72/1.21 ------------- memory usage ------------
% 0.72/1.21 Memory dynamically allocated (tp_alloc): 1464.
% 0.72/1.21 type (bytes each) gets frees in use avail bytes
% 0.72/1.21 sym_ent ( 96) 61 0 61 0 5.7 K
% 0.72/1.21 term ( 16) 92300 74043 18257 43 355.1 K
% 0.72/1.21 gen_ptr ( 8) 102645 14114 88531 23 691.8 K
% 0.72/1.21 context ( 808) 64823 64821 2 6 6.3 K
% 0.72/1.21 trail ( 12) 2863 2863 0 5 0.1 K
% 0.72/1.21 bt_node ( 68) 21530 21527 3 20 1.5 K
% 0.72/1.21 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.21 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.21 ac_match_free_vars_pos (4020)
% 0.72/1.21 0 0 0 0 0.0 K
% 0.72/1.21 discrim ( 12) 17419 2408 15011 0 175.9 K
% 0.72/1.21 flat ( 40) 175578 175578 0 107 4.2 K
% 0.72/1.21 discrim_pos ( 12) 5224 5224 0 1 0.0 K
% 0.72/1.21 fpa_head ( 12) 2452 0 2452 0 28.7 K
% 0.72/1.21 fpa_tree ( 28) 2136 2136 0 19 0.5 K
% 0.72/1.21 fpa_pos ( 36) 1000 1000 0 1 0.0 K
% 0.72/1.21 literal ( 12) 3130 2528 602 1 7.1 K
% 0.72/1.21 clause ( 24) 3130 2528 602 1 14.1 K
% 0.72/1.21 list ( 12) 457 401 56 3 0.7 K
% 0.72/1.21 list_pos ( 20) 2426 510 1916 0 37.4 K
% 0.72/1.21 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.21
% 0.72/1.21 -------------- statistics -------------
% 0.72/1.21 Clauses input 16
% 0.72/1.21 Usable input 0
% 0.72/1.21 Sos input 16
% 0.72/1.21 Demodulators input 0
% 0.72/1.21 Passive input 0
% 0.72/1.21
% 0.72/1.21 Processed BS (before search) 17
% 0.72/1.21 Forward subsumed BS 1
% 0.72/1.21 Kept BS 16
% 0.72/1.21 New demodulators BS 14
% 0.72/1.21 Back demodulated BS 0
% 0.72/1.21
% 0.72/1.21 Clauses or pairs given 4440
% 0.72/1.21 Clauses generated 1946
% 0.72/1.21 Forward subsumed 1360
% 0.72/1.21 Deleted by weight 0
% 0.72/1.21 Deleted by variable count 0
% 0.72/1.21 Kept 586
% 0.72/1.21 New demodulators 384
% 0.72/1.21 Back demodulated 103
% 0.72/1.21 Ordered paramod prunes 0
% 0.72/1.21 Basic paramod prunes 9045
% 0.72/1.21 Prime paramod prunes 169
% 0.72/1.21 Semantic prunes 0
% 0.72/1.21
% 0.72/1.21 Rewrite attmepts 31158
% 0.72/1.21 Rewrites 4713
% 0.72/1.21
% 0.72/1.21 FPA overloads 0
% 0.72/1.21 FPA underloads 0
% 0.72/1.21
% 0.72/1.21 Usable size 0
% 0.72/1.21 Sos size 498
% 0.72/1.21 Demodulators size 319
% 0.72/1.21 Passive size 0
% 0.72/1.21 Disabled size 103
% 0.72/1.21
% 0.72/1.21 Proofs found 1
% 0.72/1.21
% 0.72/1.21 ----------- times (seconds) ----------- Mon May 30 05:16:12 2022
% 0.72/1.21
% 0.72/1.21 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.72/1.21 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.72/1.21 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.21 input time 0.00
% 0.72/1.21 paramodulation time 0.01
% 0.72/1.21 demodulation time 0.01
% 0.72/1.21 orient time 0.01
% 0.72/1.21 weigh time 0.00
% 0.72/1.21 forward subsume time 0.00
% 0.72/1.21 back demod find time 0.00
% 0.72/1.21 conflict time 0.00
% 0.72/1.21 LRPO time 0.00
% 0.72/1.21 store clause time 0.01
% 0.72/1.21 disable clause time 0.00
% 0.72/1.21 prime paramod time 0.00
% 0.72/1.21 semantics time 0.00
% 0.72/1.21
% 0.72/1.21 EQP interrupted
%------------------------------------------------------------------------------