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