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