TSTP Solution File: RNG024-6 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG024-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:32 EDT 2022
% Result : Unsatisfiable 0.73s 1.09s
% Output : Refutation 0.73s
% 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('RNG024-6.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG024-6.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(multiply(A,B),B),multiply(A,multiply(B,B))),
file('RNG024-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,y,y),additive_identity),
file('RNG024-6.p',unknown),
[] ).
cnf(53,plain,
equal(associator(A,B,B),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,14]),6]),1]),
[iquote('para(12,14),demod([6]),flip(1)')] ).
cnf(54,plain,
$false,
inference(conflict,[status(thm)],[53,16]),
[iquote('conflict(53,16)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG024-6 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon May 30 09:08:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.09 ----- EQP 0.9e, May 2009 -----
% 0.73/1.09 The job began on n018.cluster.edu, Mon May 30 09:08:12 2022
% 0.73/1.09 The command was "./eqp09e".
% 0.73/1.09
% 0.73/1.09 set(prolog_style_variables).
% 0.73/1.09 set(lrpo).
% 0.73/1.09 set(basic_paramod).
% 0.73/1.09 set(functional_subsume).
% 0.73/1.09 set(ordered_paramod).
% 0.73/1.09 set(prime_paramod).
% 0.73/1.09 set(para_pairs).
% 0.73/1.09 assign(pick_given_ratio,4).
% 0.73/1.09 clear(print_kept).
% 0.73/1.09 clear(print_new_demod).
% 0.73/1.09 clear(print_back_demod).
% 0.73/1.09 clear(print_given).
% 0.73/1.09 assign(max_mem,64000).
% 0.73/1.09 end_of_commands.
% 0.73/1.09
% 0.73/1.09 Usable:
% 0.73/1.09 end_of_list.
% 0.73/1.09
% 0.73/1.09 Sos:
% 0.73/1.09 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.73/1.09 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.73/1.09 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.73/1.09 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.73/1.09 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.73/1.09 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.73/1.09 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.73/1.09 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.73/1.09 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.73/1.09 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.73/1.09 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.73/1.09 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.73/1.09 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.73/1.09 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.73/1.09 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.73/1.09 0 (wt=-1) [] -(associator(x,y,y) = additive_identity).
% 0.73/1.09 end_of_list.
% 0.73/1.09
% 0.73/1.09 Demodulators:
% 0.73/1.09 end_of_list.
% 0.73/1.09
% 0.73/1.09 Passive:
% 0.73/1.09 end_of_list.
% 0.73/1.09
% 0.73/1.09 Starting to process input.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.73/1.09 1 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.73/1.09 2 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.73/1.09 3 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.73/1.09 4 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.73/1.09 5 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.73/1.09 6 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.73/1.09 7 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.73/1.09 8 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.73/1.09 9 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.73/1.09 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.73/1.09
% 0.73/1.09 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.73/1.09 11 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.73/1.09 12 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.73/1.09 13 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.73/1.09 14 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.73/1.09 15 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 16 (wt=6) [] -(associator(x,y,y) = additive_identity).
% 0.73/1.09 ---------------- PROOF FOUND ----------------
% 0.73/1.09 % SZS status Unsatisfiable
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 After processing input:
% 0.73/1.09
% 0.73/1.09 Usable:
% 0.73/1.09 end_of_list.
% 0.73/1.09
% 0.73/1.09 Sos:
% 0.73/1.09 1 (wt=5) [] add(additive_identity,A) = A.
% 0.73/1.09 2 (wt=5) [] add(A,additive_identity) = A.
% 0.73/1.09 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.73/1.09 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.73/1.09 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.73/1.09 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.73/1.09 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.73/1.09 16 (wt=6) [] -(associator(x,y,y) = additive_identity).
% 0.73/1.09 10 (wt=7) [] add(A,B) = add(B,A).
% 0.73/1.09 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.73/1.09 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.73/1.09 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.73/1.09 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.73/1.09 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.73/1.09 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.73/1.09 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.73/1.09 end_of_list.
% 0.73/1.09
% 0.73/1.09 Demodulators:
% 0.73/1.09 1 (wt=5) [] add(additive_identity,A) = A.
% 0.73/1.09 2 (wt=5) [] add(A,additive_identity) = A.
% 0.73/1.09 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.73/1.09 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.73/1.09 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.73/1.09 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.73/1.09 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.73/1.09 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.73/1.09 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.73/1.09 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.73/1.09 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.73/1.09 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.73/1.09 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.73/1.09 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.73/1.09 end_of_list.
% 0.73/1.09
% 0.73/1.09 Passive:
% 0.73/1.09 end_of_list.
% 0.73/1.09
% 0.73/1.09 UNIT CONFLICT from 53 and 16 at 0.00 seconds.
% 0.73/1.09
% 0.73/1.09 ---------------- PROOF ----------------
% 0.73/1.09 % SZS output start Refutation
% See solution above
% 0.73/1.09 ------------ end of proof -------------
% 0.73/1.09
% 0.73/1.09
% 0.73/1.09 ------------- memory usage ------------
% 0.73/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.73/1.09 type (bytes each) gets frees in use avail bytes
% 0.73/1.09 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.73/1.09 term ( 16) 4973 4200 773 17 15.2 K
% 0.73/1.09 gen_ptr ( 8) 3865 836 3029 6 23.7 K
% 0.73/1.09 context ( 808) 3468 3466 2 5 5.5 K
% 0.73/1.09 trail ( 12) 132 132 0 4 0.0 K
% 0.73/1.09 bt_node ( 68) 1378 1373 5 1 0.4 K
% 0.73/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.09 ac_match_free_vars_pos (4020)
% 0.73/1.09 0 0 0 0 0.0 K
% 0.73/1.09 discrim ( 12) 818 7 811 0 9.5 K
% 0.73/1.09 flat ( 40) 5303 5303 0 31 1.2 K
% 0.73/1.09 discrim_pos ( 12) 275 275 0 1 0.0 K
% 0.73/1.09 fpa_head ( 12) 499 0 499 0 5.8 K
% 0.73/1.09 fpa_tree ( 28) 112 112 0 7 0.2 K
% 0.73/1.09 fpa_pos ( 36) 98 98 0 1 0.0 K
% 0.73/1.09 literal ( 12) 239 186 53 1 0.6 K
% 0.73/1.09 clause ( 24) 239 186 53 1 1.3 K
% 0.73/1.09 list ( 12) 104 48 56 3 0.7 K
% 0.73/1.09 list_pos ( 20) 219 21 198 0 3.9 K
% 0.73/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.09
% 0.73/1.09 -------------- statistics -------------
% 0.73/1.09 Clauses input 16
% 0.73/1.09 Usable input 0
% 0.73/1.09 Sos input 16
% 0.73/1.09 Demodulators input 0
% 0.73/1.09 Passive input 0
% 0.73/1.09
% 0.73/1.09 Processed BS (before search) 17
% 0.73/1.09 Forward subsumed BS 1
% 0.73/1.09 Kept BS 16
% 0.73/1.09 New demodulators BS 14
% 0.73/1.09 Back demodulated BS 0
% 0.73/1.09
% 0.73/1.09 Clauses or pairs given 295
% 0.73/1.09 Clauses generated 156
% 0.73/1.09 Forward subsumed 119
% 0.73/1.09 Deleted by weight 0
% 0.73/1.09 Deleted by variable count 0
% 0.73/1.09 Kept 37
% 0.73/1.09 New demodulators 31
% 0.73/1.09 Back demodulated 1
% 0.73/1.09 Ordered paramod prunes 0
% 0.73/1.09 Basic paramod prunes 258
% 0.73/1.09 Prime paramod prunes 18
% 0.73/1.09 Semantic prunes 0
% 0.73/1.09
% 0.73/1.09 Rewrite attmepts 1349
% 0.73/1.09 Rewrites 248
% 0.73/1.09
% 0.73/1.09 FPA overloads 0
% 0.73/1.09 FPA underloads 0
% 0.73/1.09
% 0.73/1.09 Usable size 0
% 0.73/1.09 Sos size 51
% 0.73/1.09 Demodulators size 44
% 0.73/1.09 Passive size 0
% 0.73/1.09 Disabled size 1
% 0.73/1.09
% 0.73/1.09 Proofs found 1
% 0.73/1.09
% 0.73/1.09 ----------- times (seconds) ----------- Mon May 30 09:08:12 2022
% 0.73/1.09
% 0.73/1.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.73/1.09 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.73/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.09 input time 0.00
% 0.73/1.09 paramodulation time 0.00
% 0.73/1.09 demodulation time 0.00
% 0.73/1.09 orient time 0.00
% 0.73/1.09 weigh time 0.00
% 0.73/1.09 forward subsume time 0.00
% 0.73/1.09 back demod find time 0.00
% 0.73/1.09 conflict time 0.00
% 0.73/1.09 LRPO time 0.00
% 0.73/1.09 store clause time 0.00
% 0.73/1.09 disable clause time 0.00
% 0.73/1.09 prime paramod time 0.00
% 0.73/1.09 semantics time 0.00
% 0.73/1.09
% 0.73/1.09 EQP interrupted
%------------------------------------------------------------------------------