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