TSTP Solution File: LCL259-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL259-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:04:05 EDT 2022
% Result : Unknown 2.06s 2.22s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LCL259-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n006.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 09:14:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.06/2.22 ----- Otter 3.3f, August 2004 -----
% 2.06/2.22 The process was started by sandbox on n006.cluster.edu,
% 2.06/2.22 Wed Jul 27 09:14:32 2022
% 2.06/2.22 The command was "./otter". The process ID is 31772.
% 2.06/2.22
% 2.06/2.22 set(prolog_style_variables).
% 2.06/2.22 set(auto).
% 2.06/2.22 dependent: set(auto1).
% 2.06/2.22 dependent: set(process_input).
% 2.06/2.22 dependent: clear(print_kept).
% 2.06/2.22 dependent: clear(print_new_demod).
% 2.06/2.22 dependent: clear(print_back_demod).
% 2.06/2.22 dependent: clear(print_back_sub).
% 2.06/2.22 dependent: set(control_memory).
% 2.06/2.22 dependent: assign(max_mem, 12000).
% 2.06/2.22 dependent: assign(pick_given_ratio, 4).
% 2.06/2.22 dependent: assign(stats_level, 1).
% 2.06/2.22 dependent: assign(max_seconds, 10800).
% 2.06/2.22 clear(print_given).
% 2.06/2.22
% 2.06/2.22 list(usable).
% 2.06/2.22 0 [] A=A.
% 2.06/2.22 0 [] axiom(implies(or(A,A),A)).
% 2.06/2.22 0 [] axiom(implies(A,or(B,A))).
% 2.06/2.22 0 [] axiom(implies(or(A,B),or(B,A))).
% 2.06/2.22 0 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 2.06/2.22 0 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 2.06/2.22 0 [] implies(X,Y)=or(not(X),Y).
% 2.06/2.22 0 [] theorem(X)| -axiom(X).
% 2.06/2.22 0 [] theorem(X)| -theorem(implies(Y,X))| -theorem(Y).
% 2.06/2.22 0 [] -theorem(implies(implies(p,implies(p,q)),implies(p,q))).
% 2.06/2.22 end_of_list.
% 2.06/2.22
% 2.06/2.22 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 2.06/2.22
% 2.06/2.22 This is a Horn set with equality. The strategy will be
% 2.06/2.22 Knuth-Bendix and hyper_res, with positive clauses in
% 2.06/2.22 sos and nonpositive clauses in usable.
% 2.06/2.22
% 2.06/2.22 dependent: set(knuth_bendix).
% 2.06/2.22 dependent: set(anl_eq).
% 2.06/2.22 dependent: set(para_from).
% 2.06/2.22 dependent: set(para_into).
% 2.06/2.22 dependent: clear(para_from_right).
% 2.06/2.22 dependent: clear(para_into_right).
% 2.06/2.22 dependent: set(para_from_vars).
% 2.06/2.22 dependent: set(eq_units_both_ways).
% 2.06/2.22 dependent: set(dynamic_demod_all).
% 2.06/2.22 dependent: set(dynamic_demod).
% 2.06/2.22 dependent: set(order_eq).
% 2.06/2.22 dependent: set(back_demod).
% 2.06/2.22 dependent: set(lrpo).
% 2.06/2.22 dependent: set(hyper_res).
% 2.06/2.22 dependent: clear(order_hyper).
% 2.06/2.22
% 2.06/2.22 ------------> process usable:
% 2.06/2.22 ** KEPT (pick-wt=4): 1 [] theorem(A)| -axiom(A).
% 2.06/2.22 ** KEPT (pick-wt=8): 2 [] theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 2.06/2.22 ** KEPT (pick-wt=10): 3 [] -theorem(implies(implies(p,implies(p,q)),implies(p,q))).
% 2.06/2.22
% 2.06/2.22 ------------> process sos:
% 2.06/2.22 ** KEPT (pick-wt=3): 4 [] A=A.
% 2.06/2.22 ** KEPT (pick-wt=6): 5 [] axiom(implies(or(A,A),A)).
% 2.06/2.22 ** KEPT (pick-wt=6): 6 [] axiom(implies(A,or(B,A))).
% 2.06/2.22 ** KEPT (pick-wt=8): 7 [] axiom(implies(or(A,B),or(B,A))).
% 2.06/2.22 ** KEPT (pick-wt=12): 8 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 2.06/2.22 ** KEPT (pick-wt=12): 9 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 2.06/2.22 ** KEPT (pick-wt=8): 11 [copy,10,flip.1] or(not(A),B)=implies(A,B).
% 2.06/2.22 ---> New Demodulator: 12 [new_demod,11] or(not(A),B)=implies(A,B).
% 2.06/2.22 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 2.06/2.22 >>>> Starting back demodulation with 12.
% 2.06/2.22
% 2.06/2.22 ======= end of input processing =======
% 2.06/2.22
% 2.06/2.22 =========== start of search ===========
% 2.06/2.22
% 2.06/2.22
% 2.06/2.22 Resetting weight limit to 8.
% 2.06/2.22
% 2.06/2.22
% 2.06/2.22 Resetting weight limit to 8.
% 2.06/2.22
% 2.06/2.22 sos_size=227
% 2.06/2.22
% 2.06/2.22 Search stopped because sos empty.
% 2.06/2.22
% 2.06/2.22
% 2.06/2.22 Search stopped because sos empty.
% 2.06/2.22
% 2.06/2.22 ============ end of search ============
% 2.06/2.22
% 2.06/2.22 -------------- statistics -------------
% 2.06/2.22 clauses given 326
% 2.06/2.22 clauses generated 24048
% 2.06/2.22 clauses kept 336
% 2.06/2.22 clauses forward subsumed 9444
% 2.06/2.22 clauses back subsumed 7
% 2.06/2.22 Kbytes malloced 7812
% 2.06/2.22
% 2.06/2.22 ----------- times (seconds) -----------
% 2.06/2.22 user CPU time 0.10 (0 hr, 0 min, 0 sec)
% 2.06/2.22 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.06/2.22 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.06/2.22
% 2.06/2.22 Process 31772 finished Wed Jul 27 09:14:33 2022
% 2.06/2.22 Otter interrupted
% 2.06/2.22 PROOF NOT FOUND
%------------------------------------------------------------------------------