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