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