TSTP Solution File: KLE025+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KLE025+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:32 EDT 2022
% Result : Unknown 32.65s 32.83s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE025+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 06:31:07 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.83/2.01 ----- Otter 3.3f, August 2004 -----
% 1.83/2.01 The process was started by sandbox on n019.cluster.edu,
% 1.83/2.01 Wed Jul 27 06:31:07 2022
% 1.83/2.01 The command was "./otter". The process ID is 12824.
% 1.83/2.01
% 1.83/2.01 set(prolog_style_variables).
% 1.83/2.01 set(auto).
% 1.83/2.01 dependent: set(auto1).
% 1.83/2.01 dependent: set(process_input).
% 1.83/2.01 dependent: clear(print_kept).
% 1.83/2.01 dependent: clear(print_new_demod).
% 1.83/2.01 dependent: clear(print_back_demod).
% 1.83/2.01 dependent: clear(print_back_sub).
% 1.83/2.01 dependent: set(control_memory).
% 1.83/2.01 dependent: assign(max_mem, 12000).
% 1.83/2.01 dependent: assign(pick_given_ratio, 4).
% 1.83/2.01 dependent: assign(stats_level, 1).
% 1.83/2.01 dependent: assign(max_seconds, 10800).
% 1.83/2.01 clear(print_given).
% 1.83/2.01
% 1.83/2.01 formula_list(usable).
% 1.83/2.01 all A (A=A).
% 1.83/2.01 all A B (addition(A,B)=addition(B,A)).
% 1.83/2.01 all C B A (addition(A,addition(B,C))=addition(addition(A,B),C)).
% 1.83/2.01 all A (addition(A,zero)=A).
% 1.83/2.01 all A (addition(A,A)=A).
% 1.83/2.01 all A B C (multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C)).
% 1.83/2.01 all A (multiplication(A,one)=A).
% 1.83/2.01 all A (multiplication(one,A)=A).
% 1.83/2.01 all A B C (multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C))).
% 1.83/2.01 all A B C (multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C))).
% 1.83/2.01 all A (multiplication(A,zero)=zero).
% 1.83/2.01 all A (multiplication(zero,A)=zero).
% 1.83/2.01 all A B (le_q(A,B)<->addition(A,B)=B).
% 1.83/2.01 all X0 (test(X0)<-> (exists X1 complement(X1,X0))).
% 1.83/2.01 all X0 X1 (complement(X1,X0)<->multiplication(X0,X1)=zero&multiplication(X1,X0)=zero&addition(X0,X1)=one).
% 1.83/2.01 all X0 X1 (test(X0)-> (c(X0)=X1<->complement(X0,X1))).
% 1.83/2.01 all X0 (-test(X0)->c(X0)=zero).
% 1.83/2.01 all X0 X1 (test(X0)&test(X1)->c(addition(X0,X1))=multiplication(c(X0),c(X1))).
% 1.83/2.01 all X0 X1 (test(X0)&test(X1)->c(multiplication(X0,X1))=addition(c(X0),c(X1))).
% 1.83/2.01 -(all X0 X1 X2 (test(X1)&test(X2)-> (multiplication(multiplication(X1,X0),c(X2))=zero->multiplication(X1,X0)=multiplication(multiplication(X1,X0),X2)))).
% 1.83/2.01 end_of_list.
% 1.83/2.01
% 1.83/2.01 -------> usable clausifies to:
% 1.83/2.01
% 1.83/2.01 list(usable).
% 1.83/2.01 0 [] A=A.
% 1.83/2.01 0 [] addition(A,B)=addition(B,A).
% 1.83/2.01 0 [] addition(A,addition(B,C))=addition(addition(A,B),C).
% 1.83/2.01 0 [] addition(A,zero)=A.
% 1.83/2.01 0 [] addition(A,A)=A.
% 1.83/2.01 0 [] multiplication(A,multiplication(B,C))=multiplication(multiplication(A,B),C).
% 1.83/2.01 0 [] multiplication(A,one)=A.
% 1.83/2.01 0 [] multiplication(one,A)=A.
% 1.83/2.01 0 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 1.83/2.01 0 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 1.83/2.01 0 [] multiplication(A,zero)=zero.
% 1.83/2.01 0 [] multiplication(zero,A)=zero.
% 1.83/2.01 0 [] -le_q(A,B)|addition(A,B)=B.
% 1.83/2.01 0 [] le_q(A,B)|addition(A,B)!=B.
% 1.83/2.01 0 [] -test(X0)|complement($f1(X0),X0).
% 1.83/2.01 0 [] test(X0)| -complement(X1,X0).
% 1.83/2.01 0 [] -complement(X1,X0)|multiplication(X0,X1)=zero.
% 1.83/2.01 0 [] -complement(X1,X0)|multiplication(X1,X0)=zero.
% 1.83/2.01 0 [] -complement(X1,X0)|addition(X0,X1)=one.
% 1.83/2.01 0 [] complement(X1,X0)|multiplication(X0,X1)!=zero|multiplication(X1,X0)!=zero|addition(X0,X1)!=one.
% 1.83/2.01 0 [] -test(X0)|c(X0)!=X1|complement(X0,X1).
% 1.83/2.01 0 [] -test(X0)|c(X0)=X1| -complement(X0,X1).
% 1.83/2.01 0 [] test(X0)|c(X0)=zero.
% 1.83/2.01 0 [] -test(X0)| -test(X1)|c(addition(X0,X1))=multiplication(c(X0),c(X1)).
% 1.83/2.01 0 [] -test(X0)| -test(X1)|c(multiplication(X0,X1))=addition(c(X0),c(X1)).
% 1.83/2.01 0 [] test($c2).
% 1.83/2.01 0 [] test($c1).
% 1.83/2.01 0 [] multiplication(multiplication($c2,$c3),c($c1))=zero.
% 1.83/2.01 0 [] multiplication($c2,$c3)!=multiplication(multiplication($c2,$c3),$c1).
% 1.83/2.01 end_of_list.
% 1.83/2.01
% 1.83/2.01 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.83/2.01
% 1.83/2.01 This ia a non-Horn set with equality. The strategy will be
% 1.83/2.01 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.83/2.01 deletion, with positive clauses in sos and nonpositive
% 1.83/2.01 clauses in usable.
% 1.83/2.01
% 1.83/2.01 dependent: set(knuth_bendix).
% 1.83/2.01 dependent: set(anl_eq).
% 1.83/2.01 dependent: set(para_from).
% 1.83/2.01 dependent: set(para_into).
% 1.83/2.01 dependent: clear(para_from_right).
% 1.83/2.01 dependent: clear(para_into_right).
% 1.83/2.01 dependent: set(para_from_vars).
% 1.83/2.01 dependent: set(eq_units_both_ways).
% 1.83/2.01 dependent: set(dynamic_demod_all).
% 1.83/2.01 dependent: set(dynamic_demod).
% 1.83/2.01 dependent: set(order_eq).
% 1.83/2.01 dependent: set(back_demod).
% 1.83/2.01 dependent: set(lrpo).
% 1.83/2.01 dependent: set(hyper_res).
% 1.83/2.01 dependent: set(unit_deletion).
% 1.83/2.01 dependent: set(factor).
% 1.83/2.01
% 1.83/2.01 ------------> process usable:
% 1.83/2.01 ** KEPT (pick-wt=8): 1 [] -le_q(A,B)|addition(A,B)=B.
% 32.65/32.82 ** KEPT (pick-wt=8): 2 [] le_q(A,B)|addition(A,B)!=B.
% 32.65/32.82 ** KEPT (pick-wt=6): 3 [] -test(A)|complement($f1(A),A).
% 32.65/32.82 ** KEPT (pick-wt=5): 4 [] test(A)| -complement(B,A).
% 32.65/32.82 ** KEPT (pick-wt=8): 5 [] -complement(A,B)|multiplication(B,A)=zero.
% 32.65/32.82 ** KEPT (pick-wt=8): 6 [] -complement(A,B)|multiplication(A,B)=zero.
% 32.65/32.82 ** KEPT (pick-wt=8): 7 [] -complement(A,B)|addition(B,A)=one.
% 32.65/32.82 ** KEPT (pick-wt=18): 8 [] complement(A,B)|multiplication(B,A)!=zero|multiplication(A,B)!=zero|addition(B,A)!=one.
% 32.65/32.82 ** KEPT (pick-wt=9): 9 [] -test(A)|c(A)!=B|complement(A,B).
% 32.65/32.82 ** KEPT (pick-wt=9): 10 [] -test(A)|c(A)=B| -complement(A,B).
% 32.65/32.82 ** KEPT (pick-wt=14): 11 [] -test(A)| -test(B)|c(addition(A,B))=multiplication(c(A),c(B)).
% 32.65/32.82 ** KEPT (pick-wt=14): 12 [] -test(A)| -test(B)|c(multiplication(A,B))=addition(c(A),c(B)).
% 32.65/32.82 ** KEPT (pick-wt=9): 14 [copy,13,flip.1] multiplication(multiplication($c2,$c3),$c1)!=multiplication($c2,$c3).
% 32.65/32.82
% 32.65/32.82 ------------> process sos:
% 32.65/32.82 ** KEPT (pick-wt=3): 18 [] A=A.
% 32.65/32.82 ** KEPT (pick-wt=7): 19 [] addition(A,B)=addition(B,A).
% 32.65/32.82 ** KEPT (pick-wt=11): 21 [copy,20,flip.1] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 32.65/32.82 ---> New Demodulator: 22 [new_demod,21] addition(addition(A,B),C)=addition(A,addition(B,C)).
% 32.65/32.82 ** KEPT (pick-wt=5): 23 [] addition(A,zero)=A.
% 32.65/32.82 ---> New Demodulator: 24 [new_demod,23] addition(A,zero)=A.
% 32.65/32.82 ** KEPT (pick-wt=5): 25 [] addition(A,A)=A.
% 32.65/32.82 ---> New Demodulator: 26 [new_demod,25] addition(A,A)=A.
% 32.65/32.82 ** KEPT (pick-wt=11): 28 [copy,27,flip.1] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 32.65/32.82 ---> New Demodulator: 29 [new_demod,28] multiplication(multiplication(A,B),C)=multiplication(A,multiplication(B,C)).
% 32.65/32.82 ** KEPT (pick-wt=5): 30 [] multiplication(A,one)=A.
% 32.65/32.82 ---> New Demodulator: 31 [new_demod,30] multiplication(A,one)=A.
% 32.65/32.82 ** KEPT (pick-wt=5): 32 [] multiplication(one,A)=A.
% 32.65/32.82 ---> New Demodulator: 33 [new_demod,32] multiplication(one,A)=A.
% 32.65/32.82 ** KEPT (pick-wt=13): 34 [] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 32.65/32.82 ---> New Demodulator: 35 [new_demod,34] multiplication(A,addition(B,C))=addition(multiplication(A,B),multiplication(A,C)).
% 32.65/32.82 ** KEPT (pick-wt=13): 36 [] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 32.65/32.82 ---> New Demodulator: 37 [new_demod,36] multiplication(addition(A,B),C)=addition(multiplication(A,C),multiplication(B,C)).
% 32.65/32.82 ** KEPT (pick-wt=5): 38 [] multiplication(A,zero)=zero.
% 32.65/32.82 ---> New Demodulator: 39 [new_demod,38] multiplication(A,zero)=zero.
% 32.65/32.82 ** KEPT (pick-wt=5): 40 [] multiplication(zero,A)=zero.
% 32.65/32.82 ---> New Demodulator: 41 [new_demod,40] multiplication(zero,A)=zero.
% 32.65/32.82 ** KEPT (pick-wt=6): 42 [] test(A)|c(A)=zero.
% 32.65/32.82 ** KEPT (pick-wt=2): 43 [] test($c2).
% 32.65/32.82 ** KEPT (pick-wt=2): 44 [] test($c1).
% 32.65/32.82 ** KEPT (pick-wt=8): 46 [copy,45,demod,29] multiplication($c2,multiplication($c3,c($c1)))=zero.
% 32.65/32.82 ---> New Demodulator: 47 [new_demod,46] multiplication($c2,multiplication($c3,c($c1)))=zero.
% 32.65/32.82 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] A=A.
% 32.65/32.82 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] addition(A,B)=addition(B,A).
% 32.65/32.82 >>>> Starting back demodulation with 22.
% 32.65/32.82 >>>> Starting back demodulation with 24.
% 32.65/32.82 >>>> Starting back demodulation with 26.
% 32.65/32.82 >> back demodulating 17 with 26.
% 32.65/32.82 >> back demodulating 16 with 26.
% 32.65/32.82 >> back demodulating 15 with 26.
% 32.65/32.82 >>>> Starting back demodulation with 29.
% 32.65/32.82 >> back demodulating 14 with 29.
% 32.65/32.82 >>>> Starting back demodulation with 31.
% 32.65/32.82 >>>> Starting back demodulation with 33.
% 32.65/32.82 >>>> Starting back demodulation with 35.
% 32.65/32.82 >>>> Starting back demodulation with 37.
% 32.65/32.82 >>>> Starting back demodulation with 39.
% 32.65/32.82 >>>> Starting back demodulation with 41.
% 32.65/32.82 >>>> Starting back demodulation with 47.
% 32.65/32.82
% 32.65/32.82 ======= end of input processing =======
% 32.65/32.82
% 32.65/32.82 =========== start of search ===========
% 32.65/32.82
% 32.65/32.82
% 32.65/32.82 Resetting weight limit to 7.
% 32.65/32.82
% 32.65/32.82
% 32.65/32.82 Resetting weight limit to 7.
% 32.65/32.82
% 32.65/32.82 sos_size=1596
% 32.65/32.82
% 32.65/32.82 Search stopped because sos empty.
% 32.65/32.82
% 32.65/32.82
% 32.65/32.82 Search stopped because sos empty.
% 32.65/32.82
% 32.65/32.82 ============ end of search ============
% 32.65/32.82
% 32.65/32.82 -------------- statistics -------------
% 32.65/32.82 clauses given 2150
% 32.65/32.82 clauses generated 1676043
% 32.65/32.83 clauses kept 2844
% 32.65/32.83 clauses forward subsumed 70361
% 32.65/32.83 clauses back subsumed 620
% 32.65/32.83 Kbytes malloced 5859
% 32.65/32.83
% 32.65/32.83 ----------- times (seconds) -----------
% 32.65/32.83 user CPU time 30.80 (0 hr, 0 min, 30 sec)
% 32.65/32.83 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 32.65/32.83 wall-clock time 32 (0 hr, 0 min, 32 sec)
% 32.65/32.83
% 32.65/32.83 Process 12824 finished Wed Jul 27 06:31:39 2022
% 32.65/32.83 Otter interrupted
% 32.65/32.83 PROOF NOT FOUND
%------------------------------------------------------------------------------