TSTP Solution File: SYN061+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN061+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:23:27 EDT 2022
% Result : Theorem 1.97s 2.11s
% Output : Refutation 1.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 4 unt; 1 nHn; 6 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ big_f(A)
| ~ big_h(A) ),
file('SYN061+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big_i(A)
| ~ big_j(A) ),
file('SYN061+1.p',unknown),
[] ).
cnf(4,axiom,
big_i(dollar_c1),
file('SYN061+1.p',unknown),
[] ).
cnf(5,axiom,
big_f(dollar_c1),
file('SYN061+1.p',unknown),
[] ).
cnf(6,axiom,
( big_h(A)
| big_j(A) ),
file('SYN061+1.p',unknown),
[] ).
cnf(7,plain,
big_h(dollar_c1),
inference(hyper,[status(thm)],[6,3,4]),
[iquote('hyper,6,3,4')] ).
cnf(8,plain,
$false,
inference(hyper,[status(thm)],[7,2,5]),
[iquote('hyper,7,2,5')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN061+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 11:10:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.93/2.11 ----- Otter 3.3f, August 2004 -----
% 1.93/2.11 The process was started by sandbox2 on n020.cluster.edu,
% 1.93/2.11 Wed Jul 27 11:10:23 2022
% 1.93/2.11 The command was "./otter". The process ID is 26456.
% 1.93/2.11
% 1.93/2.11 set(prolog_style_variables).
% 1.93/2.11 set(auto).
% 1.93/2.11 dependent: set(auto1).
% 1.93/2.11 dependent: set(process_input).
% 1.93/2.11 dependent: clear(print_kept).
% 1.93/2.11 dependent: clear(print_new_demod).
% 1.93/2.11 dependent: clear(print_back_demod).
% 1.93/2.11 dependent: clear(print_back_sub).
% 1.93/2.11 dependent: set(control_memory).
% 1.93/2.11 dependent: assign(max_mem, 12000).
% 1.93/2.11 dependent: assign(pick_given_ratio, 4).
% 1.93/2.11 dependent: assign(stats_level, 1).
% 1.93/2.11 dependent: assign(max_seconds, 10800).
% 1.93/2.11 clear(print_given).
% 1.93/2.11
% 1.93/2.11 formula_list(usable).
% 1.93/2.11 -(exists X (big_f(X)& (big_g(X)|big_h(X)))).
% 1.93/2.11 exists X (big_i(X)&big_f(X)).
% 1.93/2.11 all X (-big_h(X)->big_j(X)).
% 1.93/2.11 -(exists X (big_i(X)&big_j(X))).
% 1.93/2.11 end_of_list.
% 1.93/2.11
% 1.93/2.11 -------> usable clausifies to:
% 1.93/2.11
% 1.93/2.11 list(usable).
% 1.93/2.11 0 [] -big_f(X)| -big_g(X).
% 1.93/2.11 0 [] -big_f(X)| -big_h(X).
% 1.93/2.11 0 [] big_i($c1).
% 1.93/2.11 0 [] big_f($c1).
% 1.93/2.11 0 [] big_h(X)|big_j(X).
% 1.93/2.11 0 [] -big_i(X)| -big_j(X).
% 1.93/2.11 end_of_list.
% 1.93/2.11
% 1.93/2.11 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.97/2.11
% 1.97/2.11 This is a non-Horn set without equality. The strategy will
% 1.97/2.11 be ordered hyper_res, unit deletion, and factoring, with
% 1.97/2.11 satellites in sos and with nuclei in usable.
% 1.97/2.11
% 1.97/2.11 dependent: set(hyper_res).
% 1.97/2.11 dependent: set(factor).
% 1.97/2.11 dependent: set(unit_deletion).
% 1.97/2.11
% 1.97/2.11 ------------> process usable:
% 1.97/2.11 ** KEPT (pick-wt=4): 1 [] -big_f(A)| -big_g(A).
% 1.97/2.11 ** KEPT (pick-wt=4): 2 [] -big_f(A)| -big_h(A).
% 1.97/2.11 ** KEPT (pick-wt=4): 3 [] -big_i(A)| -big_j(A).
% 1.97/2.11
% 1.97/2.11 ------------> process sos:
% 1.97/2.11 ** KEPT (pick-wt=2): 4 [] big_i($c1).
% 1.97/2.11 ** KEPT (pick-wt=2): 5 [] big_f($c1).
% 1.97/2.11 ** KEPT (pick-wt=4): 6 [] big_h(A)|big_j(A).
% 1.97/2.11
% 1.97/2.11 ======= end of input processing =======
% 1.97/2.11
% 1.97/2.11 =========== start of search ===========
% 1.97/2.11
% 1.97/2.11 -------- PROOF --------
% 1.97/2.11
% 1.97/2.11 -----> EMPTY CLAUSE at 0.00 sec ----> 8 [hyper,7,2,5] $F.
% 1.97/2.11
% 1.97/2.11 Length of proof is 1. Level of proof is 1.
% 1.97/2.11
% 1.97/2.11 ---------------- PROOF ----------------
% 1.97/2.11 % SZS status Theorem
% 1.97/2.11 % SZS output start Refutation
% See solution above
% 1.97/2.11 ------------ end of proof -------------
% 1.97/2.11
% 1.97/2.11
% 1.97/2.11 Search stopped by max_proofs option.
% 1.97/2.11
% 1.97/2.11
% 1.97/2.11 Search stopped by max_proofs option.
% 1.97/2.11
% 1.97/2.11 ============ end of search ============
% 1.97/2.11
% 1.97/2.11 -------------- statistics -------------
% 1.97/2.11 clauses given 4
% 1.97/2.11 clauses generated 2
% 1.97/2.11 clauses kept 7
% 1.97/2.11 clauses forward subsumed 0
% 1.97/2.11 clauses back subsumed 0
% 1.97/2.11 Kbytes malloced 976
% 1.97/2.11
% 1.97/2.11 ----------- times (seconds) -----------
% 1.97/2.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.97/2.11 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.97/2.11
% 1.97/2.11 That finishes the proof of the theorem.
% 1.97/2.11
% 1.97/2.11 Process 26456 finished Wed Jul 27 11:10:25 2022
% 1.97/2.11 Otter interrupted
% 1.97/2.11 PROOF FOUND
%------------------------------------------------------------------------------