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