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