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