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