TSTP Solution File: BOO010-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO010-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:05 EDT 2022
% Result : Unsatisfiable 0.72s 1.09s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 2 RR)
% Number of literals : 17 ( 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 : 29 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO010-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO010-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('BOO010-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(7,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO010-4.p',unknown),
[] ).
cnf(8,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO010-4.p',unknown),
[] ).
cnf(10,plain,
~ equal(add(a,multiply(a,b)),a),
file('BOO010-4.p',unknown),
[] ).
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(18,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(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]),18,8,18]),1]),
[iquote('para(8,5),demod([18,8,18]),flip(1)')] ).
cnf(57,plain,
equal(add(A,multiply(A,B)),multiply(add(multiplicative_identity,B),A)),
inference(para,[status(thm),theory(equality)],[7,13]),
[iquote('para(7,13)')] ).
cnf(58,plain,
equal(multiply(add(multiplicative_identity,A),B),add(B,multiply(B,A))),
inference(flip,[status(thm),theory(equality)],[57]),
[iquote('flip(57)')] ).
cnf(67,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(73,plain,
equal(add(multiplicative_identity,A),multiplicative_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[67,1]),1]),
[iquote('para(67,1),flip(1)')] ).
cnf(74,plain,
equal(add(A,multiply(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[58]),73,18]),1]),
[iquote('back_demod(58),demod([73,18]),flip(1)')] ).
cnf(75,plain,
$false,
inference(conflict,[status(thm)],[74,10]),
[iquote('conflict(74,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : BOO010-4 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 2 00:20:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.72/1.09 ----- EQP 0.9e, May 2009 -----
% 0.72/1.09 The job began on n020.cluster.edu, Thu Jun 2 00:20:39 2022
% 0.72/1.09 The command was "./eqp09e".
% 0.72/1.09
% 0.72/1.09 set(prolog_style_variables).
% 0.72/1.09 set(lrpo).
% 0.72/1.09 set(basic_paramod).
% 0.72/1.09 set(functional_subsume).
% 0.72/1.09 set(ordered_paramod).
% 0.72/1.09 set(prime_paramod).
% 0.72/1.09 set(para_pairs).
% 0.72/1.09 assign(pick_given_ratio,4).
% 0.72/1.09 clear(print_kept).
% 0.72/1.09 clear(print_new_demod).
% 0.72/1.09 clear(print_back_demod).
% 0.72/1.09 clear(print_given).
% 0.72/1.09 assign(max_mem,64000).
% 0.72/1.09 end_of_commands.
% 0.72/1.09
% 0.72/1.09 Usable:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Sos:
% 0.72/1.09 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.72/1.09 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.72/1.09 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.72/1.09 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.09 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.72/1.09 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.72/1.09 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.72/1.09 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.72/1.09 0 (wt=-1) [] -(add(a,multiply(a,b)) = a).
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Demodulators:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Passive:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Starting to process input.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.72/1.09 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.72/1.09
% 0.72/1.09 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.72/1.09 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.72/1.09
% 0.72/1.09 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.72/1.09 3 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.09 4 is a new demodulator.
% 0.72/1.09 -> 4 back demodulating 3.
% 0.72/1.09
% 0.72/1.09 ** 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.72/1.09 5 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 6 (wt=5) [] add(A,additive_identity) = A.
% 0.72/1.09 6 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.72/1.09 7 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.72/1.09 8 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.72/1.09 9 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 10 (wt=7) [] -(add(a,multiply(a,b)) = a).
% 0.72/1.09 ---------------- PROOF FOUND ----------------
% 0.72/1.09 % SZS status Unsatisfiable
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 After processing input:
% 0.72/1.09
% 0.72/1.09 Usable:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Sos:
% 0.72/1.09 6 (wt=5) [] add(A,additive_identity) = A.
% 0.72/1.09 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.72/1.09 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.72/1.09 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.72/1.09 1 (wt=7) [] add(A,B) = add(B,A).
% 0.72/1.09 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.72/1.09 10 (wt=7) [] -(add(a,multiply(a,b)) = a).
% 0.72/1.09 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.09 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.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Demodulators:
% 0.72/1.09 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.72/1.09 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.72/1.09 6 (wt=5) [] add(A,additive_identity) = A.
% 0.72/1.09 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.72/1.09 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.72/1.09 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Passive:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 UNIT CONFLICT from 74 and 10 at 0.00 seconds.
% 0.72/1.09
% 0.72/1.09 ---------------- PROOF ----------------
% 0.72/1.09 % SZS output start Refutation
% See solution above
% 0.72/1.09 ------------ end of proof -------------
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 ------------- memory usage ------------
% 0.72/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.09 type (bytes each) gets frees in use avail bytes
% 0.72/1.09 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.72/1.09 term ( 16) 3474 2449 1025 19 20.1 K
% 0.72/1.09 gen_ptr ( 8) 4068 517 3551 16 27.9 K
% 0.72/1.09 context ( 808) 2712 2710 2 3 3.9 K
% 0.72/1.09 trail ( 12) 223 223 0 4 0.0 K
% 0.72/1.09 bt_node ( 68) 996 993 3 8 0.7 K
% 0.72/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.09 ac_match_free_vars_pos (4020)
% 0.72/1.09 0 0 0 0 0.0 K
% 0.72/1.09 discrim ( 12) 867 47 820 8 9.7 K
% 0.72/1.09 flat ( 40) 4786 4786 0 29 1.1 K
% 0.72/1.09 discrim_pos ( 12) 106 106 0 1 0.0 K
% 0.72/1.09 fpa_head ( 12) 431 0 431 0 5.1 K
% 0.72/1.09 fpa_tree ( 28) 103 103 0 9 0.2 K
% 0.72/1.09 fpa_pos ( 36) 114 114 0 1 0.0 K
% 0.72/1.09 literal ( 12) 247 173 74 1 0.9 K
% 0.72/1.09 clause ( 24) 247 173 74 1 1.8 K
% 0.72/1.09 list ( 12) 99 42 57 3 0.7 K
% 0.72/1.09 list_pos ( 20) 283 37 246 3 4.9 K
% 0.72/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.09
% 0.72/1.09 -------------- statistics -------------
% 0.72/1.09 Clauses input 9
% 0.72/1.09 Usable input 0
% 0.72/1.09 Sos input 9
% 0.72/1.09 Demodulators input 0
% 0.72/1.09 Passive input 0
% 0.72/1.09
% 0.72/1.09 Processed BS (before search) 12
% 0.72/1.09 Forward subsumed BS 2
% 0.72/1.09 Kept BS 10
% 0.72/1.09 New demodulators BS 7
% 0.72/1.09 Back demodulated BS 1
% 0.72/1.09
% 0.72/1.09 Clauses or pairs given 267
% 0.72/1.09 Clauses generated 140
% 0.72/1.09 Forward subsumed 76
% 0.72/1.09 Deleted by weight 0
% 0.72/1.09 Deleted by variable count 0
% 0.72/1.09 Kept 64
% 0.72/1.09 New demodulators 33
% 0.72/1.09 Back demodulated 5
% 0.72/1.09 Ordered paramod prunes 0
% 0.72/1.09 Basic paramod prunes 419
% 0.72/1.09 Prime paramod prunes 8
% 0.72/1.09 Semantic prunes 0
% 0.72/1.09
% 0.72/1.09 Rewrite attmepts 1091
% 0.72/1.09 Rewrites 76
% 0.72/1.09
% 0.72/1.09 FPA overloads 0
% 0.72/1.09 FPA underloads 0
% 0.72/1.09
% 0.72/1.09 Usable size 0
% 0.72/1.09 Sos size 67
% 0.72/1.09 Demodulators size 37
% 0.72/1.09 Passive size 0
% 0.72/1.09 Disabled size 6
% 0.72/1.09
% 0.72/1.09 Proofs found 1
% 0.72/1.09
% 0.72/1.09 ----------- times (seconds) ----------- Thu Jun 2 00:20:39 2022
% 0.72/1.09
% 0.72/1.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.09 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.72/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.09 input time 0.00
% 0.72/1.09 paramodulation time 0.00
% 0.72/1.09 demodulation time 0.00
% 0.72/1.09 orient time 0.00
% 0.72/1.09 weigh time 0.00
% 0.72/1.09 forward subsume time 0.00
% 0.72/1.09 back demod find time 0.00
% 0.72/1.09 conflict time 0.00
% 0.72/1.09 LRPO time 0.00
% 0.72/1.09 store clause time 0.00
% 0.72/1.09 disable clause time 0.00
% 0.72/1.09 prime paramod time 0.00
% 0.72/1.09 semantics time 0.00
% 0.72/1.09
% 0.72/1.09 EQP interrupted
%------------------------------------------------------------------------------