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