TSTP Solution File: ROB005-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ROB005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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 6.05s 6.29s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ROB005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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:00:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 6.05/6.29 ----- Otter 3.3f, August 2004 -----
% 6.05/6.29 The process was started by sandbox2 on n013.cluster.edu,
% 6.05/6.29 Wed Jul 27 04:00:15 2022
% 6.05/6.29 The command was "./otter". The process ID is 10797.
% 6.05/6.29
% 6.05/6.29 set(prolog_style_variables).
% 6.05/6.29 set(auto).
% 6.05/6.29 dependent: set(auto1).
% 6.05/6.29 dependent: set(process_input).
% 6.05/6.29 dependent: clear(print_kept).
% 6.05/6.29 dependent: clear(print_new_demod).
% 6.05/6.29 dependent: clear(print_back_demod).
% 6.05/6.29 dependent: clear(print_back_sub).
% 6.05/6.29 dependent: set(control_memory).
% 6.05/6.29 dependent: assign(max_mem, 12000).
% 6.05/6.29 dependent: assign(pick_given_ratio, 4).
% 6.05/6.29 dependent: assign(stats_level, 1).
% 6.05/6.29 dependent: assign(max_seconds, 10800).
% 6.05/6.29 clear(print_given).
% 6.05/6.29
% 6.05/6.29 list(usable).
% 6.05/6.29 0 [] A=A.
% 6.05/6.29 0 [] add(X,Y)=add(Y,X).
% 6.05/6.29 0 [] add(add(X,Y),Z)=add(X,add(Y,Z)).
% 6.05/6.29 0 [] negate(add(negate(add(X,Y)),negate(add(X,negate(Y)))))=X.
% 6.05/6.29 0 [] add(c,c)=c.
% 6.05/6.29 0 [] add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 6.05/6.29 end_of_list.
% 6.05/6.29
% 6.05/6.29 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 6.05/6.29
% 6.05/6.29 All clauses are units, and equality is present; the
% 6.05/6.29 strategy will be Knuth-Bendix with positive clauses in sos.
% 6.05/6.29
% 6.05/6.29 dependent: set(knuth_bendix).
% 6.05/6.29 dependent: set(anl_eq).
% 6.05/6.29 dependent: set(para_from).
% 6.05/6.29 dependent: set(para_into).
% 6.05/6.29 dependent: clear(para_from_right).
% 6.05/6.29 dependent: clear(para_into_right).
% 6.05/6.29 dependent: set(para_from_vars).
% 6.05/6.29 dependent: set(eq_units_both_ways).
% 6.05/6.29 dependent: set(dynamic_demod_all).
% 6.05/6.29 dependent: set(dynamic_demod).
% 6.05/6.29 dependent: set(order_eq).
% 6.05/6.29 dependent: set(back_demod).
% 6.05/6.29 dependent: set(lrpo).
% 6.05/6.29
% 6.05/6.29 ------------> process usable:
% 6.05/6.29 ** KEPT (pick-wt=14): 1 [] add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 6.05/6.29
% 6.05/6.29 ------------> process sos:
% 6.05/6.29 ** KEPT (pick-wt=3): 2 [] A=A.
% 6.05/6.29 ** KEPT (pick-wt=7): 3 [] add(A,B)=add(B,A).
% 6.05/6.29 ** KEPT (pick-wt=11): 4 [] add(add(A,B),C)=add(A,add(B,C)).
% 6.05/6.29 ---> New Demodulator: 5 [new_demod,4] add(add(A,B),C)=add(A,add(B,C)).
% 6.05/6.29 ** KEPT (pick-wt=13): 6 [] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 6.05/6.29 ---> New Demodulator: 7 [new_demod,6] negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 6.05/6.29 ** KEPT (pick-wt=5): 8 [] add(c,c)=c.
% 6.05/6.29 ---> New Demodulator: 9 [new_demod,8] add(c,c)=c.
% 6.05/6.29 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 6.05/6.29 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] add(A,B)=add(B,A).
% 6.05/6.29 >>>> Starting back demodulation with 5.
% 6.05/6.29 >>>> Starting back demodulation with 7.
% 6.05/6.29 >>>> Starting back demodulation with 9.
% 6.05/6.29
% 6.05/6.29 ======= end of input processing =======
% 6.05/6.29
% 6.05/6.29 =========== start of search ===========
% 6.05/6.29
% 6.05/6.29
% 6.05/6.29 Resetting weight limit to 15.
% 6.05/6.29
% 6.05/6.29
% 6.05/6.29 Resetting weight limit to 15.
% 6.05/6.29
% 6.05/6.29 sos_size=438
% 6.05/6.29
% 6.05/6.29 Search stopped because sos empty.
% 6.05/6.29
% 6.05/6.29
% 6.05/6.29 Search stopped because sos empty.
% 6.05/6.29
% 6.05/6.29 ============ end of search ============
% 6.05/6.29
% 6.05/6.29 -------------- statistics -------------
% 6.05/6.29 clauses given 484
% 6.05/6.29 clauses generated 424840
% 6.05/6.29 clauses kept 530
% 6.05/6.29 clauses forward subsumed 17528
% 6.05/6.29 clauses back subsumed 3
% 6.05/6.29 Kbytes malloced 7812
% 6.05/6.29
% 6.05/6.29 ----------- times (seconds) -----------
% 6.05/6.29 user CPU time 4.16 (0 hr, 0 min, 4 sec)
% 6.05/6.29 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 6.05/6.29 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 6.05/6.29
% 6.05/6.29 Process 10797 finished Wed Jul 27 04:00:21 2022
% 6.05/6.29 Otter interrupted
% 6.05/6.29 PROOF NOT FOUND
%------------------------------------------------------------------------------