TSTP Solution File: BOO005-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO005-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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 : Thu Jul 14 23:37:03 EDT 2022
% Result : Unsatisfiable 0.49s 0.90s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 2 RR)
% Number of literals : 25 ( 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 : 39 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO005-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO005-2.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(add(A,B),add(A,C)),add(A,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('BOO005-2.p',unknown),
[] ).
cnf(6,plain,
equal(add(multiply(A,add(A,B)),multiply(C,add(A,B))),add(A,multiply(C,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),5]),
[iquote('back_demod(4),demod([5])')] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('BOO005-2.p',unknown),
[] ).
cnf(10,plain,
equal(add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))),add(A,multiply(C,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),8,8]),
[iquote('back_demod(6),demod([8,8])')] ).
cnf(11,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO005-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,inverse(A)),additive_identity),
file('BOO005-2.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(inverse(A),A),additive_identity),
file('BOO005-2.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO005-2.p',unknown),
[] ).
cnf(16,plain,
equal(multiply(multiplicative_identity,A),A),
file('BOO005-2.p',unknown),
[] ).
cnf(17,plain,
equal(add(A,additive_identity),A),
file('BOO005-2.p',unknown),
[] ).
cnf(18,plain,
equal(add(additive_identity,A),A),
file('BOO005-2.p',unknown),
[] ).
cnf(19,plain,
~ equal(add(a,multiplicative_identity),multiplicative_identity),
file('BOO005-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(56,plain,
equal(add(multiply(A,B),multiply(A,inverse(B))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,8]),15]),1]),
[iquote('para(11,8),demod([15]),flip(1)')] ).
cnf(66,plain,
equal(add(A,multiply(B,inverse(A))),add(multiply(A,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,10]),17,56]),1]),
[iquote('para(13,10),demod([17,56]),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(127,plain,
equal(add(A,multiply(B,inverse(A))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),113]),
[iquote('back_demod(66),demod([113])')] ).
cnf(158,plain,
equal(add(A,multiplicative_identity),multiplicative_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,127]),11]),1]),
[iquote('para(16,127),demod([11]),flip(1)')] ).
cnf(159,plain,
$false,
inference(conflict,[status(thm)],[158,19]),
[iquote('conflict(158,19)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : BOO005-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.09 % Command : tptp2X_and_run_eqp %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Wed Jun 1 15:54:29 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.49/0.90 ----- EQP 0.9e, May 2009 -----
% 0.49/0.90 The job began on n032.cluster.edu, Wed Jun 1 15:54:30 2022
% 0.49/0.90 The command was "./eqp09e".
% 0.49/0.90
% 0.49/0.90 set(prolog_style_variables).
% 0.49/0.90 set(lrpo).
% 0.49/0.90 set(basic_paramod).
% 0.49/0.90 set(functional_subsume).
% 0.49/0.90 set(ordered_paramod).
% 0.49/0.90 set(prime_paramod).
% 0.49/0.90 set(para_pairs).
% 0.49/0.90 assign(pick_given_ratio,4).
% 0.49/0.90 clear(print_kept).
% 0.49/0.90 clear(print_new_demod).
% 0.49/0.90 clear(print_back_demod).
% 0.49/0.90 clear(print_given).
% 0.49/0.90 assign(max_mem,64000).
% 0.49/0.90 end_of_commands.
% 0.49/0.90
% 0.49/0.90 Usable:
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Sos:
% 0.49/0.90 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.49/0.90 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.49/0.90 0 (wt=-1) [] add(multiply(A,B),C) = multiply(add(A,C),add(B,C)).
% 0.49/0.90 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.49/0.90 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.49/0.90 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.49/0.90 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.49/0.90 0 (wt=-1) [] add(inverse(A),A) = multiplicative_identity.
% 0.49/0.90 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.49/0.90 0 (wt=-1) [] multiply(inverse(A),A) = additive_identity.
% 0.49/0.90 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.49/0.90 0 (wt=-1) [] multiply(multiplicative_identity,A) = A.
% 0.49/0.90 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.49/0.90 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.49/0.90 0 (wt=-1) [] -(add(a,multiplicative_identity) = multiplicative_identity).
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Demodulators:
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Passive:
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Starting to process input.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.49/0.90 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.49/0.90
% 0.49/0.90 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.49/0.90 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.49/0.90
% 0.49/0.90 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(multiply(A,C),B).
% 0.49/0.90 3 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 4 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.49/0.90 4 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.49/0.90 5 is a new demodulator.
% 0.49/0.90 -> 5 back demodulating 4.
% 0.49/0.90
% 0.49/0.90 ** 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.49/0.90 6 is a new demodulator.
% 0.49/0.90 -> 5 back demodulating 3.
% 0.49/0.90
% 0.49/0.90 ** 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.49/0.90 7 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.49/0.90 8 is a new demodulator.
% 0.49/0.90 -> 8 back demodulating 7.
% 0.49/0.90
% 0.49/0.90 ** 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.49/0.90 9 is a new demodulator.
% 0.49/0.90 -> 8 back demodulating 6.
% 0.49/0.90
% 0.49/0.90 ** 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.49/0.90 10 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.49/0.90 11 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.49/0.90 12 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.49/0.90 13 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.49/0.90 14 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.49/0.90 15 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.49/0.90 16 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 17 (wt=5) [] add(A,additive_identity) = A.
% 0.49/0.90 17 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 18 (wt=5) [] add(additive_identity,A) = A.
% 0.49/0.90 18 is a new demodulator.
% 0.49/0.90
% 0.49/0.90 ** KEPT: 19 (wt=5) [] -(add(a,multiplicative_identity) = multiplicative_identity).
% 0.49/0.90 ---------------- PROOF FOUND ----------------
% 0.49/0.90 % SZS status Unsatisfiable
% 0.49/0.90
% 0.49/0.90
% 0.49/0.90 After processing input:
% 0.49/0.90
% 0.49/0.90 Usable:
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Sos:
% 0.49/0.90 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.49/0.90 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.49/0.90 17 (wt=5) [] add(A,additive_identity) = A.
% 0.49/0.90 18 (wt=5) [] add(additive_identity,A) = A.
% 0.49/0.90 19 (wt=5) [] -(add(a,multiplicative_identity) = multiplicative_identity).
% 0.49/0.90 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.49/0.90 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.49/0.90 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.49/0.90 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.49/0.90 1 (wt=7) [] add(A,B) = add(B,A).
% 0.49/0.90 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.49/0.90 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.49/0.90 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.49/0.90 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.49/0.90 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.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Demodulators:
% 0.49/0.90 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.49/0.90 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.49/0.90 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.49/0.90 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.49/0.90 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.49/0.90 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.49/0.90 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.49/0.90 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.49/0.90 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.49/0.90 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.49/0.90 17 (wt=5) [] add(A,additive_identity) = A.
% 0.49/0.90 18 (wt=5) [] add(additive_identity,A) = A.
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 Passive:
% 0.49/0.90 end_of_list.
% 0.49/0.90
% 0.49/0.90 UNIT CONFLICT from 158 and 19 at 0.00 seconds.
% 0.49/0.90
% 0.49/0.90 ---------------- PROOF ----------------
% 0.49/0.90 % SZS output start Refutation
% See solution above
% 0.49/0.90 ------------ end of proof -------------
% 0.49/0.90
% 0.49/0.90
% 0.49/0.90 ------------- memory usage ------------
% 0.49/0.90 Memory dynamically allocated (tp_alloc): 488.
% 0.49/0.90 type (bytes each) gets frees in use avail bytes
% 0.49/0.90 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.49/0.90 term ( 16) 8341 5488 2853 25 55.6 K
% 0.49/0.90 gen_ptr ( 8) 13654 3015 10639 24 83.3 K
% 0.49/0.90 context ( 808) 6259 6257 2 3 3.9 K
% 0.49/0.90 trail ( 12) 1981 1981 0 4 0.0 K
% 0.49/0.90 bt_node ( 68) 1913 1910 3 12 1.0 K
% 0.49/0.90 ac_position (285432) 0 0 0 0 0.0 K
% 0.49/0.90 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.49/0.90 ac_match_free_vars_pos (4020)
% 0.49/0.90 0 0 0 0 0.0 K
% 0.49/0.90 discrim ( 12) 2631 1149 1482 165 19.3 K
% 0.49/0.90 flat ( 40) 13860 13860 0 35 1.4 K
% 0.49/0.90 discrim_pos ( 12) 410 410 0 1 0.0 K
% 0.49/0.90 fpa_head ( 12) 515 0 515 0 6.0 K
% 0.49/0.90 fpa_tree ( 28) 578 578 0 17 0.5 K
% 0.49/0.90 fpa_pos ( 36) 274 274 0 1 0.0 K
% 0.49/0.90 literal ( 12) 534 376 158 1 1.9 K
% 0.49/0.90 clause ( 24) 534 376 158 1 3.7 K
% 0.49/0.90 list ( 12) 175 119 56 4 0.7 K
% 0.49/0.90 list_pos ( 20) 724 303 421 21 8.6 K
% 0.49/0.90 pair_index ( 40) 2 0 2 0 0.1 K
% 0.49/0.90
% 0.49/0.90 -------------- statistics -------------
% 0.49/0.90 Clauses input 15
% 0.49/0.90 Usable input 0
% 0.49/0.90 Sos input 15
% 0.49/0.90 Demodulators input 0
% 0.49/0.90 Passive input 0
% 0.49/0.90
% 0.49/0.90 Processed BS (before search) 21
% 0.49/0.90 Forward subsumed BS 2
% 0.49/0.90 Kept BS 19
% 0.49/0.90 New demodulators BS 16
% 0.49/0.90 Back demodulated BS 4
% 0.49/0.90
% 0.49/0.90 Clauses or pairs given 402
% 0.49/0.90 Clauses generated 297
% 0.49/0.90 Forward subsumed 158
% 0.49/0.90 Deleted by weight 0
% 0.49/0.90 Deleted by variable count 0
% 0.49/0.90 Kept 139
% 0.49/0.90 New demodulators 100
% 0.49/0.90 Back demodulated 56
% 0.49/0.90 Ordered paramod prunes 0
% 0.49/0.90 Basic paramod prunes 436
% 0.49/0.90 Prime paramod prunes 11
% 0.49/0.90 Semantic prunes 0
% 0.49/0.90
% 0.49/0.90 Rewrite attmepts 2984
% 0.49/0.90 Rewrites 358
% 0.49/0.90
% 0.49/0.90 FPA overloads 0
% 0.49/0.90 FPA underloads 0
% 0.49/0.90
% 0.49/0.90 Usable size 0
% 0.49/0.90 Sos size 97
% 0.49/0.90 Demodulators size 70
% 0.49/0.90 Passive size 0
% 0.49/0.90 Disabled size 60
% 0.49/0.90
% 0.49/0.90 Proofs found 1
% 0.49/0.90
% 0.49/0.90 ----------- times (seconds) ----------- Wed Jun 1 15:54:30 2022
% 0.49/0.90
% 0.49/0.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.49/0.90 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.49/0.90 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.49/0.90 input time 0.00
% 0.49/0.90 paramodulation time 0.00
% 0.49/0.90 demodulation time 0.00
% 0.49/0.90 orient time 0.00
% 0.49/0.90 weigh time 0.00
% 0.49/0.90 forward subsume time 0.00
% 0.49/0.90 back demod find time 0.00
% 0.49/0.90 conflict time 0.00
% 0.49/0.90 LRPO time 0.00
% 0.49/0.90 store clause time 0.00
% 0.49/0.90 disable clause time 0.00
% 0.49/0.90 prime paramod time 0.00
% 0.49/0.90 semantics time 0.00
% 0.49/0.90
% 0.49/0.90 EQP interrupted
%------------------------------------------------------------------------------