TSTP Solution File: ROB012-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ROB012-1 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:12:22 EDT 2022
% Result : Unknown 2.14s 2.31s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ROB012-1 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n022.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 04:05:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.14/2.31 ----- Otter 3.3f, August 2004 -----
% 2.14/2.31 The process was started by sandbox on n022.cluster.edu,
% 2.14/2.31 Wed Jul 27 04:05:20 2022
% 2.14/2.31 The command was "./otter". The process ID is 23952.
% 2.14/2.31
% 2.14/2.31 set(prolog_style_variables).
% 2.14/2.31 set(auto).
% 2.14/2.31 dependent: set(auto1).
% 2.14/2.31 dependent: set(process_input).
% 2.14/2.31 dependent: clear(print_kept).
% 2.14/2.31 dependent: clear(print_new_demod).
% 2.14/2.31 dependent: clear(print_back_demod).
% 2.14/2.31 dependent: clear(print_back_sub).
% 2.14/2.31 dependent: set(control_memory).
% 2.14/2.31 dependent: assign(max_mem, 12000).
% 2.14/2.31 dependent: assign(pick_given_ratio, 4).
% 2.14/2.31 dependent: assign(stats_level, 1).
% 2.14/2.31 dependent: assign(max_seconds, 10800).
% 2.14/2.31 clear(print_given).
% 2.14/2.31
% 2.14/2.31 list(usable).
% 2.14/2.31 0 [] A=A.
% 2.14/2.31 0 [] add(X,Y)=add(Y,X).
% 2.14/2.31 0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 2.14/2.31 0 [] negate(add(negate(add(X,Y)),negate(add(X,negate(Y)))))=X.
% 2.14/2.31 0 [] multiply(one,X)=X.
% 2.14/2.31 0 [] -positive_integer(X)|multiply(successor(V),X)=add(X,multiply(V,X)).
% 2.14/2.31 0 [] positive_integer(one).
% 2.14/2.31 0 [] -positive_integer(X)|positive_integer(successor(X)).
% 2.14/2.31 0 [] negate(add(a,negate(b)))=c.
% 2.14/2.31 0 [] positive_integer(k).
% 2.14/2.31 0 [] negate(add(a,negate(add(b,multiply(k,add(a,c))))))=c.
% 2.14/2.31 0 [] negate(add(a,negate(add(b,multiply(successor(k),add(a,c))))))!=c.
% 2.14/2.31 end_of_list.
% 2.14/2.31
% 2.14/2.31 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 2.14/2.31
% 2.14/2.31 This is a Horn set with equality. The strategy will be
% 2.14/2.31 Knuth-Bendix and hyper_res, with positive clauses in
% 2.14/2.31 sos and nonpositive clauses in usable.
% 2.14/2.31
% 2.14/2.31 dependent: set(knuth_bendix).
% 2.14/2.31 dependent: set(anl_eq).
% 2.14/2.31 dependent: set(para_from).
% 2.14/2.31 dependent: set(para_into).
% 2.14/2.31 dependent: clear(para_from_right).
% 2.14/2.31 dependent: clear(para_into_right).
% 2.14/2.31 dependent: set(para_from_vars).
% 2.14/2.31 dependent: set(eq_units_both_ways).
% 2.14/2.31 dependent: set(dynamic_demod_all).
% 2.14/2.31 dependent: set(dynamic_demod).
% 2.14/2.31 dependent: set(order_eq).
% 2.14/2.31 dependent: set(back_demod).
% 2.14/2.31 dependent: set(lrpo).
% 2.14/2.31 dependent: set(hyper_res).
% 2.14/2.31 dependent: clear(order_hyper).
% 2.14/2.31
% 2.14/2.31 ------------> process usable:
% 2.14/2.31 ** KEPT (pick-wt=12): 1 [] -positive_integer(A)|multiply(successor(B),A)=add(A,multiply(B,A)).
% 2.14/2.31 ** KEPT (pick-wt=5): 2 [] -positive_integer(A)|positive_integer(successor(A)).
% 2.14/2.31 ** KEPT (pick-wt=14): 3 [] negate(add(a,negate(add(b,multiply(successor(k),add(a,c))))))!=c.
% 2.14/2.31
% 2.14/2.31 ------------> process sos:
% 2.14/2.31 ** KEPT (pick-wt=3): 4 [] A=A.
% 2.14/2.31 ** KEPT (pick-wt=7): 5 [] add(A,B)=add(B,A).
% 2.14/2.31 ** KEPT (pick-wt=11): 6 [] add(add(A,B),C)=add(A,add(B,C)).
% 2.14/2.31 ---> New Demodulator: 7 [new_demod,6] add(add(A,B),C)=add(A,add(B,C)).
% 2.14/2.31 ** KEPT (pick-wt=13): 8 [] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 2.14/2.31 ---> New Demodulator: 9 [new_demod,8] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 2.14/2.31 ** KEPT (pick-wt=5): 10 [] multiply(one,A)=A.
% 2.14/2.31 ---> New Demodulator: 11 [new_demod,10] multiply(one,A)=A.
% 2.14/2.31 ** KEPT (pick-wt=2): 12 [] positive_integer(one).
% 2.14/2.31 ** KEPT (pick-wt=7): 13 [] negate(add(a,negate(b)))=c.
% 2.14/2.31 ---> New Demodulator: 14 [new_demod,13] negate(add(a,negate(b)))=c.
% 2.14/2.31 ** KEPT (pick-wt=2): 15 [] positive_integer(k).
% 2.14/2.31 ** KEPT (pick-wt=13): 16 [] negate(add(a,negate(add(b,multiply(k,add(a,c))))))=c.
% 2.14/2.31 ---> New Demodulator: 17 [new_demod,16] negate(add(a,negate(add(b,multiply(k,add(a,c))))))=c.
% 2.14/2.31 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 2.14/2.31 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] add(A,B)=add(B,A).
% 2.14/2.31 >>>> Starting back demodulation with 7.
% 2.14/2.31 >>>> Starting back demodulation with 9.
% 2.14/2.31 >>>> Starting back demodulation with 11.
% 2.14/2.31 >>>> Starting back demodulation with 14.
% 2.14/2.31 >>>> Starting back demodulation with 17.
% 2.14/2.31
% 2.14/2.31 ======= end of input processing =======
% 2.14/2.31
% 2.14/2.31 =========== start of search ===========
% 2.14/2.31
% 2.14/2.31
% 2.14/2.31 Resetting weight limit to 13.
% 2.14/2.31
% 2.14/2.31
% 2.14/2.31 Resetting weight limit to 13.
% 2.14/2.31
% 2.14/2.31 sos_size=249
% 2.14/2.31
% 2.14/2.31 Search stopped because sos empty.
% 2.14/2.31
% 2.14/2.31
% 2.14/2.31 Search stopped because sos empty.
% 2.14/2.31
% 2.14/2.31 ============ end of search ============
% 2.14/2.31
% 2.14/2.31 -------------- statistics -------------
% 2.14/2.31 clauses given 359
% 2.14/2.31 clauses generated 53344
% 2.14/2.31 clauses kept 362
% 2.14/2.31 clauses forward subsumed 5458
% 2.14/2.31 clauses back subsumed 0
% 2.14/2.31 Kbytes malloced 7812
% 2.14/2.31
% 2.14/2.31 ----------- times (seconds) -----------
% 2.14/2.31 user CPU time 0.40 (0 hr, 0 min, 0 sec)
% 2.14/2.31 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.14/2.31 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.14/2.31
% 2.14/2.31 Process 23952 finished Wed Jul 27 04:05:22 2022
% 2.14/2.31 Otter interrupted
% 2.14/2.31 PROOF NOT FOUND
%------------------------------------------------------------------------------