TSTP Solution File: BOO009-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO009-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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.45s 1.11s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 2 RR)
% Number of literals : 21 ( 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO009-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO009-4.p',unknown),
[] ).
cnf(3,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(4,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('BOO009-4.p',unknown),
[] ).
cnf(5,plain,
equal(add(multiply(add(A,B),A),multiply(add(A,B),C)),add(A,multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),4]),
[iquote('back_demod(3),demod([4])')] ).
cnf(6,plain,
equal(add(A,additive_identity),A),
file('BOO009-4.p',unknown),
[] ).
cnf(7,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO009-4.p',unknown),
[] ).
cnf(8,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO009-4.p',unknown),
[] ).
cnf(10,plain,
~ equal(add(multiply(a,a),multiply(a,b)),a),
inference(demod,[status(thm),theory(equality)],[4]),
[iquote('demod([4])')] ).
cnf(13,plain,
equal(add(multiply(A,B),multiply(A,C)),multiply(add(B,C),A)),
inference(para,[status(thm),theory(equality)],[4,2]),
[iquote('para(4,2)')] ).
cnf(15,plain,
equal(multiply(multiplicative_identity,A),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,2]),1]),
[iquote('para(7,2),flip(1)')] ).
cnf(28,plain,
equal(add(multiply(A,A),multiply(A,B)),add(A,multiply(additive_identity,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,5]),6]),
[iquote('para(6,5),demod([6])')] ).
cnf(29,plain,
equal(add(A,multiply(additive_identity,B)),add(multiply(A,A),multiply(A,B))),
inference(flip,[status(thm),theory(equality)],[28]),
[iquote('flip(28)')] ).
cnf(35,plain,
equal(add(A,multiply(inverse(A),B)),add(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,5]),15,8,15]),1]),
[iquote('para(8,5),demod([15,8,15]),flip(1)')] ).
cnf(59,plain,
equal(add(multiply(A,B),A),multiply(add(B,multiplicative_identity),A)),
inference(para,[status(thm),theory(equality)],[7,13]),
[iquote('para(7,13)')] ).
cnf(60,plain,
equal(multiply(add(A,multiplicative_identity),B),add(multiply(B,A),B)),
inference(flip,[status(thm),theory(equality)],[59]),
[iquote('flip(59)')] ).
cnf(68,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)],[7,35]),8]),1]),
[iquote('para(7,35),demod([8]),flip(1)')] ).
cnf(69,plain,
equal(add(multiply(A,B),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[60]),68,15]),1]),
[iquote('back_demod(60),demod([68,15]),flip(1)')] ).
cnf(76,plain,
equal(multiply(additive_identity,A),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[69,6]),1]),
[iquote('para(69,6),flip(1)')] ).
cnf(77,plain,
equal(add(multiply(A,A),multiply(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[29]),76,6]),1]),
[iquote('back_demod(29),demod([76,6]),flip(1)')] ).
cnf(78,plain,
$false,
inference(conflict,[status(thm)],[77,10]),
[iquote('conflict(77,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : BOO009-4 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n025.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 : Wed Jun 1 23:53:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.11 ----- EQP 0.9e, May 2009 -----
% 0.45/1.11 The job began on n025.cluster.edu, Wed Jun 1 23:53:30 2022
% 0.45/1.11 The command was "./eqp09e".
% 0.45/1.11
% 0.45/1.11 set(prolog_style_variables).
% 0.45/1.11 set(lrpo).
% 0.45/1.11 set(basic_paramod).
% 0.45/1.11 set(functional_subsume).
% 0.45/1.11 set(ordered_paramod).
% 0.45/1.11 set(prime_paramod).
% 0.45/1.11 set(para_pairs).
% 0.45/1.11 assign(pick_given_ratio,4).
% 0.45/1.11 clear(print_kept).
% 0.45/1.11 clear(print_new_demod).
% 0.45/1.11 clear(print_back_demod).
% 0.45/1.11 clear(print_given).
% 0.45/1.11 assign(max_mem,64000).
% 0.45/1.11 end_of_commands.
% 0.45/1.11
% 0.45/1.11 Usable:
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Sos:
% 0.45/1.11 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.45/1.11 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.45/1.11 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.45/1.11 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.45/1.11 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.45/1.11 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.45/1.11 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.45/1.11 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.45/1.11 0 (wt=-1) [] -(multiply(a,add(a,b)) = a).
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Demodulators:
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Passive:
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Starting to process input.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.45/1.11 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.45/1.11
% 0.45/1.11 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.45/1.11 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.45/1.11
% 0.45/1.11 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.45/1.11 3 is a new demodulator.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.45/1.11 4 is a new demodulator.
% 0.45/1.11 -> 4 back demodulating 3.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 0.45/1.11 5 is a new demodulator.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 6 (wt=5) [] add(A,additive_identity) = A.
% 0.45/1.11 6 is a new demodulator.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.45/1.11 7 is a new demodulator.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.45/1.11 8 is a new demodulator.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.45/1.11 9 is a new demodulator.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 10 (wt=9) [demod([4])] -(add(multiply(a,a),multiply(a,b)) = a).
% 0.45/1.11 ---------------- PROOF FOUND ----------------
% 0.45/1.11 % SZS status Unsatisfiable
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 After processing input:
% 0.45/1.11
% 0.45/1.11 Usable:
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Sos:
% 0.45/1.11 6 (wt=5) [] add(A,additive_identity) = A.
% 0.45/1.11 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.45/1.11 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.45/1.11 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.45/1.11 1 (wt=7) [] add(A,B) = add(B,A).
% 0.45/1.11 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.45/1.11 10 (wt=9) [demod([4])] -(add(multiply(a,a),multiply(a,b)) = a).
% 0.45/1.11 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.45/1.11 5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Demodulators:
% 0.45/1.11 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.45/1.11 5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 0.45/1.11 6 (wt=5) [] add(A,additive_identity) = A.
% 0.45/1.11 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.45/1.11 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.45/1.11 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Passive:
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 UNIT CONFLICT from 77 and 10 at 0.00 seconds.
% 0.45/1.11
% 0.45/1.11 ---------------- PROOF ----------------
% 0.45/1.11 % SZS output start Refutation
% See solution above
% 0.45/1.11 ------------ end of proof -------------
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 ------------- memory usage ------------
% 0.45/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.45/1.11 type (bytes each) gets frees in use avail bytes
% 0.45/1.11 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.45/1.11 term ( 16) 3721 2671 1050 19 20.6 K
% 0.45/1.11 gen_ptr ( 8) 4319 693 3626 20 28.5 K
% 0.45/1.11 context ( 808) 2959 2957 2 3 3.9 K
% 0.45/1.11 trail ( 12) 325 325 0 4 0.0 K
% 0.45/1.11 bt_node ( 68) 1094 1091 3 8 0.7 K
% 0.45/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.45/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.45/1.11 ac_match_free_vars_pos (4020)
% 0.45/1.11 0 0 0 0 0.0 K
% 0.45/1.11 discrim ( 12) 880 97 783 53 9.8 K
% 0.45/1.11 flat ( 40) 5034 5034 0 29 1.1 K
% 0.45/1.11 discrim_pos ( 12) 131 131 0 1 0.0 K
% 0.45/1.11 fpa_head ( 12) 443 0 443 0 5.2 K
% 0.45/1.11 fpa_tree ( 28) 142 142 0 13 0.4 K
% 0.45/1.11 fpa_pos ( 36) 119 119 0 1 0.0 K
% 0.45/1.11 literal ( 12) 264 187 77 1 0.9 K
% 0.45/1.11 clause ( 24) 264 187 77 1 1.8 K
% 0.45/1.11 list ( 12) 101 44 57 3 0.7 K
% 0.45/1.11 list_pos ( 20) 309 72 237 19 5.0 K
% 0.45/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.45/1.11
% 0.45/1.11 -------------- statistics -------------
% 0.45/1.11 Clauses input 9
% 0.45/1.11 Usable input 0
% 0.45/1.11 Sos input 9
% 0.45/1.11 Demodulators input 0
% 0.45/1.11 Passive input 0
% 0.45/1.11
% 0.45/1.11 Processed BS (before search) 12
% 0.45/1.11 Forward subsumed BS 2
% 0.45/1.11 Kept BS 10
% 0.45/1.11 New demodulators BS 7
% 0.45/1.11 Back demodulated BS 1
% 0.45/1.11
% 0.45/1.11 Clauses or pairs given 298
% 0.45/1.11 Clauses generated 155
% 0.45/1.11 Forward subsumed 88
% 0.45/1.11 Deleted by weight 0
% 0.45/1.11 Deleted by variable count 0
% 0.45/1.11 Kept 67
% 0.45/1.11 New demodulators 35
% 0.45/1.11 Back demodulated 12
% 0.45/1.11 Ordered paramod prunes 0
% 0.45/1.11 Basic paramod prunes 525
% 0.45/1.11 Prime paramod prunes 10
% 0.45/1.11 Semantic prunes 0
% 0.45/1.11
% 0.45/1.11 Rewrite attmepts 1188
% 0.45/1.11 Rewrites 99
% 0.45/1.11
% 0.45/1.11 FPA overloads 0
% 0.45/1.11 FPA underloads 0
% 0.45/1.11
% 0.45/1.11 Usable size 0
% 0.45/1.11 Sos size 63
% 0.45/1.11 Demodulators size 34
% 0.45/1.11 Passive size 0
% 0.45/1.11 Disabled size 13
% 0.45/1.11
% 0.45/1.11 Proofs found 1
% 0.45/1.11
% 0.45/1.11 ----------- times (seconds) ----------- Wed Jun 1 23:53:30 2022
% 0.45/1.11
% 0.45/1.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.45/1.11 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.45/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.45/1.11 input time 0.00
% 0.45/1.11 paramodulation time 0.00
% 0.45/1.11 demodulation time 0.00
% 0.45/1.11 orient time 0.00
% 0.45/1.11 weigh time 0.00
% 0.45/1.11 forward subsume time 0.00
% 0.45/1.11 back demod find time 0.00
% 0.45/1.11 conflict time 0.00
% 0.45/1.11 LRPO time 0.00
% 0.45/1.11 store clause time 0.00
% 0.45/1.11 disable clause time 0.00
% 0.45/1.11 prime paramod time 0.00
% 0.45/1.11 semantics time 0.00
% 0.45/1.11
% 0.45/1.11 EQP interrupted
%------------------------------------------------------------------------------