TSTP Solution File: BOO003-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO003-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n024.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:03 EDT 2022
% Result : Unsatisfiable 0.71s 1.12s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 2 RR)
% Number of literals : 16 ( 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 : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO003-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO003-2.p',unknown),
[] ).
cnf(5,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('BOO003-2.p',unknown),
[] ).
cnf(11,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO003-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,inverse(A)),additive_identity),
file('BOO003-2.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(inverse(A),A),additive_identity),
file('BOO003-2.p',unknown),
[] ).
cnf(16,plain,
equal(multiply(multiplicative_identity,A),A),
file('BOO003-2.p',unknown),
[] ).
cnf(17,plain,
equal(add(A,additive_identity),A),
file('BOO003-2.p',unknown),
[] ).
cnf(18,plain,
equal(add(additive_identity,A),A),
file('BOO003-2.p',unknown),
[] ).
cnf(19,plain,
~ equal(multiply(a,a),a),
file('BOO003-2.p',unknown),
[] ).
cnf(54,plain,
equal(add(multiply(A,B),multiply(inverse(A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,5]),16]),1]),
[iquote('para(11,5),demod([16]),flip(1)')] ).
cnf(94,plain,
equal(multiply(A,inverse(inverse(A))),inverse(inverse(A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,54]),17]),
[iquote('para(13,54),demod([17])')] ).
cnf(97,plain,
equal(multiply(inverse(inverse(A)),A),inverse(inverse(A))),
inference(para,[status(thm),theory(equality)],[2,94]),
[iquote('para(2,94)')] ).
cnf(112,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,54]),97,18]),
[iquote('para(14,54),demod([97,18])')] ).
cnf(113,plain,
equal(multiply(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[97]),112,112]),
[iquote('back_demod(97),demod([112,112])')] ).
cnf(114,plain,
$false,
inference(conflict,[status(thm)],[113,19]),
[iquote('conflict(113,19)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : BOO003-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 1 21:34:36 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.71/1.12 ----- EQP 0.9e, May 2009 -----
% 0.71/1.12 The job began on n024.cluster.edu, Wed Jun 1 21:34:36 2022
% 0.71/1.12 The command was "./eqp09e".
% 0.71/1.12
% 0.71/1.12 set(prolog_style_variables).
% 0.71/1.12 set(lrpo).
% 0.71/1.12 set(basic_paramod).
% 0.71/1.12 set(functional_subsume).
% 0.71/1.12 set(ordered_paramod).
% 0.71/1.12 set(prime_paramod).
% 0.71/1.12 set(para_pairs).
% 0.71/1.12 assign(pick_given_ratio,4).
% 0.71/1.12 clear(print_kept).
% 0.71/1.12 clear(print_new_demod).
% 0.71/1.12 clear(print_back_demod).
% 0.71/1.12 clear(print_given).
% 0.71/1.12 assign(max_mem,64000).
% 0.71/1.12 end_of_commands.
% 0.71/1.12
% 0.71/1.12 Usable:
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Sos:
% 0.71/1.12 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.71/1.12 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.71/1.12 0 (wt=-1) [] add(multiply(A,B),C) = multiply(add(A,C),add(B,C)).
% 0.71/1.12 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.71/1.12 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.71/1.12 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.71/1.12 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.71/1.12 0 (wt=-1) [] add(inverse(A),A) = multiplicative_identity.
% 0.71/1.12 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.71/1.12 0 (wt=-1) [] multiply(inverse(A),A) = additive_identity.
% 0.71/1.12 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.71/1.12 0 (wt=-1) [] multiply(multiplicative_identity,A) = A.
% 0.71/1.12 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.71/1.12 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.71/1.12 0 (wt=-1) [] -(multiply(a,a) = a).
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Demodulators:
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Passive:
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Starting to process input.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.71/1.12 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.71/1.12
% 0.71/1.12 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.71/1.12 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.71/1.12
% 0.71/1.12 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(multiply(A,C),B).
% 0.71/1.12 3 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 4 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.71/1.12 4 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.71/1.12 5 is a new demodulator.
% 0.71/1.12 -> 5 back demodulating 4.
% 0.71/1.12
% 0.71/1.12 ** 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.71/1.12 6 is a new demodulator.
% 0.71/1.12 -> 5 back demodulating 3.
% 0.71/1.12
% 0.71/1.12 ** 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.71/1.12 7 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.71/1.12 8 is a new demodulator.
% 0.71/1.12 -> 8 back demodulating 7.
% 0.71/1.12
% 0.71/1.12 ** 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.71/1.12 9 is a new demodulator.
% 0.71/1.12 -> 8 back demodulating 6.
% 0.71/1.12
% 0.71/1.12 ** 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.71/1.12 10 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.71/1.12 11 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.71/1.12 12 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.71/1.12 13 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.71/1.12 14 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.71/1.12 15 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.71/1.12 16 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 17 (wt=5) [] add(A,additive_identity) = A.
% 0.71/1.12 17 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 18 (wt=5) [] add(additive_identity,A) = A.
% 0.71/1.12 18 is a new demodulator.
% 0.71/1.12
% 0.71/1.12 ** KEPT: 19 (wt=5) [] -(multiply(a,a) = a).
% 0.71/1.12 ---------------- PROOF FOUND ----------------
% 0.71/1.12 % SZS status Unsatisfiable
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 After processing input:
% 0.71/1.12
% 0.71/1.12 Usable:
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Sos:
% 0.71/1.12 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.71/1.12 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.71/1.12 17 (wt=5) [] add(A,additive_identity) = A.
% 0.71/1.12 18 (wt=5) [] add(additive_identity,A) = A.
% 0.71/1.12 19 (wt=5) [] -(multiply(a,a) = a).
% 0.71/1.12 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.71/1.12 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.71/1.12 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.71/1.12 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.71/1.12 1 (wt=7) [] add(A,B) = add(B,A).
% 0.71/1.12 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.71/1.12 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.71/1.12 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.71/1.12 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.71/1.12 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.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Demodulators:
% 0.71/1.12 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.71/1.12 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.71/1.12 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.71/1.12 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.71/1.12 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.71/1.12 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.71/1.12 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.71/1.12 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.71/1.12 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.71/1.12 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.71/1.12 17 (wt=5) [] add(A,additive_identity) = A.
% 0.71/1.12 18 (wt=5) [] add(additive_identity,A) = A.
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 Passive:
% 0.71/1.12 end_of_list.
% 0.71/1.12
% 0.71/1.12 UNIT CONFLICT from 113 and 19 at 0.00 seconds.
% 0.71/1.12
% 0.71/1.12 ---------------- PROOF ----------------
% 0.71/1.12 % SZS output start Refutation
% See solution above
% 0.71/1.12 ------------ end of proof -------------
% 0.71/1.12
% 0.71/1.12
% 0.71/1.12 ------------- memory usage ------------
% 0.71/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.71/1.12 type (bytes each) gets frees in use avail bytes
% 0.71/1.12 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.71/1.12 term ( 16) 6473 4539 1934 19 37.7 K
% 0.71/1.12 gen_ptr ( 8) 8219 1025 7194 15 56.3 K
% 0.71/1.12 context ( 808) 4982 4980 2 3 3.9 K
% 0.71/1.12 trail ( 12) 665 665 0 4 0.0 K
% 0.71/1.12 bt_node ( 68) 1683 1680 3 12 1.0 K
% 0.71/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.12 ac_match_free_vars_pos (4020)
% 0.71/1.12 0 0 0 0 0.0 K
% 0.71/1.12 discrim ( 12) 1796 161 1635 9 19.3 K
% 0.71/1.12 flat ( 40) 9882 9882 0 35 1.4 K
% 0.71/1.12 discrim_pos ( 12) 302 302 0 1 0.0 K
% 0.71/1.12 fpa_head ( 12) 502 0 502 0 5.9 K
% 0.71/1.12 fpa_tree ( 28) 369 369 0 17 0.5 K
% 0.71/1.12 fpa_pos ( 36) 192 192 0 1 0.0 K
% 0.71/1.12 literal ( 12) 378 265 113 1 1.3 K
% 0.71/1.12 clause ( 24) 378 265 113 1 2.7 K
% 0.71/1.12 list ( 12) 138 81 57 3 0.7 K
% 0.71/1.12 list_pos ( 20) 455 68 387 4 7.6 K
% 0.71/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.12
% 0.71/1.12 -------------- statistics -------------
% 0.71/1.12 Clauses input 15
% 0.71/1.12 Usable input 0
% 0.71/1.12 Sos input 15
% 0.71/1.12 Demodulators input 0
% 0.71/1.12 Passive input 0
% 0.71/1.12
% 0.71/1.12 Processed BS (before search) 21
% 0.71/1.12 Forward subsumed BS 2
% 0.71/1.12 Kept BS 19
% 0.71/1.12 New demodulators BS 16
% 0.71/1.12 Back demodulated BS 4
% 0.71/1.12
% 0.71/1.12 Clauses or pairs given 343
% 0.71/1.12 Clauses generated 211
% 0.71/1.12 Forward subsumed 117
% 0.71/1.12 Deleted by weight 0
% 0.71/1.12 Deleted by variable count 0
% 0.71/1.12 Kept 94
% 0.71/1.12 New demodulators 63
% 0.71/1.12 Back demodulated 7
% 0.71/1.12 Ordered paramod prunes 0
% 0.71/1.12 Basic paramod prunes 397
% 0.71/1.12 Prime paramod prunes 11
% 0.71/1.12 Semantic prunes 0
% 0.71/1.12
% 0.71/1.12 Rewrite attmepts 2234
% 0.71/1.12 Rewrites 267
% 0.71/1.12
% 0.71/1.12 FPA overloads 0
% 0.71/1.12 FPA underloads 0
% 0.71/1.12
% 0.71/1.12 Usable size 0
% 0.71/1.12 Sos size 101
% 0.71/1.12 Demodulators size 72
% 0.71/1.12 Passive size 0
% 0.71/1.12 Disabled size 11
% 0.71/1.12
% 0.71/1.12 Proofs found 1
% 0.71/1.12
% 0.71/1.12 ----------- times (seconds) ----------- Wed Jun 1 21:34:36 2022
% 0.71/1.12
% 0.71/1.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.71/1.12 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.71/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.12 input time 0.00
% 0.71/1.12 paramodulation time 0.00
% 0.71/1.12 demodulation time 0.00
% 0.71/1.12 orient time 0.00
% 0.71/1.12 weigh time 0.00
% 0.71/1.12 forward subsume time 0.00
% 0.71/1.12 back demod find time 0.00
% 0.71/1.12 conflict time 0.00
% 0.71/1.12 LRPO time 0.00
% 0.71/1.12 store clause time 0.00
% 0.71/1.12 disable clause time 0.00
% 0.71/1.12 prime paramod time 0.00
% 0.71/1.12 semantics time 0.00
% 0.71/1.12
% 0.71/1.12 EQP interrupted
%------------------------------------------------------------------------------