TSTP Solution File: BOO010-4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : BOO010-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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 : 300s
% DateTime : Wed Jul 27 12:47:33 EDT 2022
% Result : Unsatisfiable 1.86s 2.07s
% Output : Refutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 2 RR)
% Number of literals : 22 ( 21 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 35 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
add(a,multiply(a,b)) != a,
file('BOO010-4.p',unknown),
[] ).
cnf(3,axiom,
add(A,B) = add(B,A),
file('BOO010-4.p',unknown),
[] ).
cnf(4,axiom,
multiply(A,B) = multiply(B,A),
file('BOO010-4.p',unknown),
[] ).
cnf(5,axiom,
add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)),
file('BOO010-4.p',unknown),
[] ).
cnf(6,plain,
multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[5])]),
[iquote('copy,5,flip.1')] ).
cnf(9,axiom,
multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)),
file('BOO010-4.p',unknown),
[] ).
cnf(11,axiom,
add(A,additive_identity) = A,
file('BOO010-4.p',unknown),
[] ).
cnf(13,axiom,
multiply(A,multiplicative_identity) = A,
file('BOO010-4.p',unknown),
[] ).
cnf(14,axiom,
add(A,inverse(A)) = multiplicative_identity,
file('BOO010-4.p',unknown),
[] ).
cnf(17,axiom,
multiply(A,inverse(A)) = additive_identity,
file('BOO010-4.p',unknown),
[] ).
cnf(18,plain,
add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[6]),9]),
[iquote('back_demod,6,demod,9')] ).
cnf(20,plain,
add(inverse(A),A) = multiplicative_identity,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[3,14])]),
[iquote('para_into,3.1.1,14.1.1,flip.1')] ).
cnf(23,plain,
add(additive_identity,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[3,11])]),
[iquote('para_into,3.1.1,10.1.1,flip.1')] ).
cnf(32,plain,
add(multiply(A,additive_identity),multiply(A,B)) = multiply(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[9,23])]),
[iquote('para_into,8.1.1.2,22.1.1,flip.1')] ).
cnf(34,plain,
add(multiply(A,inverse(B)),multiply(A,B)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[9,20]),13])]),
[iquote('para_into,8.1.1.2,20.1.1,demod,13,flip.1')] ).
cnf(53,plain,
add(multiply(A,A),multiply(A,B)) = add(A,multiply(additive_identity,B)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[18,11]),11]),
[iquote('para_into,18.1.1.1.1,10.1.1,demod,11')] ).
cnf(84,plain,
multiply(A,A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[34,17]),23]),
[iquote('para_into,34.1.1.1,16.1.1,demod,23')] ).
cnf(98,plain,
add(A,multiply(A,B)) = add(A,multiply(additive_identity,B)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[53]),84]),
[iquote('back_demod,53,demod,84')] ).
cnf(109,plain,
multiply(A,additive_identity) = additive_identity,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[32,17]),11,17]),
[iquote('para_into,32.1.1.2,16.1.1,demod,11,17')] ).
cnf(112,plain,
multiply(additive_identity,A) = additive_identity,
inference(para_into,[status(thm),theory(equality)],[109,4]),
[iquote('para_into,109.1.1,4.1.1')] ).
cnf(113,plain,
add(A,multiply(A,B)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[98]),112,11]),
[iquote('back_demod,98,demod,112,11')] ).
cnf(115,plain,
$false,
inference(binary,[status(thm)],[113,1]),
[iquote('binary,113.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO010-4 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 02:55:33 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.86/2.07 ----- Otter 3.3f, August 2004 -----
% 1.86/2.07 The process was started by sandbox on n023.cluster.edu,
% 1.86/2.07 Wed Jul 27 02:55:33 2022
% 1.86/2.07 The command was "./otter". The process ID is 11341.
% 1.86/2.07
% 1.86/2.07 set(prolog_style_variables).
% 1.86/2.07 set(auto).
% 1.86/2.07 dependent: set(auto1).
% 1.86/2.07 dependent: set(process_input).
% 1.86/2.07 dependent: clear(print_kept).
% 1.86/2.07 dependent: clear(print_new_demod).
% 1.86/2.07 dependent: clear(print_back_demod).
% 1.86/2.07 dependent: clear(print_back_sub).
% 1.86/2.07 dependent: set(control_memory).
% 1.86/2.07 dependent: assign(max_mem, 12000).
% 1.86/2.07 dependent: assign(pick_given_ratio, 4).
% 1.86/2.07 dependent: assign(stats_level, 1).
% 1.86/2.07 dependent: assign(max_seconds, 10800).
% 1.86/2.07 clear(print_given).
% 1.86/2.07
% 1.86/2.07 list(usable).
% 1.86/2.07 0 [] A=A.
% 1.86/2.07 0 [] add(X,Y)=add(Y,X).
% 1.86/2.07 0 [] multiply(X,Y)=multiply(Y,X).
% 1.86/2.07 0 [] add(X,multiply(Y,Z))=multiply(add(X,Y),add(X,Z)).
% 1.86/2.07 0 [] multiply(X,add(Y,Z))=add(multiply(X,Y),multiply(X,Z)).
% 1.86/2.07 0 [] add(X,additive_identity)=X.
% 1.86/2.07 0 [] multiply(X,multiplicative_identity)=X.
% 1.86/2.07 0 [] add(X,inverse(X))=multiplicative_identity.
% 1.86/2.07 0 [] multiply(X,inverse(X))=additive_identity.
% 1.86/2.07 0 [] add(a,multiply(a,b))!=a.
% 1.86/2.07 end_of_list.
% 1.86/2.07
% 1.86/2.07 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.86/2.07
% 1.86/2.07 All clauses are units, and equality is present; the
% 1.86/2.07 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.86/2.07
% 1.86/2.07 dependent: set(knuth_bendix).
% 1.86/2.07 dependent: set(anl_eq).
% 1.86/2.07 dependent: set(para_from).
% 1.86/2.07 dependent: set(para_into).
% 1.86/2.07 dependent: clear(para_from_right).
% 1.86/2.07 dependent: clear(para_into_right).
% 1.86/2.07 dependent: set(para_from_vars).
% 1.86/2.07 dependent: set(eq_units_both_ways).
% 1.86/2.07 dependent: set(dynamic_demod_all).
% 1.86/2.07 dependent: set(dynamic_demod).
% 1.86/2.07 dependent: set(order_eq).
% 1.86/2.07 dependent: set(back_demod).
% 1.86/2.07 dependent: set(lrpo).
% 1.86/2.07
% 1.86/2.07 ------------> process usable:
% 1.86/2.07 ** KEPT (pick-wt=7): 1 [] add(a,multiply(a,b))!=a.
% 1.86/2.07
% 1.86/2.07 ------------> process sos:
% 1.86/2.07 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.86/2.07 ** KEPT (pick-wt=7): 3 [] add(A,B)=add(B,A).
% 1.86/2.07 ** KEPT (pick-wt=7): 4 [] multiply(A,B)=multiply(B,A).
% 1.86/2.07 ** KEPT (pick-wt=13): 6 [copy,5,flip.1] multiply(add(A,B),add(A,C))=add(A,multiply(B,C)).
% 1.86/2.07 ---> New Demodulator: 7 [new_demod,6] multiply(add(A,B),add(A,C))=add(A,multiply(B,C)).
% 1.86/2.07 ** KEPT (pick-wt=13): 8 [] multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 1.86/2.07 ---> New Demodulator: 9 [new_demod,8] multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 1.86/2.07 ** KEPT (pick-wt=5): 10 [] add(A,additive_identity)=A.
% 1.86/2.07 ---> New Demodulator: 11 [new_demod,10] add(A,additive_identity)=A.
% 1.86/2.07 ** KEPT (pick-wt=5): 12 [] multiply(A,multiplicative_identity)=A.
% 1.86/2.07 ---> New Demodulator: 13 [new_demod,12] multiply(A,multiplicative_identity)=A.
% 1.86/2.07 ** KEPT (pick-wt=6): 14 [] add(A,inverse(A))=multiplicative_identity.
% 1.86/2.07 ---> New Demodulator: 15 [new_demod,14] add(A,inverse(A))=multiplicative_identity.
% 1.86/2.07 ** KEPT (pick-wt=6): 16 [] multiply(A,inverse(A))=additive_identity.
% 1.86/2.07 ---> New Demodulator: 17 [new_demod,16] multiply(A,inverse(A))=additive_identity.
% 1.86/2.07 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.86/2.07 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] add(A,B)=add(B,A).
% 1.86/2.07 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] multiply(A,B)=multiply(B,A).
% 1.86/2.07 >>>> Starting back demodulation with 7.
% 1.86/2.07 >>>> Starting back demodulation with 9.
% 1.86/2.07 >> back demodulating 6 with 9.
% 1.86/2.07 >>>> Starting back demodulation with 11.
% 1.86/2.07 >>>> Starting back demodulation with 13.
% 1.86/2.07 >>>> Starting back demodulation with 15.
% 1.86/2.07 >>>> Starting back demodulation with 17.
% 1.86/2.07 >>>> Starting back demodulation with 19.
% 1.86/2.07
% 1.86/2.07 ======= end of input processing =======
% 1.86/2.07
% 1.86/2.07 =========== start of search ===========
% 1.86/2.07
% 1.86/2.07 -------- PROOF --------
% 1.86/2.07
% 1.86/2.07 ----> UNIT CONFLICT at 0.00 sec ----> 115 [binary,113.1,1.1] $F.
% 1.86/2.07
% 1.86/2.07 Length of proof is 12. Level of proof is 5.
% 1.86/2.07
% 1.86/2.07 ---------------- PROOF ----------------
% 1.86/2.07 % SZS status Unsatisfiable
% 1.86/2.07 % SZS output start Refutation
% See solution above
% 1.86/2.07 ------------ end of proof -------------
% 1.86/2.07
% 1.86/2.07
% 1.86/2.07 Search stopped by max_proofs option.
% 1.86/2.07
% 1.86/2.07
% 1.86/2.07 Search stopped by max_proofs option.
% 1.86/2.07
% 1.86/2.07 ============ end of search ============
% 1.86/2.07
% 1.86/2.07 -------------- statistics -------------
% 1.86/2.07 clauses given 22
% 1.86/2.07 clauses generated 160
% 1.86/2.07 clauses kept 65
% 1.86/2.07 clauses forward subsumed 129
% 1.86/2.07 clauses back subsumed 0
% 1.86/2.07 Kbytes malloced 1953
% 1.86/2.07
% 1.86/2.07 ----------- times (seconds) -----------
% 1.86/2.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.86/2.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.86/2.07 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.86/2.07
% 1.86/2.07 That finishes the proof of the theorem.
% 1.86/2.07
% 1.86/2.07 Process 11341 finished Wed Jul 27 02:55:35 2022
% 1.86/2.07 Otter interrupted
% 1.86/2.07 PROOF FOUND
%------------------------------------------------------------------------------