TSTP Solution File: BOO013-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO013-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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:06 EDT 2022
% Result : Unsatisfiable 0.78s 1.15s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 9 RR)
% Number of literals : 16 ( 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO013-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO013-2.p',unknown),
[] ).
cnf(5,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('BOO013-2.p',unknown),
[] ).
cnf(16,plain,
equal(multiply(multiplicative_identity,A),A),
file('BOO013-2.p',unknown),
[] ).
cnf(18,plain,
equal(add(additive_identity,A),A),
file('BOO013-2.p',unknown),
[] ).
cnf(19,plain,
equal(add(a,b),multiplicative_identity),
file('BOO013-2.p',unknown),
[] ).
cnf(20,plain,
equal(add(a,c),multiplicative_identity),
file('BOO013-2.p',unknown),
[] ).
cnf(21,plain,
equal(multiply(a,b),additive_identity),
file('BOO013-2.p',unknown),
[] ).
cnf(22,plain,
equal(multiply(a,c),additive_identity),
file('BOO013-2.p',unknown),
[] ).
cnf(23,plain,
~ equal(c,b),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(94,plain,
equal(add(multiply(a,A),multiply(b,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,5]),16]),1]),
[iquote('para(19,5),demod([16]),flip(1)')] ).
cnf(96,plain,
equal(add(multiply(a,A),multiply(c,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,5]),16]),1]),
[iquote('para(20,5),demod([16]),flip(1)')] ).
cnf(134,plain,
equal(multiply(b,c),c),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,94]),18]),
[iquote('para(22,94),demod([18])')] ).
cnf(137,plain,
equal(multiply(c,b),c),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[134,2]),1]),
[iquote('para(134,2),flip(1)')] ).
cnf(171,plain,
equal(c,b),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,96]),137,18]),
[iquote('para(21,96),demod([137,18])')] ).
cnf(172,plain,
$false,
inference(conflict,[status(thm)],[171,23]),
[iquote('conflict(171,23)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : BOO013-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 1 15:12:07 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.78/1.15 ----- EQP 0.9e, May 2009 -----
% 0.78/1.15 The job began on n022.cluster.edu, Wed Jun 1 15:12:08 2022
% 0.78/1.15 The command was "./eqp09e".
% 0.78/1.15
% 0.78/1.15 set(prolog_style_variables).
% 0.78/1.15 set(lrpo).
% 0.78/1.15 set(basic_paramod).
% 0.78/1.15 set(functional_subsume).
% 0.78/1.15 set(ordered_paramod).
% 0.78/1.15 set(prime_paramod).
% 0.78/1.15 set(para_pairs).
% 0.78/1.15 assign(pick_given_ratio,4).
% 0.78/1.15 clear(print_kept).
% 0.78/1.15 clear(print_new_demod).
% 0.78/1.15 clear(print_back_demod).
% 0.78/1.15 clear(print_given).
% 0.78/1.15 assign(max_mem,64000).
% 0.78/1.15 end_of_commands.
% 0.78/1.15
% 0.78/1.15 Usable:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Sos:
% 0.78/1.15 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.78/1.15 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.78/1.15 0 (wt=-1) [] add(multiply(A,B),C) = multiply(add(A,C),add(B,C)).
% 0.78/1.15 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.78/1.15 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.78/1.15 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.78/1.15 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.78/1.15 0 (wt=-1) [] add(inverse(A),A) = multiplicative_identity.
% 0.78/1.15 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.78/1.15 0 (wt=-1) [] multiply(inverse(A),A) = additive_identity.
% 0.78/1.15 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.78/1.15 0 (wt=-1) [] multiply(multiplicative_identity,A) = A.
% 0.78/1.15 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.78/1.15 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.78/1.15 0 (wt=-1) [] add(a,b) = multiplicative_identity.
% 0.78/1.15 0 (wt=-1) [] add(a,c) = multiplicative_identity.
% 0.78/1.15 0 (wt=-1) [] multiply(a,b) = additive_identity.
% 0.78/1.15 0 (wt=-1) [] multiply(a,c) = additive_identity.
% 0.78/1.15 0 (wt=-1) [] -(b = c).
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Demodulators:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Passive:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Starting to process input.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.78/1.15 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.78/1.15
% 0.78/1.15 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.78/1.15 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.78/1.15
% 0.78/1.15 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(multiply(A,C),B).
% 0.78/1.15 3 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 4 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.78/1.15 4 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.78/1.15 5 is a new demodulator.
% 0.78/1.15 -> 5 back demodulating 4.
% 0.78/1.15
% 0.78/1.15 ** 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.78/1.15 6 is a new demodulator.
% 0.78/1.15 -> 5 back demodulating 3.
% 0.78/1.15
% 0.78/1.15 ** 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.78/1.15 7 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.78/1.15 8 is a new demodulator.
% 0.78/1.15 -> 8 back demodulating 7.
% 0.78/1.15
% 0.78/1.15 ** 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.78/1.15 9 is a new demodulator.
% 0.78/1.15 -> 8 back demodulating 6.
% 0.78/1.15
% 0.78/1.15 ** 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.78/1.15 10 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.78/1.15 11 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.78/1.15 12 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.78/1.15 13 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.78/1.15 14 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.78/1.15 15 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.78/1.15 16 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 17 (wt=5) [] add(A,additive_identity) = A.
% 0.78/1.15 17 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 18 (wt=5) [] add(additive_identity,A) = A.
% 0.78/1.15 18 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 19 (wt=5) [] add(a,b) = multiplicative_identity.
% 0.78/1.15 19 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 20 (wt=5) [] add(a,c) = multiplicative_identity.
% 0.78/1.15 20 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 21 (wt=5) [] multiply(a,b) = additive_identity.
% 0.78/1.15 21 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 22 (wt=5) [] multiply(a,c) = additive_identity.
% 0.78/1.15 22 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 23 (wt=3) [flip(1)] -(c = b).
% 0.78/1.15 ---------------- PROOF FOUND ----------------
% 0.78/1.15 % SZS status Unsatisfiable
% 0.78/1.15
% 0.78/1.15
% 0.78/1.15 After processing input:
% 0.78/1.15
% 0.78/1.15 Usable:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Sos:
% 0.78/1.15 23 (wt=3) [flip(1)] -(c = b).
% 0.78/1.15 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.78/1.15 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.78/1.15 17 (wt=5) [] add(A,additive_identity) = A.
% 0.78/1.15 18 (wt=5) [] add(additive_identity,A) = A.
% 0.78/1.15 19 (wt=5) [] add(a,b) = multiplicative_identity.
% 0.78/1.15 20 (wt=5) [] add(a,c) = multiplicative_identity.
% 0.78/1.15 21 (wt=5) [] multiply(a,b) = additive_identity.
% 0.78/1.15 22 (wt=5) [] multiply(a,c) = additive_identity.
% 0.78/1.15 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.78/1.15 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.78/1.15 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.78/1.15 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.78/1.15 1 (wt=7) [] add(A,B) = add(B,A).
% 0.78/1.15 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.78/1.15 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.78/1.15 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.78/1.15 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.78/1.15 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.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Demodulators:
% 0.78/1.15 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.78/1.15 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.78/1.15 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.78/1.15 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.78/1.15 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.78/1.15 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.78/1.15 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.78/1.15 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.78/1.15 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.78/1.15 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.78/1.15 17 (wt=5) [] add(A,additive_identity) = A.
% 0.78/1.15 18 (wt=5) [] add(additive_identity,A) = A.
% 0.78/1.15 19 (wt=5) [] add(a,b) = multiplicative_identity.
% 0.78/1.15 20 (wt=5) [] add(a,c) = multiplicative_identity.
% 0.78/1.15 21 (wt=5) [] multiply(a,b) = additive_identity.
% 0.78/1.15 22 (wt=5) [] multiply(a,c) = additive_identity.
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Passive:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 UNIT CONFLICT from 171 and 23 at 0.01 seconds.
% 0.78/1.15
% 0.78/1.15 ---------------- PROOF ----------------
% 0.78/1.15 % SZS output start Refutation
% See solution above
% 0.78/1.15 ------------ end of proof -------------
% 0.78/1.15
% 0.78/1.15
% 0.78/1.15 ------------- memory usage ------------
% 0.78/1.15 Memory dynamically allocated (tp_alloc): 488.
% 0.78/1.15 type (bytes each) gets frees in use avail bytes
% 0.78/1.15 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.78/1.15 term ( 16) 10320 7025 3295 53 64.7 K
% 0.78/1.15 gen_ptr ( 8) 14104 1382 12722 15 99.5 K
% 0.78/1.15 context ( 808) 9032 9030 2 3 3.9 K
% 0.78/1.15 trail ( 12) 660 660 0 4 0.0 K
% 0.78/1.15 bt_node ( 68) 3233 3230 3 12 1.0 K
% 0.78/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.78/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.78/1.15 ac_match_free_vars_pos (4020)
% 0.78/1.15 0 0 0 0 0.0 K
% 0.78/1.15 discrim ( 12) 2647 158 2489 0 29.2 K
% 0.78/1.15 flat ( 40) 19363 19363 0 47 1.8 K
% 0.78/1.15 discrim_pos ( 12) 465 465 0 1 0.0 K
% 0.78/1.15 fpa_head ( 12) 626 0 626 0 7.3 K
% 0.78/1.15 fpa_tree ( 28) 480 480 0 17 0.5 K
% 0.78/1.15 fpa_pos ( 36) 274 274 0 1 0.0 K
% 0.78/1.15 literal ( 12) 626 455 171 1 2.0 K
% 0.78/1.15 clause ( 24) 626 455 171 1 4.0 K
% 0.78/1.15 list ( 12) 162 106 56 4 0.7 K
% 0.78/1.15 list_pos ( 20) 658 77 581 0 11.3 K
% 0.78/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.78/1.15
% 0.78/1.15 -------------- statistics -------------
% 0.78/1.15 Clauses input 19
% 0.78/1.15 Usable input 0
% 0.78/1.15 Sos input 19
% 0.78/1.15 Demodulators input 0
% 0.78/1.15 Passive input 0
% 0.78/1.15
% 0.78/1.15 Processed BS (before search) 25
% 0.78/1.15 Forward subsumed BS 2
% 0.78/1.15 Kept BS 23
% 0.78/1.15 New demodulators BS 20
% 0.78/1.15 Back demodulated BS 4
% 0.78/1.15
% 0.78/1.15 Clauses or pairs given 656
% 0.78/1.15 Clauses generated 334
% 0.78/1.15 Forward subsumed 186
% 0.78/1.15 Deleted by weight 0
% 0.78/1.15 Deleted by variable count 0
% 0.78/1.15 Kept 148
% 0.78/1.15 New demodulators 83
% 0.78/1.15 Back demodulated 8
% 0.78/1.15 Ordered paramod prunes 0
% 0.78/1.15 Basic paramod prunes 825
% 0.78/1.15 Prime paramod prunes 7
% 0.78/1.15 Semantic prunes 0
% 0.78/1.15
% 0.78/1.15 Rewrite attmepts 3930
% 0.78/1.15 Rewrites 383
% 0.78/1.15
% 0.78/1.15 FPA overloads 0
% 0.78/1.15 FPA underloads 0
% 0.78/1.15
% 0.78/1.15 Usable size 0
% 0.78/1.15 Sos size 158
% 0.78/1.15 Demodulators size 95
% 0.78/1.15 Passive size 0
% 0.78/1.15 Disabled size 12
% 0.78/1.15
% 0.78/1.15 Proofs found 1
% 0.78/1.15
% 0.78/1.15 ----------- times (seconds) ----------- Wed Jun 1 15:12:08 2022
% 0.78/1.15
% 0.78/1.15 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.78/1.15 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.78/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.78/1.15 input time 0.00
% 0.78/1.15 paramodulation time 0.00
% 0.78/1.15 demodulation time 0.00
% 0.78/1.15 orient time 0.00
% 0.78/1.15 weigh time 0.00
% 0.78/1.15 forward subsume time 0.00
% 0.78/1.15 back demod find time 0.00
% 0.78/1.15 conflict time 0.00
% 0.78/1.15 LRPO time 0.00
% 0.78/1.15 store clause time 0.00
% 0.78/1.15 disable clause time 0.00
% 0.78/1.15 prime paramod time 0.00
% 0.78/1.15 semantics time 0.00
% 0.78/1.15
% 0.78/1.15 EQP interrupted
%------------------------------------------------------------------------------