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