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