TSTP Solution File: RNG023-6 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG023-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:32 EDT 2022
% Result : Unsatisfiable 0.76s 1.15s
% Output : Refutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 2 RR)
% Number of literals : 7 ( 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; 3 con; 0-3 aty)
% Number of variables : 9 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG023-6.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG023-6.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(multiply(A,A),B),multiply(A,multiply(A,B))),
file('RNG023-6.p',unknown),
[] ).
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(associator(x,x,y),additive_identity),
file('RNG023-6.p',unknown),
[] ).
cnf(57,plain,
equal(associator(A,A,B),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,14]),6]),1]),
[iquote('para(13,14),demod([6]),flip(1)')] ).
cnf(58,plain,
$false,
inference(conflict,[status(thm)],[57,16]),
[iquote('conflict(57,16)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG023-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 12:45:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.76/1.15 ----- EQP 0.9e, May 2009 -----
% 0.76/1.15 The job began on n025.cluster.edu, Mon May 30 12:45:43 2022
% 0.76/1.15 The command was "./eqp09e".
% 0.76/1.15
% 0.76/1.15 set(prolog_style_variables).
% 0.76/1.15 set(lrpo).
% 0.76/1.15 set(basic_paramod).
% 0.76/1.15 set(functional_subsume).
% 0.76/1.15 set(ordered_paramod).
% 0.76/1.15 set(prime_paramod).
% 0.76/1.15 set(para_pairs).
% 0.76/1.15 assign(pick_given_ratio,4).
% 0.76/1.15 clear(print_kept).
% 0.76/1.15 clear(print_new_demod).
% 0.76/1.15 clear(print_back_demod).
% 0.76/1.15 clear(print_given).
% 0.76/1.15 assign(max_mem,64000).
% 0.76/1.15 end_of_commands.
% 0.76/1.15
% 0.76/1.15 Usable:
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Sos:
% 0.76/1.15 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.76/1.15 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.76/1.15 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.76/1.15 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.76/1.15 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.76/1.15 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.76/1.15 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.76/1.15 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.76/1.15 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.76/1.15 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.76/1.15 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.76/1.15 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.76/1.15 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.76/1.15 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.76/1.15 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.76/1.15 0 (wt=-1) [] -(associator(x,x,y) = additive_identity).
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Demodulators:
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Passive:
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Starting to process input.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.76/1.15 1 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.76/1.15 2 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.76/1.15 3 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.76/1.15 4 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.76/1.15 5 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.76/1.15 6 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.76/1.15 7 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.76/1.15 8 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.76/1.15 9 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.76/1.15 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.76/1.15
% 0.76/1.15 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.76/1.15 11 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.76/1.15 12 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.76/1.15 13 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.76/1.15 14 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.76/1.15 15 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 16 (wt=6) [] -(associator(x,x,y) = additive_identity).
% 0.76/1.15 ---------------- PROOF FOUND ----------------
% 0.76/1.15 % SZS status Unsatisfiable
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 After processing input:
% 0.76/1.15
% 0.76/1.15 Usable:
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Sos:
% 0.76/1.15 1 (wt=5) [] add(additive_identity,A) = A.
% 0.76/1.15 2 (wt=5) [] add(A,additive_identity) = A.
% 0.76/1.15 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.76/1.15 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.76/1.15 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.76/1.15 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.76/1.15 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.76/1.15 16 (wt=6) [] -(associator(x,x,y) = additive_identity).
% 0.76/1.15 10 (wt=7) [] add(A,B) = add(B,A).
% 0.76/1.15 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.76/1.15 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.76/1.15 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.76/1.15 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.76/1.15 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.76/1.15 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.76/1.15 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Demodulators:
% 0.76/1.15 1 (wt=5) [] add(additive_identity,A) = A.
% 0.76/1.15 2 (wt=5) [] add(A,additive_identity) = A.
% 0.76/1.15 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.76/1.15 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.76/1.15 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.76/1.15 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.76/1.15 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.76/1.15 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.76/1.15 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.76/1.15 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.76/1.15 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.76/1.15 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.76/1.15 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.76/1.15 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Passive:
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 UNIT CONFLICT from 57 and 16 at 0.00 seconds.
% 0.76/1.15
% 0.76/1.15 ---------------- PROOF ----------------
% 0.76/1.15 % SZS output start Refutation
% See solution above
% 0.76/1.15 ------------ end of proof -------------
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 ------------- memory usage ------------
% 0.76/1.15 Memory dynamically allocated (tp_alloc): 488.
% 0.76/1.15 type (bytes each) gets frees in use avail bytes
% 0.76/1.15 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.76/1.15 term ( 16) 5104 4250 854 17 16.8 K
% 0.76/1.15 gen_ptr ( 8) 4201 836 3365 6 26.3 K
% 0.76/1.15 context ( 808) 3562 3560 2 5 5.5 K
% 0.76/1.15 trail ( 12) 172 172 0 4 0.0 K
% 0.76/1.15 bt_node ( 68) 1401 1396 5 1 0.4 K
% 0.76/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.76/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.76/1.15 ac_match_free_vars_pos (4020)
% 0.76/1.15 0 0 0 0 0.0 K
% 0.76/1.15 discrim ( 12) 913 7 906 0 10.6 K
% 0.76/1.15 flat ( 40) 5551 5551 0 31 1.2 K
% 0.76/1.15 discrim_pos ( 12) 277 277 0 1 0.0 K
% 0.76/1.15 fpa_head ( 12) 538 0 538 0 6.3 K
% 0.76/1.15 fpa_tree ( 28) 127 127 0 7 0.2 K
% 0.76/1.15 fpa_pos ( 36) 106 106 0 1 0.0 K
% 0.76/1.15 literal ( 12) 247 190 57 1 0.7 K
% 0.76/1.15 clause ( 24) 247 190 57 1 1.4 K
% 0.76/1.15 list ( 12) 108 52 56 3 0.7 K
% 0.76/1.15 list_pos ( 20) 235 21 214 0 4.2 K
% 0.76/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.76/1.15
% 0.76/1.15 -------------- statistics -------------
% 0.76/1.15 Clauses input 16
% 0.76/1.15 Usable input 0
% 0.76/1.15 Sos input 16
% 0.76/1.15 Demodulators input 0
% 0.76/1.15 Passive input 0
% 0.76/1.15
% 0.76/1.15 Processed BS (before search) 17
% 0.76/1.15 Forward subsumed BS 1
% 0.76/1.15 Kept BS 16
% 0.76/1.15 New demodulators BS 14
% 0.76/1.15 Back demodulated BS 0
% 0.76/1.15
% 0.76/1.15 Clauses or pairs given 300
% 0.76/1.15 Clauses generated 160
% 0.76/1.15 Forward subsumed 119
% 0.76/1.15 Deleted by weight 0
% 0.76/1.15 Deleted by variable count 0
% 0.76/1.15 Kept 41
% 0.76/1.15 New demodulators 35
% 0.76/1.15 Back demodulated 1
% 0.76/1.15 Ordered paramod prunes 0
% 0.76/1.15 Basic paramod prunes 260
% 0.76/1.15 Prime paramod prunes 18
% 0.76/1.15 Semantic prunes 0
% 0.76/1.15
% 0.76/1.15 Rewrite attmepts 1396
% 0.76/1.15 Rewrites 250
% 0.76/1.15
% 0.76/1.15 FPA overloads 0
% 0.76/1.15 FPA underloads 0
% 0.76/1.15
% 0.76/1.15 Usable size 0
% 0.76/1.15 Sos size 55
% 0.76/1.15 Demodulators size 48
% 0.76/1.15 Passive size 0
% 0.76/1.15 Disabled size 1
% 0.76/1.15
% 0.76/1.15 Proofs found 1
% 0.76/1.15
% 0.76/1.15 ----------- times (seconds) ----------- Mon May 30 12:45:43 2022
% 0.76/1.15
% 0.76/1.15 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.76/1.15 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.76/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.76/1.15 input time 0.00
% 0.76/1.15 paramodulation time 0.00
% 0.76/1.15 demodulation time 0.00
% 0.76/1.15 orient time 0.00
% 0.76/1.15 weigh time 0.00
% 0.76/1.15 forward subsume time 0.00
% 0.76/1.15 back demod find time 0.00
% 0.76/1.15 conflict time 0.00
% 0.76/1.15 LRPO time 0.00
% 0.76/1.15 store clause time 0.00
% 0.76/1.15 disable clause time 0.00
% 0.76/1.15 prime paramod time 0.00
% 0.76/1.15 semantics time 0.00
% 0.76/1.15
% 0.76/1.15 EQP interrupted
%------------------------------------------------------------------------------