%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN915+1 : TPTP v8.1.0. Released v3.1.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:25:28 EDT 2022
% Result : Theorem 1.92s 2.09s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 1
% Syntax : Number of clauses : 2 ( 2 unt; 0 nHn; 2 RR)
% Number of literals : 2 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 2 ( 1 usr; 2 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ dollar_T,
file('SYN915+1.p',unknown),
[] ).
cnf(2,plain,
$false,
inference(propositional,[status(thm)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,propositional')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN915+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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:13:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.09
% 1.92/2.09 -------- PROOF --------
% 1.92/2.09 ----- Otter 3.3f, August 2004 -----
% 1.92/2.09 The process was started by sandbox on n015.cluster.edu,
% 1.92/2.09 Wed Jul 27 11:13:57 2022
% 1.92/2.09 The command was "./otter". The process ID is 14973.
% 1.92/2.09
% 1.92/2.09 set(prolog_style_variables).
% 1.92/2.09 set(auto).
% 1.92/2.09 dependent: set(auto1).
% 1.92/2.09 dependent: set(process_input).
% 1.92/2.09 dependent: clear(print_kept).
% 1.92/2.09 dependent: clear(print_new_demod).
% 1.92/2.09 dependent: clear(print_back_demod).
% 1.92/2.09 dependent: clear(print_back_sub).
% 1.92/2.09 dependent: set(control_memory).
% 1.92/2.09 dependent: assign(max_mem, 12000).
% 1.92/2.09 dependent: assign(pick_given_ratio, 4).
% 1.92/2.09 dependent: assign(stats_level, 1).
% 1.92/2.09 dependent: assign(max_seconds, 10800).
% 1.92/2.09 clear(print_given).
% 1.92/2.09
% 1.92/2.09 formula_list(usable).
% 1.92/2.09 -$T.
% 1.92/2.09 end_of_list.
% 1.92/2.09
% 1.92/2.09 -------> usable clausifies to:
% 1.92/2.09
% 1.92/2.09 list(usable).
% 1.92/2.09 0 [] -$T.
% 1.92/2.09 end_of_list.
% 1.92/2.09
% 1.92/2.09 SCAN INPUT: prop=1, horn=1, equality=0, symmetry=0, max_lits=1.
% 1.92/2.09
% 1.92/2.09 The clause set is propositional; the strategy will be
% 1.92/2.09 ordered hyperresolution with the propositional
% 1.92/2.09 optimizations, with satellites in sos and nuclei in usable.
% 1.92/2.09
% 1.92/2.09 dependent: set(hyper_res).
% 1.92/2.09 dependent: set(propositional).
% 1.92/2.09 dependent: set(sort_literals).
% 1.92/2.09
% 1.92/2.09 ------------> process usable:
% 1.92/2.09 ** KEPT (pick-wt=0): 2 [copy,1,propositional] $F.
% 1.92/2.09
% 1.92/2.09 -----> EMPTY CLAUSE at 0.00 sec ----> 2 [copy,1,propositional] $F.
% 1.92/2.09
% 1.92/2.09 Length of proof is 0. Level of proof is 0.
% 1.92/2.09
% 1.92/2.09 ---------------- PROOF ----------------
% 1.92/2.09 % SZS status Theorem
% 1.92/2.09 % SZS output start Refutation
% See solution above
% 1.92/2.09 ------------ end of proof -------------
% 1.92/2.09
% 1.92/2.09
% 1.92/2.09 Search stopped by max_proofs option.
% 1.92/2.09
% 1.92/2.09
% 1.92/2.09 Search stopped by max_proofs option.
% 1.92/2.09
% 1.92/2.09 ============ end of search ============
% 1.92/2.09
% 1.92/2.09 -------------- statistics -------------
% 1.92/2.09 clauses given 0
% 1.92/2.09 clauses generated 0
% 1.92/2.09 clauses kept 0
% 1.92/2.09 clauses forward subsumed 0
% 1.92/2.09 clauses back subsumed 0
% 1.92/2.09 Kbytes malloced 976
% 1.92/2.09
% 1.92/2.09 ----------- times (seconds) -----------
% 1.92/2.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.09 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.92/2.09
% 1.92/2.09 That finishes the proof of the theorem.
% 1.92/2.09
% 1.92/2.09 Process 14973 finished Wed Jul 27 11:13:58 2022
% 1.92/2.09 Otter interrupted
% 1.92/2.09 PROOF FOUND
%------------------------------------------------------------------------------