%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO006-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n020.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:04 EDT 2022
% Result : Unsatisfiable 0.45s 1.12s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 2 RR)
% Number of literals : 19 ( 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 : 31 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO006-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO006-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('BOO006-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('BOO006-4.p',unknown),
[] ).
cnf(7,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO006-4.p',unknown),
[] ).
cnf(8,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO006-4.p',unknown),
[] ).
cnf(10,plain,
~ equal(multiply(a,additive_identity),additive_identity),
file('BOO006-4.p',unknown),
[] ).
cnf(12,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(21,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(34,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]),21,8,21]),1]),
[iquote('para(8,5),demod([21,8,21]),flip(1)')] ).
cnf(57,plain,
equal(add(multiply(A,B),A),multiply(add(B,multiplicative_identity),A)),
inference(para,[status(thm),theory(equality)],[7,12]),
[iquote('para(7,12)')] ).
cnf(58,plain,
equal(multiply(add(A,multiplicative_identity),B),add(multiply(B,A),B)),
inference(flip,[status(thm),theory(equality)],[57]),
[iquote('flip(57)')] ).
cnf(70,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,34]),8]),1]),
[iquote('para(7,34),demod([8]),flip(1)')] ).
cnf(71,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)],[58]),70,21]),1]),
[iquote('back_demod(58),demod([70,21]),flip(1)')] ).
cnf(77,plain,
equal(multiply(additive_identity,A),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[71,6]),1]),
[iquote('para(71,6),flip(1)')] ).
cnf(88,plain,
equal(multiply(A,additive_identity),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[77,2]),1]),
[iquote('para(77,2),flip(1)')] ).
cnf(89,plain,
$false,
inference(conflict,[status(thm)],[88,10]),
[iquote('conflict(88,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO006-4 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n020.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 18:59:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.12 ----- EQP 0.9e, May 2009 -----
% 0.45/1.12 The job began on n020.cluster.edu, Wed Jun 1 18:59:09 2022
% 0.45/1.12 The command was "./eqp09e".
% 0.45/1.12
% 0.45/1.12 set(prolog_style_variables).
% 0.45/1.12 set(lrpo).
% 0.45/1.12 set(basic_paramod).
% 0.45/1.12 set(functional_subsume).
% 0.45/1.12 set(ordered_paramod).
% 0.45/1.12 set(prime_paramod).
% 0.45/1.12 set(para_pairs).
% 0.45/1.12 assign(pick_given_ratio,4).
% 0.45/1.12 clear(print_kept).
% 0.45/1.12 clear(print_new_demod).
% 0.45/1.12 clear(print_back_demod).
% 0.45/1.12 clear(print_given).
% 0.45/1.12 assign(max_mem,64000).
% 0.45/1.12 end_of_commands.
% 0.45/1.12
% 0.45/1.12 Usable:
% 0.45/1.12 end_of_list.
% 0.45/1.12
% 0.45/1.12 Sos:
% 0.45/1.12 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.45/1.12 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.45/1.12 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.45/1.12 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.45/1.12 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.45/1.12 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.45/1.12 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.45/1.12 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.45/1.12 0 (wt=-1) [] -(multiply(a,additive_identity) = additive_identity).
% 0.45/1.12 end_of_list.
% 0.45/1.12
% 0.45/1.12 Demodulators:
% 0.45/1.12 end_of_list.
% 0.45/1.12
% 0.45/1.12 Passive:
% 0.45/1.12 end_of_list.
% 0.45/1.12
% 0.45/1.12 Starting to process input.
% 0.45/1.12
% 0.45/1.12 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.45/1.12 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.45/1.12
% 0.45/1.12 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.45/1.12 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.45/1.12
% 0.45/1.12 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.45/1.12 3 is a new demodulator.
% 0.45/1.12
% 0.45/1.12 ** KEPT: 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.45/1.12 4 is a new demodulator.
% 0.45/1.12 -> 4 back demodulating 3.
% 0.45/1.12
% 0.45/1.12 ** 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.12 5 is a new demodulator.
% 0.45/1.12
% 0.45/1.12 ** KEPT: 6 (wt=5) [] add(A,additive_identity) = A.
% 0.45/1.12 6 is a new demodulator.
% 0.45/1.12
% 0.45/1.12 ** KEPT: 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.45/1.12 7 is a new demodulator.
% 0.45/1.12
% 0.45/1.12 ** KEPT: 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.45/1.12 8 is a new demodulator.
% 0.45/1.12
% 0.45/1.12 ** KEPT: 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.45/1.12 9 is a new demodulator.
% 0.45/1.12
% 0.45/1.12 ** KEPT: 10 (wt=5) [] -(multiply(a,additive_identity) = additive_identity).
% 0.45/1.12 ---------------- PROOF FOUND ----------------
% 0.45/1.12 % SZS status Unsatisfiable
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 After processing input:
% 0.45/1.12
% 0.45/1.12 Usable:
% 0.45/1.12 end_of_list.
% 0.45/1.12
% 0.45/1.12 Sos:
% 0.45/1.12 6 (wt=5) [] add(A,additive_identity) = A.
% 0.45/1.12 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.45/1.12 10 (wt=5) [] -(multiply(a,additive_identity) = additive_identity).
% 0.45/1.12 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.45/1.12 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.45/1.12 1 (wt=7) [] add(A,B) = add(B,A).
% 0.45/1.12 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.45/1.12 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.45/1.12 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.12 end_of_list.
% 0.45/1.12
% 0.45/1.12 Demodulators:
% 0.45/1.12 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.45/1.12 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.12 6 (wt=5) [] add(A,additive_identity) = A.
% 0.45/1.12 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.45/1.12 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.45/1.12 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.45/1.12 end_of_list.
% 0.45/1.12
% 0.45/1.12 Passive:
% 0.45/1.12 end_of_list.
% 0.45/1.12
% 0.45/1.12 UNIT CONFLICT from 88 and 10 at 0.01 seconds.
% 0.45/1.12
% 0.45/1.12 ---------------- PROOF ----------------
% 0.45/1.12 % SZS output start Refutation
% See solution above
% 0.45/1.12 ------------ end of proof -------------
% 0.45/1.12
% 0.45/1.12
% 0.45/1.12 ------------- memory usage ------------
% 0.45/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.45/1.12 type (bytes each) gets frees in use avail bytes
% 0.45/1.12 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.45/1.12 term ( 16) 4284 3015 1269 19 24.8 K
% 0.45/1.12 gen_ptr ( 8) 5277 832 4445 18 34.9 K
% 0.45/1.12 context ( 808) 3247 3245 2 3 3.9 K
% 0.45/1.12 trail ( 12) 707 707 0 4 0.0 K
% 0.45/1.12 bt_node ( 68) 1121 1118 3 8 0.7 K
% 0.45/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.45/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.45/1.12 ac_match_free_vars_pos (4020)
% 0.45/1.12 0 0 0 0 0.0 K
% 0.45/1.12 discrim ( 12) 1041 136 905 0 10.6 K
% 0.45/1.12 flat ( 40) 6377 6377 0 33 1.3 K
% 0.45/1.12 discrim_pos ( 12) 150 150 0 1 0.0 K
% 0.45/1.12 fpa_head ( 12) 418 0 418 0 4.9 K
% 0.45/1.12 fpa_tree ( 28) 117 117 0 7 0.2 K
% 0.45/1.12 fpa_pos ( 36) 137 137 0 1 0.0 K
% 0.45/1.12 literal ( 12) 314 226 88 1 1.0 K
% 0.45/1.12 clause ( 24) 314 226 88 1 2.1 K
% 0.45/1.12 list ( 12) 108 52 56 4 0.7 K
% 0.45/1.12 list_pos ( 20) 357 90 267 0 5.2 K
% 0.45/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.45/1.12
% 0.45/1.12 -------------- statistics -------------
% 0.45/1.12 Clauses input 9
% 0.45/1.12 Usable input 0
% 0.45/1.12 Sos input 9
% 0.45/1.12 Demodulators input 0
% 0.45/1.12 Passive input 0
% 0.45/1.12
% 0.45/1.12 Processed BS (before search) 12
% 0.45/1.12 Forward subsumed BS 2
% 0.45/1.12 Kept BS 10
% 0.45/1.12 New demodulators BS 7
% 0.45/1.12 Back demodulated BS 1
% 0.45/1.12
% 0.45/1.12 Clauses or pairs given 331
% 0.45/1.12 Clauses generated 182
% 0.45/1.12 Forward subsumed 104
% 0.45/1.12 Deleted by weight 0
% 0.45/1.12 Deleted by variable count 0
% 0.45/1.12 Kept 78
% 0.45/1.12 New demodulators 42
% 0.45/1.12 Back demodulated 16
% 0.45/1.12 Ordered paramod prunes 0
% 0.45/1.12 Basic paramod prunes 540
% 0.45/1.12 Prime paramod prunes 14
% 0.45/1.12 Semantic prunes 0
% 0.45/1.12
% 0.45/1.12 Rewrite attmepts 1402
% 0.45/1.12 Rewrites 109
% 0.45/1.12
% 0.45/1.12 FPA overloads 0
% 0.45/1.12 FPA underloads 0
% 0.45/1.12
% 0.45/1.12 Usable size 0
% 0.45/1.12 Sos size 70
% 0.45/1.12 Demodulators size 40
% 0.45/1.12 Passive size 0
% 0.45/1.12 Disabled size 17
% 0.45/1.12
% 0.45/1.12 Proofs found 1
% 0.45/1.12
% 0.45/1.12 ----------- times (seconds) ----------- Wed Jun 1 18:59:09 2022
% 0.45/1.12
% 0.45/1.12 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.45/1.12 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.45/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.45/1.12 input time 0.00
% 0.45/1.12 paramodulation time 0.00
% 0.45/1.12 demodulation time 0.00
% 0.45/1.12 orient time 0.00
% 0.45/1.12 weigh time 0.00
% 0.45/1.12 forward subsume time 0.00
% 0.45/1.12 back demod find time 0.00
% 0.45/1.12 conflict time 0.00
% 0.45/1.12 LRPO time 0.00
% 0.45/1.12 store clause time 0.00
% 0.45/1.12 disable clause time 0.00
% 0.45/1.12 prime paramod time 0.00
% 0.45/1.12 semantics time 0.00
% 0.45/1.12
% 0.45/1.12 EQP interrupted
%------------------------------------------------------------------------------