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