TSTP Solution File: SYN963+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN963+1 : TPTP v8.1.0. Released v3.1.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:25:34 EDT 2022
% Result : Theorem 1.87s 2.07s
% Output : Refutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of clauses : 4 ( 2 unt; 1 nHn; 4 RR)
% Number of literals : 6 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 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 : 3 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(A)
| ~ p(B) ),
file('SYN963+1.p',unknown),
[] ).
cnf(2,plain,
~ p(A),
inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,factor_simp')] ).
cnf(3,axiom,
( p(dollar_c1)
| p(dollar_c2) ),
file('SYN963+1.p',unknown),
[] ).
cnf(4,plain,
$false,
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[3]),2,2]),
[iquote('copy,3,unit_del,2,2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN963+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/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:08:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.87/2.07
% 1.87/2.07 -------- PROOF --------
% 1.87/2.07 ----- Otter 3.3f, August 2004 -----
% 1.87/2.07 The process was started by sandbox on n011.cluster.edu,
% 1.87/2.07 Wed Jul 27 11:08:40 2022
% 1.87/2.07 The command was "./otter". The process ID is 23495.
% 1.87/2.07
% 1.87/2.07 set(prolog_style_variables).
% 1.87/2.07 set(auto).
% 1.87/2.07 dependent: set(auto1).
% 1.87/2.07 dependent: set(process_input).
% 1.87/2.07 dependent: clear(print_kept).
% 1.87/2.07 dependent: clear(print_new_demod).
% 1.87/2.07 dependent: clear(print_back_demod).
% 1.87/2.07 dependent: clear(print_back_sub).
% 1.87/2.07 dependent: set(control_memory).
% 1.87/2.07 dependent: assign(max_mem, 12000).
% 1.87/2.07 dependent: assign(pick_given_ratio, 4).
% 1.87/2.07 dependent: assign(stats_level, 1).
% 1.87/2.07 dependent: assign(max_seconds, 10800).
% 1.87/2.07 clear(print_given).
% 1.87/2.07
% 1.87/2.07 formula_list(usable).
% 1.87/2.07 -((exists X p(X))<-> (exists Y p(Y))).
% 1.87/2.07 end_of_list.
% 1.87/2.07
% 1.87/2.07 -------> usable clausifies to:
% 1.87/2.07
% 1.87/2.07 list(usable).
% 1.87/2.07 0 [] p($c1)|p($c2).
% 1.87/2.07 0 [] -p(X)| -p(Y).
% 1.87/2.07 end_of_list.
% 1.87/2.07
% 1.87/2.07 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.87/2.07
% 1.87/2.07 This is a non-Horn set without equality. The strategy will
% 1.87/2.07 be ordered hyper_res, unit deletion, and factoring, with
% 1.87/2.07 satellites in sos and with nuclei in usable.
% 1.87/2.07
% 1.87/2.07 dependent: set(hyper_res).
% 1.87/2.07 dependent: set(factor).
% 1.87/2.07 dependent: set(unit_deletion).
% 1.87/2.07
% 1.87/2.07 ------------> process usable:
% 1.87/2.07 ** KEPT (pick-wt=2): 2 [copy,1,factor_simp] -p(A).
% 1.87/2.07
% 1.87/2.07 ------------> process sos:
% 1.87/2.07 ** KEPT (pick-wt=0): 4 [copy,3,unit_del,2,2] $F.
% 1.87/2.07
% 1.87/2.07 -----> EMPTY CLAUSE at 0.00 sec ----> 4 [copy,3,unit_del,2,2] $F.
% 1.87/2.07
% 1.87/2.07 Length of proof is 1. Level of proof is 1.
% 1.87/2.07
% 1.87/2.07 ---------------- PROOF ----------------
% 1.87/2.07 % SZS status Theorem
% 1.87/2.07 % SZS output start Refutation
% See solution above
% 1.87/2.07 ------------ end of proof -------------
% 1.87/2.07
% 1.87/2.07
% 1.87/2.07 Search stopped by max_proofs option.
% 1.87/2.07
% 1.87/2.07
% 1.87/2.07 Search stopped by max_proofs option.
% 1.87/2.07
% 1.87/2.07 ============ end of search ============
% 1.87/2.07
% 1.87/2.07 -------------- statistics -------------
% 1.87/2.07 clauses given 0
% 1.87/2.07 clauses generated 0
% 1.87/2.07 clauses kept 1
% 1.87/2.07 clauses forward subsumed 0
% 1.87/2.07 clauses back subsumed 0
% 1.87/2.07 Kbytes malloced 976
% 1.87/2.07
% 1.87/2.07 ----------- times (seconds) -----------
% 1.87/2.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.87/2.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.87/2.07 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.87/2.07
% 1.87/2.07 That finishes the proof of the theorem.
% 1.87/2.07
% 1.87/2.07 Process 23495 finished Wed Jul 27 11:08:42 2022
% 1.87/2.07 Otter interrupted
% 1.87/2.07 PROOF FOUND
%------------------------------------------------------------------------------