TSTP Solution File: SEU247+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU247+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:19 EDT 2022
% Result : Theorem 2.01s 2.19s
% Output : Refutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 5 RR)
% Number of literals : 16 ( 10 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
( ~ relation(A)
| relation_dom_restriction(relation_rng_restriction(B,A),C) = relation_rng_restriction(B,relation_dom_restriction(A,C)) ),
file('SEU247+1.p',unknown),
[] ).
cnf(7,plain,
( ~ relation(A)
| relation_rng_restriction(B,relation_dom_restriction(A,C)) = relation_dom_restriction(relation_rng_restriction(B,A),C) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),
[iquote('copy,6,flip.2')] ).
cnf(8,axiom,
( ~ relation(A)
| relation_restriction(A,B) = relation_dom_restriction(relation_rng_restriction(B,A),B) ),
file('SEU247+1.p',unknown),
[] ).
cnf(9,plain,
( ~ relation(A)
| relation_dom_restriction(relation_rng_restriction(B,A),B) = relation_restriction(A,B) ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.2')] ).
cnf(10,axiom,
relation_restriction(dollar_c1,dollar_c2) != relation_rng_restriction(dollar_c2,relation_dom_restriction(dollar_c1,dollar_c2)),
file('SEU247+1.p',unknown),
[] ).
cnf(11,plain,
relation_rng_restriction(dollar_c2,relation_dom_restriction(dollar_c1,dollar_c2)) != relation_restriction(dollar_c1,dollar_c2),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
[iquote('copy,10,flip.1')] ).
cnf(12,axiom,
A = A,
file('SEU247+1.p',unknown),
[] ).
cnf(16,axiom,
relation(dollar_c1),
file('SEU247+1.p',unknown),
[] ).
cnf(18,plain,
relation_dom_restriction(relation_rng_restriction(A,dollar_c1),A) = relation_restriction(dollar_c1,A),
inference(hyper,[status(thm)],[16,9]),
[iquote('hyper,16,9')] ).
cnf(20,plain,
relation_rng_restriction(A,relation_dom_restriction(dollar_c1,B)) = relation_dom_restriction(relation_rng_restriction(A,dollar_c1),B),
inference(hyper,[status(thm)],[16,7]),
[iquote('hyper,16,7')] ).
cnf(26,plain,
relation_restriction(dollar_c1,dollar_c2) != relation_restriction(dollar_c1,dollar_c2),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[11]),20,18]),
[iquote('back_demod,11,demod,20,18')] ).
cnf(27,plain,
$false,
inference(binary,[status(thm)],[26,12]),
[iquote('binary,26.1,12.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU247+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 07:56:45 EDT 2022
% 0.14/0.34 % CPUTime :
% 2.01/2.19 ----- Otter 3.3f, August 2004 -----
% 2.01/2.19 The process was started by sandbox on n025.cluster.edu,
% 2.01/2.19 Wed Jul 27 07:56:45 2022
% 2.01/2.19 The command was "./otter". The process ID is 28752.
% 2.01/2.19
% 2.01/2.19 set(prolog_style_variables).
% 2.01/2.19 set(auto).
% 2.01/2.19 dependent: set(auto1).
% 2.01/2.19 dependent: set(process_input).
% 2.01/2.19 dependent: clear(print_kept).
% 2.01/2.19 dependent: clear(print_new_demod).
% 2.01/2.19 dependent: clear(print_back_demod).
% 2.01/2.19 dependent: clear(print_back_sub).
% 2.01/2.19 dependent: set(control_memory).
% 2.01/2.19 dependent: assign(max_mem, 12000).
% 2.01/2.19 dependent: assign(pick_given_ratio, 4).
% 2.01/2.19 dependent: assign(stats_level, 1).
% 2.01/2.19 dependent: assign(max_seconds, 10800).
% 2.01/2.19 clear(print_given).
% 2.01/2.19
% 2.01/2.19 formula_list(usable).
% 2.01/2.19 all A (A=A).
% 2.01/2.19 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.01/2.19 all A (relation(A)-> (all B (relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B))))).
% 2.01/2.19 all A B (relation(A)->relation(relation_restriction(A,B))).
% 2.01/2.19 $T.
% 2.01/2.19 $T.
% 2.01/2.19 all A B (relation(A)->relation(relation_dom_restriction(A,B))).
% 2.01/2.19 all A B (relation(B)->relation(relation_rng_restriction(A,B))).
% 2.01/2.19 all A B (set_intersection2(A,A)=A).
% 2.01/2.19 all A B C (relation(C)->relation_dom_restriction(relation_rng_restriction(A,C),B)=relation_rng_restriction(A,relation_dom_restriction(C,B))).
% 2.01/2.19 all A B (relation(B)->relation_restriction(B,A)=relation_dom_restriction(relation_rng_restriction(A,B),A)).
% 2.01/2.19 -(all A B (relation(B)->relation_restriction(B,A)=relation_rng_restriction(A,relation_dom_restriction(B,A)))).
% 2.01/2.19 end_of_list.
% 2.01/2.19
% 2.01/2.19 -------> usable clausifies to:
% 2.01/2.19
% 2.01/2.19 list(usable).
% 2.01/2.19 0 [] A=A.
% 2.01/2.19 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.01/2.19 0 [] -relation(A)|relation_restriction(A,B)=set_intersection2(A,cartesian_product2(B,B)).
% 2.01/2.19 0 [] -relation(A)|relation(relation_restriction(A,B)).
% 2.01/2.19 0 [] $T.
% 2.01/2.19 0 [] $T.
% 2.01/2.19 0 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 2.01/2.19 0 [] -relation(B)|relation(relation_rng_restriction(A,B)).
% 2.01/2.19 0 [] set_intersection2(A,A)=A.
% 2.01/2.19 0 [] -relation(C)|relation_dom_restriction(relation_rng_restriction(A,C),B)=relation_rng_restriction(A,relation_dom_restriction(C,B)).
% 2.01/2.19 0 [] -relation(B)|relation_restriction(B,A)=relation_dom_restriction(relation_rng_restriction(A,B),A).
% 2.01/2.19 0 [] relation($c1).
% 2.01/2.19 0 [] relation_restriction($c1,$c2)!=relation_rng_restriction($c2,relation_dom_restriction($c1,$c2)).
% 2.01/2.19 end_of_list.
% 2.01/2.19
% 2.01/2.19 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 2.01/2.19
% 2.01/2.19 This is a Horn set with equality. The strategy will be
% 2.01/2.19 Knuth-Bendix and hyper_res, with positive clauses in
% 2.01/2.19 sos and nonpositive clauses in usable.
% 2.01/2.19
% 2.01/2.19 dependent: set(knuth_bendix).
% 2.01/2.19 dependent: set(anl_eq).
% 2.01/2.19 dependent: set(para_from).
% 2.01/2.19 dependent: set(para_into).
% 2.01/2.19 dependent: clear(para_from_right).
% 2.01/2.19 dependent: clear(para_into_right).
% 2.01/2.19 dependent: set(para_from_vars).
% 2.01/2.19 dependent: set(eq_units_both_ways).
% 2.01/2.19 dependent: set(dynamic_demod_all).
% 2.01/2.19 dependent: set(dynamic_demod).
% 2.01/2.19 dependent: set(order_eq).
% 2.01/2.19 dependent: set(back_demod).
% 2.01/2.19 dependent: set(lrpo).
% 2.01/2.19 dependent: set(hyper_res).
% 2.01/2.19 dependent: clear(order_hyper).
% 2.01/2.19
% 2.01/2.19 ------------> process usable:
% 2.01/2.19 ** KEPT (pick-wt=11): 2 [copy,1,flip.2] -relation(A)|set_intersection2(A,cartesian_product2(B,B))=relation_restriction(A,B).
% 2.01/2.19 ** KEPT (pick-wt=6): 3 [] -relation(A)|relation(relation_restriction(A,B)).
% 2.01/2.19 ** KEPT (pick-wt=6): 4 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 2.01/2.19 ** KEPT (pick-wt=6): 5 [] -relation(A)|relation(relation_rng_restriction(B,A)).
% 2.01/2.19 ** KEPT (pick-wt=13): 7 [copy,6,flip.2] -relation(A)|relation_rng_restriction(B,relation_dom_restriction(A,C))=relation_dom_restriction(relation_rng_restriction(B,A),C).
% 2.01/2.19 ** KEPT (pick-wt=11): 9 [copy,8,flip.2] -relation(A)|relation_dom_restriction(relation_rng_restriction(B,A),B)=relation_restriction(A,B).
% 2.01/2.19 ** KEPT (pick-wt=9): 11 [copy,10,flip.1] relation_rng_restriction($c2,relation_dom_restriction($c1,$c2))!=relation_restriction($c1,$c2).
% 2.01/2.19
% 2.01/2.19 ------------> process sos:
% 2.01/2.19 ** KEPT (pick-wt=3): 12 [] A=A.
% 2.01/2.19 ** KEPT (pick-wt=7): 13 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.01/2.19 ** KEPT (pick-wt=5): 14 [] set_intersection2(A,A)=A.
% 2.01/2.19 ---> New Demodulator: 15 [new_demod,14] set_intersection2(A,A)=A.
% 2.01/2.19 ** KEPT (pick-wt=2): 16 [] relation($c1).
% 2.01/2.19 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A.
% 2.01/2.19 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 2.01/2.19 >>>> Starting back demodulation with 15.
% 2.01/2.19
% 2.01/2.19 ======= end of input processing =======
% 2.01/2.19
% 2.01/2.19 =========== start of search ===========
% 2.01/2.19
% 2.01/2.19 -------- PROOF --------
% 2.01/2.19
% 2.01/2.19 ----> UNIT CONFLICT at 0.00 sec ----> 27 [binary,26.1,12.1] $F.
% 2.01/2.19
% 2.01/2.19 Length of proof is 6. Level of proof is 3.
% 2.01/2.19
% 2.01/2.19 ---------------- PROOF ----------------
% 2.01/2.19 % SZS status Theorem
% 2.01/2.19 % SZS output start Refutation
% See solution above
% 2.01/2.19 ------------ end of proof -------------
% 2.01/2.19
% 2.01/2.19
% 2.01/2.19 Search stopped by max_proofs option.
% 2.01/2.19
% 2.01/2.19
% 2.01/2.19 Search stopped by max_proofs option.
% 2.01/2.19
% 2.01/2.19 ============ end of search ============
% 2.01/2.19
% 2.01/2.19 -------------- statistics -------------
% 2.01/2.19 clauses given 2
% 2.01/2.19 clauses generated 6
% 2.01/2.19 clauses kept 18
% 2.01/2.19 clauses forward subsumed 2
% 2.01/2.19 clauses back subsumed 0
% 2.01/2.19 Kbytes malloced 976
% 2.01/2.19
% 2.01/2.19 ----------- times (seconds) -----------
% 2.01/2.19 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.01/2.19 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.01/2.19 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.01/2.19
% 2.01/2.19 That finishes the proof of the theorem.
% 2.01/2.19
% 2.01/2.19 Process 28752 finished Wed Jul 27 07:56:47 2022
% 2.01/2.19 Otter interrupted
% 2.01/2.19 PROOF FOUND
%------------------------------------------------------------------------------