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