TSTP Solution File: KLE074+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE074+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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 13:00:40 EDT 2022
% Result : Theorem 1.78s 1.99s
% Output : Refutation 1.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 4 RR)
% Number of literals : 9 ( 8 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
domain(multiplication(multiplication(dollar_c3,dollar_c2),domain(dollar_c1))) != domain(multiplication(dollar_c3,domain(multiplication(dollar_c2,domain(dollar_c1))))),
file('KLE074+1.p',unknown),
[] ).
cnf(4,plain,
domain(multiplication(dollar_c3,domain(multiplication(dollar_c2,domain(dollar_c1))))) != domain(multiplication(multiplication(dollar_c3,dollar_c2),domain(dollar_c1))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[3])]),
[iquote('copy,3,flip.1')] ).
cnf(14,axiom,
multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
file('KLE074+1.p',unknown),
[] ).
cnf(16,plain,
multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[14])]),
[iquote('copy,14,flip.1')] ).
cnf(31,axiom,
domain(multiplication(A,B)) = domain(multiplication(A,domain(B))),
file('KLE074+1.p',unknown),
[] ).
cnf(33,plain,
domain(multiplication(A,domain(B))) = domain(multiplication(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[31])]),
[iquote('copy,31,flip.1')] ).
cnf(40,plain,
domain(multiplication(dollar_c3,multiplication(dollar_c2,domain(dollar_c1)))) != domain(multiplication(dollar_c3,multiplication(dollar_c2,dollar_c1))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[4]),33,33,16])]),
[iquote('back_demod,4,demod,33,33,16,flip.1')] ).
cnf(121,plain,
domain(multiplication(A,multiplication(B,domain(C)))) = domain(multiplication(A,multiplication(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[33,33]),33])]),
[iquote('para_into,32.1.1.1.2,32.1.1,demod,33,flip.1')] ).
cnf(123,plain,
$false,
inference(binary,[status(thm)],[121,40]),
[iquote('binary,121.1,40.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE074+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n012.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 06:27:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.78/1.99 ----- Otter 3.3f, August 2004 -----
% 1.78/1.99 The process was started by sandbox on n012.cluster.edu,
% 1.78/1.99 Wed Jul 27 06:27:20 2022
% 1.78/1.99 The command was "./otter". The process ID is 12510.
% 1.78/1.99
% 1.78/1.99 set(prolog_style_variables).
% 1.78/1.99 set(auto).
% 1.78/1.99 dependent: set(auto1).
% 1.78/1.99 dependent: set(process_input).
% 1.78/1.99 dependent: clear(print_kept).
% 1.78/1.99 dependent: clear(print_new_demod).
% 1.78/1.99 dependent: clear(print_back_demod).
% 1.78/1.99 dependent: clear(print_back_sub).
% 1.78/1.99 dependent: set(control_memory).
% 1.78/1.99 dependent: assign(max_mem, 12000).
% 1.78/1.99 dependent: assign(pick_given_ratio, 4).
% 1.78/1.99 dependent: assign(stats_level, 1).
% 1.78/1.99 dependent: assign(max_seconds, 10800).
% 1.78/1.99 clear(print_given).
% 1.78/1.99
% 1.78/1.99 formula_list(usable).
% 1.78/1.99 all A (A=A).
% 1.78/1.99 all A B (addition(A,B)=addition(B,A)).
% 1.78/1.99 all C B A (addition(A,addition(B,C))=addition(addition(A,B),C)).
% 1.78/1.99 all A (addition(A,zero)=A).
% 1.78/1.99 all A (addition(A,A)=A).
% 1.78/1.99 all A B C (multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C)).
% 1.78/1.99 all A (multiplication(A,one)=A).
% 1.78/1.99 all A (multiplication(one,A)=A).
% 1.78/1.99 all A B C (multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C))).
% 1.78/1.99 all A B C (multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C))).
% 1.78/1.99 all A (multiplication(A,zero)=zero).
% 1.78/1.99 all A (multiplication(zero,A)=zero).
% 1.78/1.99 all A B (le_q(A,B)<->addition(A,B)=B).
% 1.78/1.99 all X0 (addition(X0,multiplication(domain(X0),X0))=multiplication(domain(X0),X0)).
% 1.78/1.99 all X0 X1 (domain(multiplication(X0,X1))=domain(multiplication(X0,domain(X1)))).
% 1.78/1.99 all X0 (addition(domain(X0),one)=one).
% 1.78/1.99 domain(zero)=zero.
% 1.78/1.99 all X0 X1 (domain(addition(X0,X1))=addition(domain(X0),domain(X1))).
% 1.78/1.99 -(all X0 X1 X2 (domain(multiplication(multiplication(X0,X1),domain(X2)))=domain(multiplication(X0,domain(multiplication(X1,domain(X2))))))).
% 1.78/1.99 end_of_list.
% 1.78/1.99
% 1.78/1.99 -------> usable clausifies to:
% 1.78/1.99
% 1.78/1.99 list(usable).
% 1.78/1.99 0 [] A=A.
% 1.78/1.99 0 [] addition(A,B)=addition(B,A).
% 1.78/1.99 0 [] addition(A,addition(B,C))=addition(addition(A,B),C).
% 1.78/1.99 0 [] addition(A,zero)=A.
% 1.78/1.99 0 [] addition(A,A)=A.
% 1.78/1.99 0 [] multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C).
% 1.78/1.99 0 [] multiplication(A,one)=A.
% 1.78/1.99 0 [] multiplication(one,A)=A.
% 1.78/1.99 0 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.78/1.99 0 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.78/1.99 0 [] multiplication(A,zero)=zero.
% 1.78/1.99 0 [] multiplication(zero,A)=zero.
% 1.78/1.99 0 [] -le_q(A,B)|addition(A,B)=B.
% 1.78/1.99 0 [] le_q(A,B)|addition(A,B)!=B.
% 1.78/1.99 0 [] addition(X0,multiplication(domain(X0),X0))=multiplication(domain(X0),X0).
% 1.78/1.99 0 [] domain(multiplication(X0,X1))=domain(multiplication(X0,domain(X1))).
% 1.78/1.99 0 [] addition(domain(X0),one)=one.
% 1.78/1.99 0 [] domain(zero)=zero.
% 1.78/1.99 0 [] domain(addition(X0,X1))=addition(domain(X0),domain(X1)).
% 1.78/1.99 0 [] domain(multiplication(multiplication($c3,$c2),domain($c1)))!=domain(multiplication($c3,domain(multiplication($c2,domain($c1))))).
% 1.78/1.99 end_of_list.
% 1.78/1.99
% 1.78/1.99 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.78/1.99
% 1.78/1.99 This is a Horn set with equality. The strategy will be
% 1.78/1.99 Knuth-Bendix and hyper_res, with positive clauses in
% 1.78/1.99 sos and nonpositive clauses in usable.
% 1.78/1.99
% 1.78/1.99 dependent: set(knuth_bendix).
% 1.78/1.99 dependent: set(anl_eq).
% 1.78/1.99 dependent: set(para_from).
% 1.78/1.99 dependent: set(para_into).
% 1.78/1.99 dependent: clear(para_from_right).
% 1.78/1.99 dependent: clear(para_into_right).
% 1.78/1.99 dependent: set(para_from_vars).
% 1.78/1.99 dependent: set(eq_units_both_ways).
% 1.78/1.99 dependent: set(dynamic_demod_all).
% 1.78/1.99 dependent: set(dynamic_demod).
% 1.78/1.99 dependent: set(order_eq).
% 1.78/1.99 dependent: set(back_demod).
% 1.78/1.99 dependent: set(lrpo).
% 1.78/1.99 dependent: set(hyper_res).
% 1.78/1.99 dependent: clear(order_hyper).
% 1.78/1.99
% 1.78/1.99 ------------> process usable:
% 1.78/1.99 ** KEPT (pick-wt=8): 1 [] -le_q(A,B)|addition(A,B)=B.
% 1.78/1.99 ** KEPT (pick-wt=8): 2 [] le_q(A,B)|addition(A,B)!=B.
% 1.78/1.99 ** KEPT (pick-wt=16): 4 [copy,3,flip.1] domain(multiplication($c3,domain(multiplication($c2,domain($c1)))))!=domain(multiplication(multiplication($c3,$c2),domain($c1))).
% 1.78/1.99
% 1.78/1.99 ------------> process sos:
% 1.78/1.99 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.78/1.99 ** KEPT (pick-wt=7): 6 [] addition(A,B)=addition(B,A).
% 1.78/1.99 ** KEPT (pick-wt=11): 8 [copy,7,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.78/1.99 ---> New Demodulator: 9 [new_demod,8] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 1.78/1.99 ** KEPT (pick-wt=5): 10 [] addition(A,zero)=A.
% 1.78/1.99 ---> New Demodulator: 11 [new_demod,10] addition(A,zero)=A.
% 1.78/1.99 ** KEPT (pick-wt=5): 12 [] addition(A,A)=A.
% 1.78/1.99 ---> New Demodulator: 13 [new_demod,12] addition(A,A)=A.
% 1.78/1.99 ** KEPT (pick-wt=11): 15 [copy,14,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 1.78/1.99 ---> New Demodulator: 16 [new_demod,15] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 1.78/1.99 ** KEPT (pick-wt=5): 17 [] multiplication(A,one)=A.
% 1.78/1.99 ---> New Demodulator: 18 [new_demod,17] multiplication(A,one)=A.
% 1.78/1.99 ** KEPT (pick-wt=5): 19 [] multiplication(one,A)=A.
% 1.78/1.99 ---> New Demodulator: 20 [new_demod,19] multiplication(one,A)=A.
% 1.78/1.99 ** KEPT (pick-wt=13): 21 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.78/1.99 ---> New Demodulator: 22 [new_demod,21] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.78/1.99 ** KEPT (pick-wt=13): 23 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.78/1.99 ---> New Demodulator: 24 [new_demod,23] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.78/1.99 ** KEPT (pick-wt=5): 25 [] multiplication(A,zero)=zero.
% 1.78/1.99 ---> New Demodulator: 26 [new_demod,25] multiplication(A,zero)=zero.
% 1.78/1.99 ** KEPT (pick-wt=5): 27 [] multiplication(zero,A)=zero.
% 1.78/1.99 ---> New Demodulator: 28 [new_demod,27] multiplication(zero,A)=zero.
% 1.78/1.99 ** KEPT (pick-wt=11): 29 [] addition(A,multiplication(domain(A),A))=multiplication(domain(A),A).
% 1.78/1.99 ---> New Demodulator: 30 [new_demod,29] addition(A,multiplication(domain(A),A))=multiplication(domain(A),A).
% 1.78/1.99 ** KEPT (pick-wt=10): 32 [copy,31,flip.1] domain(multiplication(A,domain(B)))=domain(multiplication(A,B)).
% 1.78/1.99 ---> New Demodulator: 33 [new_demod,32] domain(multiplication(A,domain(B)))=domain(multiplication(A,B)).
% 1.78/1.99 ** KEPT (pick-wt=6): 34 [] addition(domain(A),one)=one.
% 1.78/1.99 ---> New Demodulator: 35 [new_demod,34] addition(domain(A),one)=one.
% 1.78/1.99 ** KEPT (pick-wt=4): 36 [] domain(zero)=zero.
% 1.78/1.99 ---> New Demodulator: 37 [new_demod,36] domain(zero)=zero.
% 1.78/1.99 ** KEPT (pick-wt=10): 38 [] domain(addition(A,B))=addition(domain(A),domain(B)).
% 1.78/1.99 ---> New Demodulator: 39 [new_demod,38] domain(addition(A,B))=addition(domain(A),domain(B)).
% 1.78/1.99 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.78/1.99 Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] addition(A,B)=addition(B,A).
% 1.78/1.99 >>>> Starting back demodulation with 9.
% 1.78/1.99 >>>> Starting back demodulation with 11.
% 1.78/1.99 >>>> Starting back demodulation with 13.
% 1.78/1.99 >>>> Starting back demodulation with 16.
% 1.78/1.99 >> back demodulating 4 with 16.
% 1.78/1.99 >>>> Starting back demodulation with 18.
% 1.78/1.99 >>>> Starting back demodulation with 20.
% 1.78/1.99 >>>> Starting back demodulation with 22.
% 1.78/1.99 >>>> Starting back demodulation with 24.
% 1.78/1.99 >>>> Starting back demodulation with 26.
% 1.78/1.99 >>>> Starting back demodulation with 28.
% 1.78/1.99 >>>> Starting back demodulation with 30.
% 1.78/1.99 >>>> Starting back demodulation with 33.
% 1.78/1.99 >>>> Starting back demodulation with 35.
% 1.78/1.99 >>>> Starting back demodulation with 37.
% 1.78/1.99 >>>> Starting back demodulation with 39.
% 1.78/1.99
% 1.78/1.99 ======= end of input processing =======
% 1.78/1.99
% 1.78/1.99 =========== start of search ===========
% 1.78/1.99
% 1.78/1.99 -------- PROOF --------
% 1.78/1.99
% 1.78/1.99 ----> UNIT CONFLICT at 0.00 sec ----> 123 [binary,121.1,40.1] $F.
% 1.78/1.99
% 1.78/1.99 Length of proof is 5. Level of proof is 2.
% 1.78/1.99
% 1.78/1.99 ---------------- PROOF ----------------
% 1.78/1.99 % SZS status Theorem
% 1.78/1.99 % SZS output start Refutation
% See solution above
% 1.78/1.99 ------------ end of proof -------------
% 1.78/1.99
% 1.78/1.99
% 1.78/1.99 Search stopped by max_proofs option.
% 1.78/1.99
% 1.78/1.99
% 1.78/1.99 Search stopped by max_proofs option.
% 1.78/1.99
% 1.78/1.99 ============ end of search ============
% 1.78/1.99
% 1.78/1.99 -------------- statistics -------------
% 1.78/1.99 clauses given 31
% 1.78/1.99 clauses generated 317
% 1.78/1.99 clauses kept 89
% 1.78/1.99 clauses forward subsumed 257
% 1.78/1.99 clauses back subsumed 8
% 1.78/1.99 Kbytes malloced 1953
% 1.78/1.99
% 1.78/1.99 ----------- times (seconds) -----------
% 1.78/1.99 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.78/1.99 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.78/1.99 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.78/1.99
% 1.78/1.99 That finishes the proof of the theorem.
% 1.78/1.99
% 1.78/1.99 Process 12510 finished Wed Jul 27 06:27:22 2022
% 1.78/1.99 Otter interrupted
% 1.78/1.99 PROOF FOUND
%------------------------------------------------------------------------------