TSTP Solution File: BOO011-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO011-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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 : Thu Jul 14 23:37:05 EDT 2022
% Result : Unsatisfiable 0.65s 1.06s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 3 RR)
% Number of literals : 5 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(12,plain,
equal(add(inverse(A),A),multiplicative_identity),
file('BOO011-2.p',unknown),
[] ).
cnf(17,plain,
equal(add(A,additive_identity),A),
file('BOO011-2.p',unknown),
[] ).
cnf(19,plain,
~ equal(inverse(additive_identity),multiplicative_identity),
file('BOO011-2.p',unknown),
[] ).
cnf(25,plain,
equal(inverse(additive_identity),multiplicative_identity),
inference(para,[status(thm),theory(equality)],[17,12]),
[iquote('para(17,12)')] ).
cnf(26,plain,
$false,
inference(conflict,[status(thm)],[25,19]),
[iquote('conflict(25,19)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : BOO011-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n021.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 : Wed Jun 1 22:33:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.65/1.06 ----- EQP 0.9e, May 2009 -----
% 0.65/1.06 The job began on n021.cluster.edu, Wed Jun 1 22:33:46 2022
% 0.65/1.06 The command was "./eqp09e".
% 0.65/1.06
% 0.65/1.06 set(prolog_style_variables).
% 0.65/1.06 set(lrpo).
% 0.65/1.06 set(basic_paramod).
% 0.65/1.06 set(functional_subsume).
% 0.65/1.06 set(ordered_paramod).
% 0.65/1.06 set(prime_paramod).
% 0.65/1.06 set(para_pairs).
% 0.65/1.06 assign(pick_given_ratio,4).
% 0.65/1.06 clear(print_kept).
% 0.65/1.06 clear(print_new_demod).
% 0.65/1.06 clear(print_back_demod).
% 0.65/1.06 clear(print_given).
% 0.65/1.06 assign(max_mem,64000).
% 0.65/1.06 end_of_commands.
% 0.65/1.06
% 0.65/1.06 Usable:
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Sos:
% 0.65/1.06 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.65/1.06 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.65/1.06 0 (wt=-1) [] add(multiply(A,B),C) = multiply(add(A,C),add(B,C)).
% 0.65/1.06 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.65/1.06 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.65/1.06 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.65/1.06 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.65/1.06 0 (wt=-1) [] add(inverse(A),A) = multiplicative_identity.
% 0.65/1.06 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.65/1.06 0 (wt=-1) [] multiply(inverse(A),A) = additive_identity.
% 0.65/1.06 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.65/1.06 0 (wt=-1) [] multiply(multiplicative_identity,A) = A.
% 0.65/1.06 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.65/1.06 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.65/1.06 0 (wt=-1) [] -(inverse(additive_identity) = multiplicative_identity).
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Demodulators:
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Passive:
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Starting to process input.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.65/1.06 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.65/1.06
% 0.65/1.06 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.65/1.06 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.65/1.06
% 0.65/1.06 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(multiply(A,C),B).
% 0.65/1.06 3 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 4 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.65/1.06 4 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.65/1.06 5 is a new demodulator.
% 0.65/1.06 -> 5 back demodulating 4.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 6 (wt=17) [back_demod(4),demod([5])] add(multiply(A,add(A,B)),multiply(C,add(A,B))) = add(A,multiply(C,B)).
% 0.65/1.06 6 is a new demodulator.
% 0.65/1.06 -> 5 back demodulating 3.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 7 (wt=17) [back_demod(3),demod([5])] add(multiply(A,add(B,C)),multiply(C,add(B,C))) = add(multiply(A,B),C).
% 0.65/1.06 7 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.65/1.06 8 is a new demodulator.
% 0.65/1.06 -> 8 back demodulating 7.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 9 (wt=21) [back_demod(7),demod([8,8])] add(add(multiply(A,B),multiply(A,C)),add(multiply(C,B),multiply(C,C))) = add(multiply(A,B),C).
% 0.65/1.06 9 is a new demodulator.
% 0.65/1.06 -> 8 back demodulating 6.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 10 (wt=21) [back_demod(6),demod([8,8])] add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))) = add(A,multiply(C,B)).
% 0.65/1.06 10 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.65/1.06 11 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.65/1.06 12 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.65/1.06 13 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.65/1.06 14 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.65/1.06 15 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.65/1.06 16 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 17 (wt=5) [] add(A,additive_identity) = A.
% 0.65/1.06 17 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 18 (wt=5) [] add(additive_identity,A) = A.
% 0.65/1.06 18 is a new demodulator.
% 0.65/1.06
% 0.65/1.06 ** KEPT: 19 (wt=4) [] -(inverse(additive_identity) = multiplicative_identity).
% 0.65/1.06 ---------------- PROOF FOUND ----------------
% 0.65/1.06 % SZS status Unsatisfiable
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 After processing input:
% 0.65/1.06
% 0.65/1.06 Usable:
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Sos:
% 0.65/1.06 19 (wt=4) [] -(inverse(additive_identity) = multiplicative_identity).
% 0.65/1.06 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.65/1.06 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.65/1.06 17 (wt=5) [] add(A,additive_identity) = A.
% 0.65/1.06 18 (wt=5) [] add(additive_identity,A) = A.
% 0.65/1.06 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.65/1.06 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.65/1.06 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.65/1.06 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.65/1.06 1 (wt=7) [] add(A,B) = add(B,A).
% 0.65/1.06 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.65/1.06 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.65/1.06 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.65/1.06 9 (wt=21) [back_demod(7),demod([8,8])] add(add(multiply(A,B),multiply(A,C)),add(multiply(C,B),multiply(C,C))) = add(multiply(A,B),C).
% 0.65/1.06 10 (wt=21) [back_demod(6),demod([8,8])] add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))) = add(A,multiply(C,B)).
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Demodulators:
% 0.65/1.06 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.65/1.06 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.65/1.06 9 (wt=21) [back_demod(7),demod([8,8])] add(add(multiply(A,B),multiply(A,C)),add(multiply(C,B),multiply(C,C))) = add(multiply(A,B),C).
% 0.65/1.06 10 (wt=21) [back_demod(6),demod([8,8])] add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))) = add(A,multiply(C,B)).
% 0.65/1.06 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.65/1.06 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.65/1.06 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.65/1.06 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.65/1.06 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.65/1.06 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.65/1.06 17 (wt=5) [] add(A,additive_identity) = A.
% 0.65/1.06 18 (wt=5) [] add(additive_identity,A) = A.
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 Passive:
% 0.65/1.06 end_of_list.
% 0.65/1.06
% 0.65/1.06 UNIT CONFLICT from 25 and 19 at 0.00 seconds.
% 0.65/1.06
% 0.65/1.06 ---------------- PROOF ----------------
% 0.65/1.06 % SZS output start Refutation
% See solution above
% 0.65/1.06 ------------ end of proof -------------
% 0.65/1.06
% 0.65/1.06
% 0.65/1.06 ------------- memory usage ------------
% 0.65/1.06 Memory dynamically allocated (tp_alloc): 488.
% 0.65/1.06 type (bytes each) gets frees in use avail bytes
% 0.65/1.06 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.65/1.06 term ( 16) 1539 1245 294 31 6.2 K
% 0.65/1.06 gen_ptr ( 8) 1215 286 929 4 7.3 K
% 0.65/1.06 context ( 808) 609 607 2 2 3.2 K
% 0.65/1.06 trail ( 12) 56 56 0 3 0.0 K
% 0.65/1.06 bt_node ( 68) 158 155 3 2 0.3 K
% 0.65/1.06 ac_position (285432) 0 0 0 0 0.0 K
% 0.65/1.06 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.65/1.06 ac_match_free_vars_pos (4020)
% 0.65/1.06 0 0 0 0 0.0 K
% 0.65/1.06 discrim ( 12) 287 64 223 0 2.6 K
% 0.65/1.06 flat ( 40) 970 970 0 31 1.2 K
% 0.65/1.06 discrim_pos ( 12) 26 26 0 1 0.0 K
% 0.65/1.06 fpa_head ( 12) 142 0 142 0 1.7 K
% 0.65/1.06 fpa_tree ( 28) 40 40 0 7 0.2 K
% 0.65/1.06 fpa_pos ( 36) 42 42 0 1 0.0 K
% 0.65/1.06 literal ( 12) 76 51 25 1 0.3 K
% 0.65/1.06 clause ( 24) 76 51 25 1 0.6 K
% 0.65/1.06 list ( 12) 76 20 56 4 0.7 K
% 0.65/1.06 list_pos ( 20) 112 35 77 0 1.5 K
% 0.65/1.06 pair_index ( 40) 2 0 2 0 0.1 K
% 0.65/1.06
% 0.65/1.06 -------------- statistics -------------
% 0.65/1.06 Clauses input 15
% 0.65/1.06 Usable input 0
% 0.65/1.06 Sos input 15
% 0.65/1.06 Demodulators input 0
% 0.65/1.06 Passive input 0
% 0.65/1.06
% 0.65/1.06 Processed BS (before search) 21
% 0.65/1.06 Forward subsumed BS 2
% 0.65/1.06 Kept BS 19
% 0.65/1.06 New demodulators BS 16
% 0.65/1.06 Back demodulated BS 4
% 0.65/1.06
% 0.65/1.06 Clauses or pairs given 48
% 0.65/1.06 Clauses generated 24
% 0.65/1.06 Forward subsumed 18
% 0.65/1.06 Deleted by weight 0
% 0.65/1.06 Deleted by variable count 0
% 0.65/1.06 Kept 6
% 0.65/1.06 New demodulators 1
% 0.65/1.06 Back demodulated 0
% 0.65/1.06 Ordered paramod prunes 0
% 0.65/1.06 Basic paramod prunes 20
% 0.65/1.06 Prime paramod prunes 1
% 0.65/1.06 Semantic prunes 0
% 0.65/1.06
% 0.65/1.06 Rewrite attmepts 268
% 0.65/1.06 Rewrites 18
% 0.65/1.06
% 0.65/1.06 FPA overloads 0
% 0.65/1.06 FPA underloads 0
% 0.65/1.06
% 0.65/1.06 Usable size 0
% 0.65/1.06 Sos size 20
% 0.65/1.06 Demodulators size 13
% 0.65/1.06 Passive size 0
% 0.65/1.06 Disabled size 4
% 0.65/1.06
% 0.65/1.06 Proofs found 1
% 0.65/1.06
% 0.65/1.06 ----------- times (seconds) ----------- Wed Jun 1 22:33:46 2022
% 0.65/1.06
% 0.65/1.06 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.65/1.06 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.65/1.06 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.65/1.06 input time 0.00
% 0.65/1.06 paramodulation time 0.00
% 0.65/1.06 demodulation time 0.00
% 0.65/1.06 orient time 0.00
% 0.65/1.06 weigh time 0.00
% 0.65/1.06 forward subsume time 0.00
% 0.65/1.06 back demod find time 0.00
% 0.65/1.06 conflict time 0.00
% 0.65/1.06 LRPO time 0.00
% 0.65/1.06 store clause time 0.00
% 0.65/1.06 disable clause time 0.00
% 0.65/1.06 prime paramod time 0.00
% 0.65/1.06 semantics time 0.00
% 0.65/1.06
% 0.65/1.06 EQP interrupted
%------------------------------------------------------------------------------