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