TSTP Solution File: SYN395+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN395+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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.28s 1.72s
% Output : Refutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 2 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ f(A)
| g(A) ),
file('SYN395+1.p',unknown),
[] ).
cnf(2,axiom,
~ g(A),
file('SYN395+1.p',unknown),
[] ).
cnf(3,axiom,
f(dollar_c1),
file('SYN395+1.p',unknown),
[] ).
cnf(4,plain,
g(dollar_c1),
inference(hyper,[status(thm)],[3,1]),
[iquote('hyper,3,1')] ).
cnf(5,plain,
$false,
inference(binary,[status(thm)],[4,2]),
[iquote('binary,4.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SYN395+1 : TPTP v8.1.0. Released v2.0.0.
% 0.09/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n016.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:20:52 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.28/1.72 ----- Otter 3.3f, August 2004 -----
% 1.28/1.72 The process was started by sandbox2 on n016.cluster.edu,
% 1.28/1.72 Wed Jul 27 11:20:52 2022
% 1.28/1.72 The command was "./otter". The process ID is 4191.
% 1.28/1.72
% 1.28/1.72 set(prolog_style_variables).
% 1.28/1.72 set(auto).
% 1.28/1.72 dependent: set(auto1).
% 1.28/1.72 dependent: set(process_input).
% 1.28/1.72 dependent: clear(print_kept).
% 1.28/1.72 dependent: clear(print_new_demod).
% 1.28/1.72 dependent: clear(print_back_demod).
% 1.28/1.72 dependent: clear(print_back_sub).
% 1.28/1.72 dependent: set(control_memory).
% 1.28/1.72 dependent: assign(max_mem, 12000).
% 1.28/1.72 dependent: assign(pick_given_ratio, 4).
% 1.28/1.72 dependent: assign(stats_level, 1).
% 1.28/1.72 dependent: assign(max_seconds, 10800).
% 1.28/1.72 clear(print_given).
% 1.28/1.72
% 1.28/1.72 formula_list(usable).
% 1.28/1.72 -((all X (f(X)->g(X)))-> ((exists Y f(Y))-> (exists Z g(Z)))).
% 1.28/1.72 end_of_list.
% 1.28/1.72
% 1.28/1.72 -------> usable clausifies to:
% 1.28/1.72
% 1.28/1.72 list(usable).
% 1.28/1.72 0 [] -f(X)|g(X).
% 1.28/1.72 0 [] f($c1).
% 1.28/1.72 0 [] -g(Z).
% 1.28/1.72 end_of_list.
% 1.28/1.72
% 1.28/1.72 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 1.28/1.72
% 1.28/1.72 This is a Horn set without equality. The strategy will
% 1.28/1.72 be hyperresolution, with satellites in sos and nuclei
% 1.28/1.72 in usable.
% 1.28/1.72
% 1.28/1.72 dependent: set(hyper_res).
% 1.28/1.72 dependent: clear(order_hyper).
% 1.28/1.72
% 1.28/1.72 ------------> process usable:
% 1.28/1.72 ** KEPT (pick-wt=4): 1 [] -f(A)|g(A).
% 1.28/1.72 ** KEPT (pick-wt=2): 2 [] -g(A).
% 1.28/1.72
% 1.28/1.72 ------------> process sos:
% 1.28/1.72 ** KEPT (pick-wt=2): 3 [] f($c1).
% 1.28/1.72
% 1.28/1.72 ======= end of input processing =======
% 1.28/1.72
% 1.28/1.72 =========== start of search ===========
% 1.28/1.72
% 1.28/1.72 -------- PROOF --------
% 1.28/1.72
% 1.28/1.72 ----> UNIT CONFLICT at 0.00 sec ----> 5 [binary,4.1,2.1] $F.
% 1.28/1.72
% 1.28/1.72 Length of proof is 1. Level of proof is 1.
% 1.28/1.72
% 1.28/1.72 ---------------- PROOF ----------------
% 1.28/1.72 % SZS status Theorem
% 1.28/1.72 % SZS output start Refutation
% See solution above
% 1.28/1.72 ------------ end of proof -------------
% 1.28/1.72
% 1.28/1.72
% 1.28/1.72 Search stopped by max_proofs option.
% 1.28/1.72
% 1.28/1.72
% 1.28/1.72 Search stopped by max_proofs option.
% 1.28/1.72
% 1.28/1.72 ============ end of search ============
% 1.28/1.72
% 1.28/1.72 -------------- statistics -------------
% 1.28/1.72 clauses given 1
% 1.28/1.72 clauses generated 1
% 1.28/1.72 clauses kept 4
% 1.28/1.72 clauses forward subsumed 0
% 1.28/1.72 clauses back subsumed 0
% 1.28/1.72 Kbytes malloced 976
% 1.28/1.72
% 1.28/1.72 ----------- times (seconds) -----------
% 1.28/1.72 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.28/1.72 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.28/1.72 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.28/1.72
% 1.28/1.72 That finishes the proof of the theorem.
% 1.28/1.72
% 1.28/1.72 Process 4191 finished Wed Jul 27 11:20:54 2022
% 1.28/1.72 Otter interrupted
% 1.28/1.72 PROOF FOUND
%------------------------------------------------------------------------------