TSTP Solution File: RNG012-6 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG012-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n032.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.53s 0.94s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 2 RR)
% Number of literals : 17 ( 0 equ; 1 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 : 27 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG012-6.p',unknown),
[] ).
cnf(2,plain,
equal(add(A,additive_identity),A),
file('RNG012-6.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(additive_identity,A),additive_identity),
file('RNG012-6.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,additive_identity),additive_identity),
file('RNG012-6.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG012-6.p',unknown),
[] ).
cnf(7,plain,
equal(additive_inverse(additive_inverse(A)),A),
file('RNG012-6.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG012-6.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG012-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(multiply(additive_inverse(a),additive_inverse(b)),multiply(a,b)),
file('RNG012-6.p',unknown),
[] ).
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(20,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(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(161,plain,
equal(multiply(additive_inverse(A),additive_inverse(B)),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,24]),121,2]),
[iquote('para(20,24),demod([121,2])')] ).
cnf(162,plain,
$false,
inference(conflict,[status(thm)],[161,16]),
[iquote('conflict(161,16)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : RNG012-6 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.10 % Command : tptp2X_and_run_eqp %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Mon May 30 05:36:12 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.53/0.94 ----- EQP 0.9e, May 2009 -----
% 0.53/0.94 The job began on n032.cluster.edu, Mon May 30 05:36:12 2022
% 0.53/0.94 The command was "./eqp09e".
% 0.53/0.94
% 0.53/0.94 set(prolog_style_variables).
% 0.53/0.94 set(lrpo).
% 0.53/0.94 set(basic_paramod).
% 0.53/0.94 set(functional_subsume).
% 0.53/0.94 set(ordered_paramod).
% 0.53/0.94 set(prime_paramod).
% 0.53/0.94 set(para_pairs).
% 0.53/0.94 assign(pick_given_ratio,4).
% 0.53/0.94 clear(print_kept).
% 0.53/0.94 clear(print_new_demod).
% 0.53/0.94 clear(print_back_demod).
% 0.53/0.94 clear(print_given).
% 0.53/0.94 assign(max_mem,64000).
% 0.53/0.94 end_of_commands.
% 0.53/0.94
% 0.53/0.94 Usable:
% 0.53/0.94 end_of_list.
% 0.53/0.94
% 0.53/0.94 Sos:
% 0.53/0.94 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.53/0.94 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.53/0.94 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.53/0.94 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.53/0.94 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.53/0.94 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.53/0.94 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.53/0.94 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.53/0.94 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.53/0.94 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.53/0.94 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.53/0.94 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.53/0.94 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.53/0.94 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.53/0.94 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.53/0.94 0 (wt=-1) [] -(multiply(additive_inverse(a),additive_inverse(b)) = multiply(a,b)).
% 0.53/0.94 end_of_list.
% 0.53/0.94
% 0.53/0.94 Demodulators:
% 0.53/0.94 end_of_list.
% 0.53/0.94
% 0.53/0.94 Passive:
% 0.53/0.94 end_of_list.
% 0.53/0.94
% 0.53/0.94 Starting to process input.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.53/0.94 1 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.53/0.94 2 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.53/0.94 3 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.53/0.94 4 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.53/0.94 5 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.53/0.94 6 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.53/0.94 7 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.53/0.94 8 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.53/0.94 9 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.53/0.94 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.53/0.94
% 0.53/0.94 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.53/0.94 11 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.53/0.94 12 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.53/0.94 13 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.53/0.94 14 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.53/0.94 15 is a new demodulator.
% 0.53/0.94
% 0.53/0.94 ** KEPT: 16 (wt=9) [] -(multiply(additive_inverse(a),additive_inverse(b)) = multiply(a,b)).
% 0.53/0.94 ---------------- PROOF FOUND ----------------
% 0.53/0.94 % SZS status Unsatisfiable
% 0.53/0.94
% 0.53/0.94
% 0.53/0.94 After processing input:
% 0.53/0.94
% 0.53/0.94 Usable:
% 0.53/0.94 end_of_list.
% 0.53/0.94
% 0.53/0.94 Sos:
% 0.53/0.94 1 (wt=5) [] add(additive_identity,A) = A.
% 0.53/0.94 2 (wt=5) [] add(A,additive_identity) = A.
% 0.53/0.94 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.53/0.94 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.53/0.94 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.53/0.94 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.53/0.94 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.53/0.94 10 (wt=7) [] add(A,B) = add(B,A).
% 0.53/0.94 16 (wt=9) [] -(multiply(additive_inverse(a),additive_inverse(b)) = multiply(a,b)).
% 0.53/0.94 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.53/0.94 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.53/0.94 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.53/0.94 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.53/0.94 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.53/0.94 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.53/0.94 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.53/0.94 end_of_list.
% 0.53/0.94
% 0.53/0.94 Demodulators:
% 0.53/0.94 1 (wt=5) [] add(additive_identity,A) = A.
% 0.53/0.94 2 (wt=5) [] add(A,additive_identity) = A.
% 0.53/0.94 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.53/0.94 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.53/0.94 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.53/0.94 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.53/0.94 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.53/0.94 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.53/0.94 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.53/0.94 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.53/0.94 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.53/0.94 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.53/0.94 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.53/0.94 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.53/0.94 end_of_list.
% 0.53/0.94
% 0.53/0.94 Passive:
% 0.53/0.94 end_of_list.
% 0.53/0.94
% 0.53/0.94 UNIT CONFLICT from 161 and 16 at 0.01 seconds.
% 0.53/0.94
% 0.53/0.94 ---------------- PROOF ----------------
% 0.53/0.94 % SZS output start Refutation
% See solution above
% 0.53/0.94 ------------ end of proof -------------
% 0.53/0.94
% 0.53/0.94
% 0.53/0.94 ------------- memory usage ------------
% 0.53/0.94 Memory dynamically allocated (tp_alloc): 488.
% 0.53/0.94 type (bytes each) gets frees in use avail bytes
% 0.53/0.94 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.53/0.94 term ( 16) 15371 12528 2843 16 55.2 K
% 0.53/0.94 gen_ptr ( 8) 15046 3567 11479 16 89.8 K
% 0.53/0.94 context ( 808) 11466 11464 2 5 5.5 K
% 0.53/0.94 trail ( 12) 694 694 0 4 0.0 K
% 0.53/0.94 bt_node ( 68) 4085 4082 3 12 1.0 K
% 0.53/0.94 ac_position (285432) 0 0 0 0 0.0 K
% 0.53/0.94 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.53/0.94 ac_match_free_vars_pos (4020)
% 0.53/0.94 0 0 0 0 0.0 K
% 0.53/0.94 discrim ( 12) 2594 875 1719 0 20.1 K
% 0.53/0.94 flat ( 40) 25312 25312 0 47 1.8 K
% 0.53/0.94 discrim_pos ( 12) 873 873 0 1 0.0 K
% 0.53/0.94 fpa_head ( 12) 902 0 902 0 10.6 K
% 0.53/0.94 fpa_tree ( 28) 426 426 0 7 0.2 K
% 0.53/0.94 fpa_pos ( 36) 294 294 0 1 0.0 K
% 0.53/0.94 literal ( 12) 716 555 161 1 1.9 K
% 0.53/0.94 clause ( 24) 716 555 161 1 3.8 K
% 0.53/0.94 list ( 12) 192 136 56 3 0.7 K
% 0.53/0.94 list_pos ( 20) 727 257 470 0 9.2 K
% 0.53/0.94 pair_index ( 40) 2 0 2 0 0.1 K
% 0.53/0.94
% 0.53/0.94 -------------- statistics -------------
% 0.53/0.94 Clauses input 16
% 0.53/0.94 Usable input 0
% 0.53/0.94 Sos input 16
% 0.53/0.94 Demodulators input 0
% 0.53/0.94 Passive input 0
% 0.53/0.94
% 0.53/0.94 Processed BS (before search) 17
% 0.53/0.94 Forward subsumed BS 1
% 0.53/0.94 Kept BS 16
% 0.53/0.94 New demodulators BS 14
% 0.53/0.94 Back demodulated BS 0
% 0.53/0.94
% 0.53/0.94 Clauses or pairs given 890
% 0.53/0.94 Clauses generated 432
% 0.53/0.94 Forward subsumed 287
% 0.53/0.94 Deleted by weight 0
% 0.53/0.94 Deleted by variable count 0
% 0.53/0.94 Kept 145
% 0.53/0.94 New demodulators 119
% 0.53/0.94 Back demodulated 49
% 0.53/0.94 Ordered paramod prunes 0
% 0.53/0.94 Basic paramod prunes 1101
% 0.53/0.94 Prime paramod prunes 24
% 0.53/0.94 Semantic prunes 0
% 0.53/0.94
% 0.53/0.94 Rewrite attmepts 5071
% 0.53/0.94 Rewrites 787
% 0.53/0.94
% 0.53/0.94 FPA overloads 0
% 0.53/0.94 FPA underloads 0
% 0.53/0.94
% 0.53/0.94 Usable size 0
% 0.53/0.94 Sos size 111
% 0.53/0.94 Demodulators size 88
% 0.53/0.94 Passive size 0
% 0.53/0.94 Disabled size 49
% 0.53/0.94
% 0.53/0.94 Proofs found 1
% 0.53/0.94
% 0.53/0.94 ----------- times (seconds) ----------- Mon May 30 05:36:12 2022
% 0.53/0.94
% 0.53/0.94 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.53/0.94 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.53/0.94 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.53/0.94 input time 0.00
% 0.53/0.94 paramodulation time 0.00
% 0.53/0.94 demodulation time 0.00
% 0.53/0.94 orient time 0.00
% 0.53/0.94 weigh time 0.00
% 0.53/0.94 forward subsume time 0.00
% 0.53/0.94 back demod find time 0.00
% 0.53/0.94 conflict time 0.00
% 0.53/0.94 LRPO time 0.00
% 0.53/0.94 store clause time 0.00
% 0.53/0.94 disable clause time 0.00
% 0.53/0.94 prime paramod time 0.00
% 0.53/0.94 semantics time 0.00
% 0.53/0.94
% 0.53/0.94 EQP interrupted
%------------------------------------------------------------------------------