TSTP Solution File: SEU303+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU303+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:15:33 EDT 2022
% Result : Theorem 1.66s 1.89s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 11 RR)
% Number of literals : 16 ( 3 equ; 7 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ relation(A)
| ~ function(A)
| ~ finite(B)
| finite(relation_image(A,B)) ),
file('SEU303+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ relation(A)
| relation_image(A,relation_dom(A)) = relation_rng(A) ),
file('SEU303+1.p',unknown),
[] ).
cnf(3,plain,
( ~ relation(A)
| relation_rng(A) = relation_image(A,relation_dom(A)) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[2])]),
[iquote('copy,2,flip.2')] ).
cnf(4,axiom,
~ finite(relation_rng(dollar_c2)),
file('SEU303+1.p',unknown),
[] ).
cnf(8,axiom,
relation(dollar_c2),
file('SEU303+1.p',unknown),
[] ).
cnf(9,axiom,
function(dollar_c2),
file('SEU303+1.p',unknown),
[] ).
cnf(10,axiom,
finite(relation_dom(dollar_c2)),
file('SEU303+1.p',unknown),
[] ).
cnf(14,plain,
relation_rng(dollar_c2) = relation_image(dollar_c2,relation_dom(dollar_c2)),
inference(hyper,[status(thm)],[8,3]),
[iquote('hyper,8,3')] ).
cnf(15,plain,
~ finite(relation_image(dollar_c2,relation_dom(dollar_c2))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[4]),14]),
[iquote('back_demod,4,demod,14')] ).
cnf(16,plain,
finite(relation_image(dollar_c2,relation_dom(dollar_c2))),
inference(hyper,[status(thm)],[10,1,8,9]),
[iquote('hyper,10,1,8,9')] ).
cnf(17,plain,
$false,
inference(binary,[status(thm)],[16,15]),
[iquote('binary,16.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU303+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n016.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:51:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.89 ----- Otter 3.3f, August 2004 -----
% 1.66/1.89 The process was started by sandbox2 on n016.cluster.edu,
% 1.66/1.89 Wed Jul 27 07:51:07 2022
% 1.66/1.89 The command was "./otter". The process ID is 15803.
% 1.66/1.89
% 1.66/1.89 set(prolog_style_variables).
% 1.66/1.89 set(auto).
% 1.66/1.89 dependent: set(auto1).
% 1.66/1.89 dependent: set(process_input).
% 1.66/1.89 dependent: clear(print_kept).
% 1.66/1.89 dependent: clear(print_new_demod).
% 1.66/1.89 dependent: clear(print_back_demod).
% 1.66/1.89 dependent: clear(print_back_sub).
% 1.66/1.89 dependent: set(control_memory).
% 1.66/1.89 dependent: assign(max_mem, 12000).
% 1.66/1.89 dependent: assign(pick_given_ratio, 4).
% 1.66/1.89 dependent: assign(stats_level, 1).
% 1.66/1.89 dependent: assign(max_seconds, 10800).
% 1.66/1.89 clear(print_given).
% 1.66/1.89
% 1.66/1.89 formula_list(usable).
% 1.66/1.89 all A (A=A).
% 1.66/1.89 $T.
% 1.66/1.89 $T.
% 1.66/1.89 $T.
% 1.66/1.89 all A B (relation(A)&function(A)&finite(B)->finite(relation_image(A,B))).
% 1.66/1.89 exists A (relation(A)&function(A)).
% 1.66/1.89 all A (relation(A)->relation_image(A,relation_dom(A))=relation_rng(A)).
% 1.66/1.89 all A B (relation(B)&function(B)-> (finite(A)->finite(relation_image(B,A)))).
% 1.66/1.89 -(all A (relation(A)&function(A)-> (finite(relation_dom(A))->finite(relation_rng(A))))).
% 1.66/1.89 end_of_list.
% 1.66/1.89
% 1.66/1.89 -------> usable clausifies to:
% 1.66/1.89
% 1.66/1.89 list(usable).
% 1.66/1.89 0 [] A=A.
% 1.66/1.89 0 [] $T.
% 1.66/1.89 0 [] $T.
% 1.66/1.89 0 [] $T.
% 1.66/1.89 0 [] -relation(A)| -function(A)| -finite(B)|finite(relation_image(A,B)).
% 1.66/1.89 0 [] relation($c1).
% 1.66/1.89 0 [] function($c1).
% 1.66/1.89 0 [] -relation(A)|relation_image(A,relation_dom(A))=relation_rng(A).
% 1.66/1.89 0 [] -relation(B)| -function(B)| -finite(A)|finite(relation_image(B,A)).
% 1.66/1.89 0 [] relation($c2).
% 1.66/1.89 0 [] function($c2).
% 1.66/1.89 0 [] finite(relation_dom($c2)).
% 1.66/1.89 0 [] -finite(relation_rng($c2)).
% 1.66/1.89 end_of_list.
% 1.66/1.89
% 1.66/1.89 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.66/1.89
% 1.66/1.89 This is a Horn set with equality. The strategy will be
% 1.66/1.89 Knuth-Bendix and hyper_res, with positive clauses in
% 1.66/1.89 sos and nonpositive clauses in usable.
% 1.66/1.89
% 1.66/1.89 dependent: set(knuth_bendix).
% 1.66/1.89 dependent: set(anl_eq).
% 1.66/1.89 dependent: set(para_from).
% 1.66/1.89 dependent: set(para_into).
% 1.66/1.89 dependent: clear(para_from_right).
% 1.66/1.89 dependent: clear(para_into_right).
% 1.66/1.89 dependent: set(para_from_vars).
% 1.66/1.89 dependent: set(eq_units_both_ways).
% 1.66/1.89 dependent: set(dynamic_demod_all).
% 1.66/1.89 dependent: set(dynamic_demod).
% 1.66/1.89 dependent: set(order_eq).
% 1.66/1.89 dependent: set(back_demod).
% 1.66/1.89 dependent: set(lrpo).
% 1.66/1.89 dependent: set(hyper_res).
% 1.66/1.89 dependent: clear(order_hyper).
% 1.66/1.89
% 1.66/1.89 ------------> process usable:
% 1.66/1.89 ** KEPT (pick-wt=10): 1 [] -relation(A)| -function(A)| -finite(B)|finite(relation_image(A,B)).
% 1.66/1.89 ** KEPT (pick-wt=9): 3 [copy,2,flip.2] -relation(A)|relation_rng(A)=relation_image(A,relation_dom(A)).
% 1.66/1.89 Following clause subsumed by 1 during input processing: 0 [] -relation(A)| -function(A)| -finite(B)|finite(relation_image(A,B)).
% 1.66/1.89 ** KEPT (pick-wt=3): 4 [] -finite(relation_rng($c2)).
% 1.66/1.89
% 1.66/1.89 ------------> process sos:
% 1.66/1.89 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.66/1.89 ** KEPT (pick-wt=2): 6 [] relation($c1).
% 1.66/1.89 ** KEPT (pick-wt=2): 7 [] function($c1).
% 1.66/1.89 ** KEPT (pick-wt=2): 8 [] relation($c2).
% 1.66/1.89 ** KEPT (pick-wt=2): 9 [] function($c2).
% 1.66/1.89 ** KEPT (pick-wt=3): 10 [] finite(relation_dom($c2)).
% 1.66/1.89 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.66/1.89
% 1.66/1.89 ======= end of input processing =======
% 1.66/1.89
% 1.66/1.89 =========== start of search ===========
% 1.66/1.89
% 1.66/1.89 -------- PROOF --------
% 1.66/1.89
% 1.66/1.89 ----> UNIT CONFLICT at 0.00 sec ----> 17 [binary,16.1,15.1] $F.
% 1.66/1.89
% 1.66/1.89 Length of proof is 4. Level of proof is 3.
% 1.66/1.89
% 1.66/1.89 ---------------- PROOF ----------------
% 1.66/1.89 % SZS status Theorem
% 1.66/1.89 % SZS output start Refutation
% See solution above
% 1.66/1.89 ------------ end of proof -------------
% 1.66/1.89
% 1.66/1.89
% 1.66/1.89 Search stopped by max_proofs option.
% 1.66/1.89
% 1.66/1.89
% 1.66/1.89 Search stopped by max_proofs option.
% 1.66/1.89
% 1.66/1.89 ============ end of search ============
% 1.66/1.89
% 1.66/1.89 -------------- statistics -------------
% 1.66/1.89 clauses given 6
% 1.66/1.89 clauses generated 3
% 1.66/1.89 clauses kept 13
% 1.66/1.89 clauses forward subsumed 2
% 1.66/1.89 clauses back subsumed 0
% 1.66/1.89 Kbytes malloced 976
% 1.66/1.89
% 1.66/1.89 ----------- times (seconds) -----------
% 1.66/1.89 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.89 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.66/1.89
% 1.66/1.89 That finishes the proof of the theorem.
% 1.66/1.89
% 1.66/1.89 Process 15803 finished Wed Jul 27 07:51:08 2022
% 1.66/1.89 Otter interrupted
% 1.66/1.89 PROOF FOUND
%------------------------------------------------------------------------------