TSTP Solution File: SEU295+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU295+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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 : 600s
% DateTime : Tue Jul 19 14:28:31 EDT 2022
% Result : Unknown 1.13s 1.34s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU295+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 04:19:17 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.39/0.58 ----- Otter 3.2, August 2001 -----
% 0.39/0.58 The process was started by sandbox2 on n024.cluster.edu,
% 0.39/0.58 Sun Jun 19 04:19:17 2022
% 0.39/0.58 The command was "./sos". The process ID is 13319.
% 0.39/0.58
% 0.39/0.58 set(prolog_style_variables).
% 0.39/0.58 set(auto).
% 0.39/0.58 dependent: set(auto1).
% 0.39/0.58 dependent: set(process_input).
% 0.39/0.58 dependent: clear(print_kept).
% 0.39/0.58 dependent: clear(print_new_demod).
% 0.39/0.58 dependent: clear(print_back_demod).
% 0.39/0.58 dependent: clear(print_back_sub).
% 0.39/0.58 dependent: set(control_memory).
% 0.39/0.58 dependent: assign(max_mem, 12000).
% 0.39/0.58 dependent: assign(pick_given_ratio, 4).
% 0.39/0.58 dependent: assign(stats_level, 1).
% 0.39/0.58 dependent: assign(pick_semantic_ratio, 3).
% 0.39/0.58 dependent: assign(sos_limit, 5000).
% 0.39/0.58 dependent: assign(max_weight, 60).
% 0.39/0.58 clear(print_given).
% 0.39/0.58
% 0.39/0.58 formula_list(usable).
% 0.39/0.58
% 0.39/0.58 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=12.
% 0.39/0.58
% 0.39/0.58 This ia a non-Horn set with equality. The strategy will be
% 0.39/0.58 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.39/0.58 unit deletion, with positive clauses in sos and nonpositive
% 0.39/0.58 clauses in usable.
% 0.39/0.58
% 0.39/0.58 dependent: set(knuth_bendix).
% 0.39/0.58 dependent: set(para_from).
% 0.39/0.58 dependent: set(para_into).
% 0.39/0.58 dependent: clear(para_from_right).
% 0.39/0.58 dependent: clear(para_into_right).
% 0.39/0.58 dependent: set(para_from_vars).
% 0.39/0.58 dependent: set(eq_units_both_ways).
% 0.39/0.58 dependent: set(dynamic_demod_all).
% 0.39/0.58 dependent: set(dynamic_demod).
% 0.39/0.58 dependent: set(order_eq).
% 0.39/0.58 dependent: set(back_demod).
% 0.39/0.58 dependent: set(lrpo).
% 0.39/0.58 dependent: set(hyper_res).
% 0.39/0.58 dependent: set(unit_deletion).
% 0.39/0.58 dependent: set(factor).
% 0.39/0.58
% 0.39/0.58 There is a clause for symmetry of equality, so it is
% 0.39/0.58 assumed that equality is fully axiomatized; therefore,
% 0.39/0.58 paramodulation is disabled.
% 0.39/0.58
% 0.39/0.58 dependent: clear(para_from).
% 0.39/0.58 dependent: clear(para_into).
% 0.39/0.58
% 0.39/0.58 ------------> process usable:
% 0.39/0.58 Following clause subsumed by 8 during input processing: 0 [] {-} -empty(A)| -ordinal(A)|epsilon_transitive(A).
% 0.39/0.58 Following clause subsumed by 9 during input processing: 0 [] {-} -empty(A)| -ordinal(A)|epsilon_connected(A).
% 0.39/0.58 Following clause subsumed by 8 during input processing: 0 [] {-} -ordinal(A)|epsilon_transitive(A).
% 0.39/0.58 Following clause subsumed by 9 during input processing: 0 [] {-} -ordinal(A)|epsilon_connected(A).
% 0.39/0.58 Following clause subsumed by 15 during input processing: 0 [] {-} ordinal(A)| -epsilon_transitive(A)| -epsilon_connected(A).
% 0.39/0.58 Following clause subsumed by 317 during input processing: 0 [] {-} -relation(A)| -relation_empty_yielding(A)|relation(relation_dom_restriction(A,B)).
% 0.39/0.58 Following clause subsumed by 312 during input processing: 0 [] {-} -relation(A)| -function(A)| -relation(B)| -function(B)|relation(relation_composition(A,B)).
% 0.39/0.58 Following clause subsumed by 310 during input processing: 0 [] {-} -relation(A)| -function(A)| -one_to_one(A)|relation(relation_inverse(A)).
% 0.39/0.58 Following clause subsumed by 329 during input processing: 0 [] {-} -ordinal(A)| -empty(succ(A)).
% 0.39/0.58 Following clause subsumed by 317 during input processing: 0 [] {-} -relation(A)| -function(A)|relation(relation_dom_restriction(A,B)).
% 0.39/0.58 Following clause subsumed by 319 during input processing: 0 [] {-} -relation(A)| -function(A)|relation(relation_rng_restriction(B,A)).
% 0.39/0.58 Following clause subsumed by 26 during input processing: 0 [] {-} subset(A,singleton(B))|A!=singleton(B).
% 0.39/0.58 Following clause subsumed by 393 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 0.39/0.58 Following clause subsumed by 394 during input processing: 0 [] {-} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 0.39/0.58 Following clause subsumed by 395 during input processing: 0 [] {-} in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 0.39/0.58 Following clause subsumed by 148 during input processing: 0 [] {-} -element(A,B)|empty(B)|in(A,B).
% 0.39/0.58 Following clause subsumed by 376 during input processing: 0 [] {-} set_difference(A,B)!=empty_set|subset(A,B).
% 0.39/0.58 Following clause subsumed by 377 during input processing: 0 [] {-} set_difference(A,B)=empty_set| -subset(A,B).
% 0.39/0.58 Following clause subsumed by 372 during input processing: 0 [] {-} -subset(singleton(A),B)|in(A,B).
% 1.13/1.32 Following clause subsumed by 373 during input processing: 0 [] {-} subset(singleton(A),B)| -in(A,B).
% 1.13/1.32 Following clause subsumed by 390 during input processing: 0 [] {-} -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 1.13/1.32 Following clause subsumed by 391 during input processing: 0 [] {-} subset(A,singleton(B))|A!=empty_set.
% 1.13/1.32 Following clause subsumed by 26 during input processing: 0 [] {-} subset(A,singleton(B))|A!=singleton(B).
% 1.13/1.32 Following clause subsumed by 365 during input processing: 0 [] {-} -in(A,B)|set_union2(singleton(A),B)=B.
% 1.13/1.32 Following clause subsumed by 1199 during input processing: 0 [] {-} -relation(A)| -function(A)| -in(ordered_pair(B,C),A)|in(B,relation_dom(A)).
% 1.13/1.32 Following clause subsumed by 191 during input processing: 0 [] {-} -relation(A)| -function(A)|in(ordered_pair(B,C),A)| -in(B,relation_dom(A))|C!=apply(A,B).
% 1.13/1.32 Following clause subsumed by 392 during input processing: 0 [] {-} -in(A,B)|subset(A,union(B)).
% 1.13/1.32 Following clause subsumed by 1184 during input processing: 0 [] {-} -function(A)| -quasi_total(A,B,C)| -relation_of2_as_subset(A,B,C)| -subset(C,D)|C=empty_set|relation_of2_as_subset(A,B,D).
% 1.13/1.32 Following clause subsumed by 1184 during input processing: 0 [] {-} -function(A)| -quasi_total(A,B,C)| -relation_of2_as_subset(A,B,C)| -subset(C,D)|B!=empty_set|relation_of2_as_subset(A,B,D).
% 1.13/1.32 180 back subsumes 177.
% 1.13/1.32 1197 back subsumes 149.
% 1.13/1.32 1233 back subsumes 266.
% 1.13/1.32 1234 back subsumes 267.
% 1.13/1.32 1349 back subsumes 398.
% 1.13/1.32 1350 back subsumes 397.
% 1.13/1.32 1351 back subsumes 399.
% 1.13/1.32 1354 back subsumes 192.
% 1.13/1.32 1374 back subsumes 1373.
% 1.13/1.32 1382 back subsumes 1381.
% 1.13/1.32
% 1.13/1.32 ------------> process sos:
% 1.13/1.32 Following clause subsumed by 2126 during input processing: 0 [] {-} empty(empty_set).
% 1.13/1.32 Following clause subsumed by 2122 during input processing: 0 [] {-} relation(identity_relation(A)).
% 1.13/1.32 Following clause subsumed by 2127 during input processing: 0 [] {-} relation(empty_set).
% 1.13/1.32 Following clause subsumed by 2128 during input processing: 0 [] {-} relation_empty_yielding(empty_set).
% 1.13/1.32 Following clause subsumed by 2126 during input processing: 0 [] {-} empty(empty_set).
% 1.13/1.32 Following clause subsumed by 2126 during input processing: 0 [] {-} empty(empty_set).
% 1.13/1.32 Following clause subsumed by 2127 during input processing: 0 [] {-} relation(empty_set).
% 1.13/1.32 Following clause subsumed by 2087 during input processing: 0 [copy,2087,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 1.13/1.32 Following clause subsumed by 2088 during input processing: 0 [copy,2088,flip.1] {-} set_union2(A,B)=set_union2(B,A).
% 1.13/1.32 2202 back subsumes 1892.
% 1.13/1.32 2202 back subsumes 1891.
% 1.13/1.32 2202 back subsumes 1493.
% 1.13/1.32 2202 back subsumes 1412.
% 1.13/1.32 2202 back subsumes 1411.
% 1.13/1.32 2202 back subsumes 1397.
% 1.13/1.32 Following clause subsumed by 2203 during input processing: 0 [copy,2203,flip.1] {-} equipotent(A,A).
% 1.13/1.32 Following clause subsumed by 2295 during input processing: 0 [copy,2295,flip.1] {-} A=A.
% 1.13/1.32 2295 back subsumes 1936.
% 1.13/1.32 2295 back subsumes 1931.
% 1.13/1.32 2295 back subsumes 1893.
% 1.13/1.32 2295 back subsumes 1890.
% 1.13/1.32 2295 back subsumes 1490.
% 1.13/1.32 2295 back subsumes 1489.
% 1.13/1.32 2295 back subsumes 1452.
% 1.13/1.32 2295 back subsumes 1423.
% 1.13/1.32 2295 back subsumes 1417.
% 1.13/1.32 2295 back subsumes 1410.
% 1.13/1.32 2295 back subsumes 1400.
% 1.13/1.32 2295 back subsumes 1399.
% 1.13/1.32 2295 back subsumes 1391.
% 1.13/1.32 2295 back subsumes 1371.
% 1.13/1.32 Following clause subsumed by 2296 during input processing: 0 [copy,2296,flip.1] {-} set_difference(A,set_difference(A,B))=set_difference(B,set_difference(B,A)).
% 1.13/1.32 2412 back subsumes 144.
% 1.13/1.32 2414 back subsumes 145.
% 1.13/1.32 2563 back subsumes 2300.
% 1.13/1.32 2564 back subsumes 2301.
% 1.13/1.32 2565 back subsumes 2302.
% 1.13/1.32 2566 back subsumes 2303.
% 1.13/1.32 2567 back subsumes 2304.
% 1.13/1.32 2568 back subsumes 2305.
% 1.13/1.32 2569 back subsumes 2306.
% 1.13/1.32 2570 back subsumes 2307.
% 1.13/1.32 2571 back subsumes 2308.
% 1.13/1.32 2572 back subsumes 2309.
% 1.13/1.32 2573 back subsumes 2313.
% 1.13/1.32 2574 back subsumes 2314.
% 1.13/1.32 2575 back subsumes 2317.
% 1.13/1.32 2576 back subsumes 2318.
% 1.13/1.32 2577 back subsumes 2320.
% 1.13/1.32 2578 back subsumes 2321.
% 1.13/1.32 2579 back subsumes 2323.
% 1.13/1.32 2580 back subsumes 2324.
% 1.13/1.32 2581 back subsumes 2326.
% 1.13/1.32 2582 back subsumes 2327.
% 1.13/1.32 2583 back subsumes 2329.
% 1.13/1.32 2584 back subsumes 2330.
% 1.13/1.32 2585 back subsumes 2332.
% 1.13/1.32 2586 back subsumes 2333.
% 1.13/1.32 2587 back subsumes 2335.
% 1.13/1.32 2588 back subsumes 2336.
% 1.13/1.32 2589 back subsumes 2338.
% 1.13/1.32 2590 back subsumes 2339.
% 1.13/1.32
% 1.13/1.32 ======= end of input processing =======
% 1.13/1.34
% 1.13/1.34 SEGMENTATION FAULT!! This is probably caused by a
% 1.13/1.34 bug in Otter. Please send copy of the input file to
% 1.13/1.34 otter@mcs.anl.gov, let us know what version of Otter you are
% 1.13/1.34 using, and send any other info that might be useful.
% 1.13/1.34
% 1.13/1.34
% 1.13/1.34 SEGMENTATION FAULT!! This is probably caused by a
% 1.13/1.34 bug in Otter. Please send copy of the input file to
% 1.13/1.34 otter@mcs.anl.gov, let us know what version of Otter you are
% 1.13/1.34 using, and send any other info that might be useful.
% 1.13/1.34
% 1.13/1.34
% 1.13/1.34 The job finished Sun Jun 19 04:19:18 2022
%------------------------------------------------------------------------------