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