TSTP Solution File: SYO614-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYO614-1 : TPTP v8.1.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:26:25 EDT 2022
% Result : Unsatisfiable 1.75s 1.96s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 8 unt; 3 nHn; 5 RR)
% Number of literals : 24 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 31 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ le(max(A,B),C)
| le(A,C) ),
file('SYO614-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ le(max(A,B),C)
| le(B,C) ),
file('SYO614-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ e_q(f(A),a0)
| ~ e_q(f(B),a0)
| ~ le(s(A),B) ),
file('SYO614-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ e_q(f(A),a1)
| ~ e_q(f(B),a1)
| ~ le(s(A),B) ),
file('SYO614-1.p',unknown),
[] ).
cnf(7,axiom,
le(A,A),
file('SYO614-1.p',unknown),
[] ).
cnf(8,axiom,
( e_q(f(A),a0)
| e_q(f(A),a1) ),
file('SYO614-1.p',unknown),
[] ).
cnf(9,plain,
le(A,max(B,A)),
inference(hyper,[status(thm)],[7,2]),
[iquote('hyper,7,2')] ).
cnf(10,plain,
le(A,max(A,B)),
inference(hyper,[status(thm)],[7,1]),
[iquote('hyper,7,1')] ).
cnf(12,plain,
le(A,max(B,max(A,C))),
inference(hyper,[status(thm)],[9,1]),
[iquote('hyper,9,1')] ).
cnf(13,plain,
le(A,max(max(B,A),C)),
inference(hyper,[status(thm)],[10,2]),
[iquote('hyper,10,2')] ).
cnf(19,plain,
( e_q(f(max(A,max(s(B),C))),a1)
| e_q(f(B),a1) ),
inference(hyper,[status(thm)],[8,3,8,12]),
[iquote('hyper,8,3,8,12')] ).
cnf(23,plain,
( e_q(f(s(A)),a1)
| e_q(f(A),a1) ),
inference(hyper,[status(thm)],[8,3,8,7]),
[iquote('hyper,8,3,8,7')] ).
cnf(31,plain,
le(A,max(max(B,max(C,A)),D)),
inference(hyper,[status(thm)],[13,2]),
[iquote('hyper,13,2')] ).
cnf(172,plain,
e_q(f(A),a1),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[19,4,23,31])]),
[iquote('hyper,19,4,23,31,factor_simp')] ).
cnf(173,plain,
$false,
inference(hyper,[status(thm)],[172,4,172,31]),
[iquote('hyper,172,4,172,31')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO614-1 : TPTP v8.1.0. Released v7.1.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:15:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.75/1.96 ----- Otter 3.3f, August 2004 -----
% 1.75/1.96 The process was started by sandbox on n010.cluster.edu,
% 1.75/1.96 Wed Jul 27 10:15:25 2022
% 1.75/1.96 The command was "./otter". The process ID is 7380.
% 1.75/1.96
% 1.75/1.96 set(prolog_style_variables).
% 1.75/1.96 set(auto).
% 1.75/1.96 dependent: set(auto1).
% 1.75/1.96 dependent: set(process_input).
% 1.75/1.96 dependent: clear(print_kept).
% 1.75/1.96 dependent: clear(print_new_demod).
% 1.75/1.96 dependent: clear(print_back_demod).
% 1.75/1.96 dependent: clear(print_back_sub).
% 1.75/1.96 dependent: set(control_memory).
% 1.75/1.96 dependent: assign(max_mem, 12000).
% 1.75/1.96 dependent: assign(pick_given_ratio, 4).
% 1.75/1.96 dependent: assign(stats_level, 1).
% 1.75/1.96 dependent: assign(max_seconds, 10800).
% 1.75/1.96 clear(print_given).
% 1.75/1.96
% 1.75/1.96 list(usable).
% 1.75/1.96 0 [] le(A,A).
% 1.75/1.96 0 [] -le(max(A,B),C)|le(A,C).
% 1.75/1.96 0 [] -le(max(A,B),C)|le(B,C).
% 1.75/1.96 0 [] e_q(f(A),a0)|e_q(f(A),a1).
% 1.75/1.96 0 [] -e_q(f(A0),a0)| -e_q(f(A1),a0)| -le(s(A0),A1).
% 1.75/1.96 0 [] -e_q(f(A0),a1)| -e_q(f(A1),a1)| -le(s(A0),A1).
% 1.75/1.96 end_of_list.
% 1.75/1.96
% 1.75/1.96 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.75/1.96
% 1.75/1.96 This is a non-Horn set without equality. The strategy will
% 1.75/1.96 be ordered hyper_res, unit deletion, and factoring, with
% 1.75/1.96 satellites in sos and with nuclei in usable.
% 1.75/1.96
% 1.75/1.96 dependent: set(hyper_res).
% 1.75/1.96 dependent: set(factor).
% 1.75/1.96 dependent: set(unit_deletion).
% 1.75/1.96
% 1.75/1.96 ------------> process usable:
% 1.75/1.96 ** KEPT (pick-wt=8): 1 [] -le(max(A,B),C)|le(A,C).
% 1.75/1.96 ** KEPT (pick-wt=8): 2 [] -le(max(A,B),C)|le(B,C).
% 1.75/1.96 ** KEPT (pick-wt=12): 3 [] -e_q(f(A),a0)| -e_q(f(B),a0)| -le(s(A),B).
% 1.75/1.96 ** KEPT (pick-wt=12): 4 [] -e_q(f(A),a1)| -e_q(f(B),a1)| -le(s(A),B).
% 1.75/1.96
% 1.75/1.96 ------------> process sos:
% 1.75/1.96 ** KEPT (pick-wt=3): 7 [] le(A,A).
% 1.75/1.96 ** KEPT (pick-wt=8): 8 [] e_q(f(A),a0)|e_q(f(A),a1).
% 1.75/1.96
% 1.75/1.96 ======= end of input processing =======
% 1.75/1.96
% 1.75/1.96 =========== start of search ===========
% 1.75/1.96
% 1.75/1.96 -------- PROOF --------
% 1.75/1.96
% 1.75/1.96 -----> EMPTY CLAUSE at 0.01 sec ----> 173 [hyper,172,4,172,31] $F.
% 1.75/1.96
% 1.75/1.96 Length of proof is 8. Level of proof is 4.
% 1.75/1.96
% 1.75/1.96 ---------------- PROOF ----------------
% 1.75/1.96 % SZS status Unsatisfiable
% 1.75/1.96 % SZS output start Refutation
% See solution above
% 1.75/1.96 ------------ end of proof -------------
% 1.75/1.96
% 1.75/1.96
% 1.75/1.96 Search stopped by max_proofs option.
% 1.75/1.96
% 1.75/1.96
% 1.75/1.96 Search stopped by max_proofs option.
% 1.75/1.96
% 1.75/1.96 ============ end of search ============
% 1.75/1.96
% 1.75/1.96 -------------- statistics -------------
% 1.75/1.96 clauses given 17
% 1.75/1.96 clauses generated 425
% 1.75/1.96 clauses kept 172
% 1.75/1.96 clauses forward subsumed 258
% 1.75/1.96 clauses back subsumed 105
% 1.75/1.96 Kbytes malloced 976
% 1.75/1.96
% 1.75/1.96 ----------- times (seconds) -----------
% 1.75/1.96 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.75/1.96 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.96 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.75/1.96
% 1.75/1.96 That finishes the proof of the theorem.
% 1.75/1.96
% 1.75/1.96 Process 7380 finished Wed Jul 27 10:15:26 2022
% 1.75/1.96 Otter interrupted
% 1.75/1.96 PROOF FOUND
%------------------------------------------------------------------------------