TSTP Solution File: SYN058+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN058+1 : TPTP v8.1.0. Released v2.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:26 EDT 2022
% Result : Theorem 1.93s 2.08s
% Output : Refutation 1.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 7 unt; 0 nHn; 8 RR)
% Number of literals : 14 ( 0 equ; 5 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 5 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big_p(A)
| big_q(B) ),
file('SYN058+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ big_q(dollar_c1)
| big_s(dollar_c2) ),
file('SYN058+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ big_s(A)
| ~ big_f(B)
| big_g(B) ),
file('SYN058+1.p',unknown),
[] ).
cnf(7,axiom,
~ big_g(dollar_c3),
file('SYN058+1.p',unknown),
[] ).
cnf(8,axiom,
big_p(dollar_c3),
file('SYN058+1.p',unknown),
[] ).
cnf(9,axiom,
big_f(dollar_c3),
file('SYN058+1.p',unknown),
[] ).
cnf(10,plain,
big_q(A),
inference(hyper,[status(thm)],[8,1]),
[iquote('hyper,8,1')] ).
cnf(11,plain,
big_s(dollar_c2),
inference(hyper,[status(thm)],[10,3]),
[iquote('hyper,10,3')] ).
cnf(12,plain,
big_g(dollar_c3),
inference(hyper,[status(thm)],[11,6,9]),
[iquote('hyper,11,6,9')] ).
cnf(13,plain,
$false,
inference(binary,[status(thm)],[12,7]),
[iquote('binary,12.1,7.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN058+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n020.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 11:24:38 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.93/2.08 ----- Otter 3.3f, August 2004 -----
% 1.93/2.08 The process was started by sandbox on n020.cluster.edu,
% 1.93/2.08 Wed Jul 27 11:24:38 2022
% 1.93/2.08 The command was "./otter". The process ID is 16024.
% 1.93/2.08
% 1.93/2.08 set(prolog_style_variables).
% 1.93/2.08 set(auto).
% 1.93/2.08 dependent: set(auto1).
% 1.93/2.08 dependent: set(process_input).
% 1.93/2.08 dependent: clear(print_kept).
% 1.93/2.08 dependent: clear(print_new_demod).
% 1.93/2.08 dependent: clear(print_back_demod).
% 1.93/2.08 dependent: clear(print_back_sub).
% 1.93/2.08 dependent: set(control_memory).
% 1.93/2.08 dependent: assign(max_mem, 12000).
% 1.93/2.08 dependent: assign(pick_given_ratio, 4).
% 1.93/2.08 dependent: assign(stats_level, 1).
% 1.93/2.08 dependent: assign(max_seconds, 10800).
% 1.93/2.08 clear(print_given).
% 1.93/2.08
% 1.93/2.08 formula_list(usable).
% 1.93/2.08 all X (big_p(X)-> (all Z big_q(Z))).
% 1.93/2.08 (all X (big_q(X)|big_r(X)))-> (exists X1 (big_q(X1)&big_s(X1))).
% 1.93/2.08 (exists X big_s(X))-> (all X1 (big_f(X1)->big_g(X1))).
% 1.93/2.08 -(all X (big_p(X)&big_f(X)->big_g(X))).
% 1.93/2.08 end_of_list.
% 1.93/2.08
% 1.93/2.08 -------> usable clausifies to:
% 1.93/2.08
% 1.93/2.08 list(usable).
% 1.93/2.08 0 [] -big_p(X)|big_q(Z).
% 1.93/2.08 0 [] -big_q($c1)|big_q($c2).
% 1.93/2.08 0 [] -big_q($c1)|big_s($c2).
% 1.93/2.08 0 [] -big_r($c1)|big_q($c2).
% 1.93/2.08 0 [] -big_r($c1)|big_s($c2).
% 1.93/2.08 0 [] -big_s(X)| -big_f(X1)|big_g(X1).
% 1.93/2.08 0 [] big_p($c3).
% 1.93/2.08 0 [] big_f($c3).
% 1.93/2.08 0 [] -big_g($c3).
% 1.93/2.08 end_of_list.
% 1.93/2.08
% 1.93/2.08 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.93/2.08
% 1.93/2.08 This is a Horn set without equality. The strategy will
% 1.93/2.08 be hyperresolution, with satellites in sos and nuclei
% 1.93/2.08 in usable.
% 1.93/2.08
% 1.93/2.08 dependent: set(hyper_res).
% 1.93/2.08 dependent: clear(order_hyper).
% 1.93/2.08
% 1.93/2.08 ------------> process usable:
% 1.93/2.08 ** KEPT (pick-wt=4): 1 [] -big_p(A)|big_q(B).
% 1.93/2.08 ** KEPT (pick-wt=4): 2 [] -big_q($c1)|big_q($c2).
% 1.93/2.08 ** KEPT (pick-wt=4): 3 [] -big_q($c1)|big_s($c2).
% 1.93/2.08 ** KEPT (pick-wt=4): 4 [] -big_r($c1)|big_q($c2).
% 1.93/2.08 ** KEPT (pick-wt=4): 5 [] -big_r($c1)|big_s($c2).
% 1.93/2.08 ** KEPT (pick-wt=6): 6 [] -big_s(A)| -big_f(B)|big_g(B).
% 1.93/2.08 ** KEPT (pick-wt=2): 7 [] -big_g($c3).
% 1.93/2.08
% 1.93/2.08 ------------> process sos:
% 1.93/2.08 ** KEPT (pick-wt=2): 8 [] big_p($c3).
% 1.93/2.08 ** KEPT (pick-wt=2): 9 [] big_f($c3).
% 1.93/2.08
% 1.93/2.08 ======= end of input processing =======
% 1.93/2.08
% 1.93/2.08 =========== start of search ===========
% 1.93/2.08
% 1.93/2.08 -------- PROOF --------
% 1.93/2.08
% 1.93/2.08 ----> UNIT CONFLICT at 0.00 sec ----> 13 [binary,12.1,7.1] $F.
% 1.93/2.08
% 1.93/2.08 Length of proof is 3. Level of proof is 3.
% 1.93/2.08
% 1.93/2.08 ---------------- PROOF ----------------
% 1.93/2.08 % SZS status Theorem
% 1.93/2.08 % SZS output start Refutation
% See solution above
% 1.93/2.08 ------------ end of proof -------------
% 1.93/2.08
% 1.93/2.08
% 1.93/2.08 Search stopped by max_proofs option.
% 1.93/2.08
% 1.93/2.08
% 1.93/2.08 Search stopped by max_proofs option.
% 1.93/2.08
% 1.93/2.08 ============ end of search ============
% 1.93/2.08
% 1.93/2.08 -------------- statistics -------------
% 1.93/2.08 clauses given 4
% 1.93/2.08 clauses generated 3
% 1.93/2.08 clauses kept 12
% 1.93/2.08 clauses forward subsumed 0
% 1.93/2.08 clauses back subsumed 5
% 1.93/2.08 Kbytes malloced 976
% 1.93/2.08
% 1.93/2.08 ----------- times (seconds) -----------
% 1.93/2.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.08 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.08 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.93/2.08
% 1.93/2.08 That finishes the proof of the theorem.
% 1.93/2.08
% 1.93/2.08 Process 16024 finished Wed Jul 27 11:24:40 2022
% 1.93/2.08 Otter interrupted
% 1.93/2.08 PROOF FOUND
%------------------------------------------------------------------------------