%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:12 EDT 2022
% Result : Theorem 0.89s 1.13s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU257+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n004.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 : 600
% 0.12/0.33 % DateTime : Mon Jun 20 04:32:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n004.cluster.edu,
% 0.12/0.34 Mon Jun 20 04:32:38 2022
% 0.12/0.34 The command was "./sos". The process ID is 32243.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 formula_list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=7.
% 0.12/0.34
% 0.12/0.34 This is a Horn set with equality. The strategy will be
% 0.12/0.34 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.34 sos and nonpositive clauses in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(knuth_bendix).
% 0.12/0.34 dependent: set(para_from).
% 0.12/0.34 dependent: set(para_into).
% 0.12/0.34 dependent: clear(para_from_right).
% 0.12/0.34 dependent: clear(para_into_right).
% 0.12/0.34 dependent: set(para_from_vars).
% 0.12/0.34 dependent: set(eq_units_both_ways).
% 0.12/0.34 dependent: set(dynamic_demod_all).
% 0.12/0.34 dependent: set(dynamic_demod).
% 0.12/0.34 dependent: set(order_eq).
% 0.12/0.34 dependent: set(back_demod).
% 0.12/0.34 dependent: set(lrpo).
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: clear(order_hyper).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.12/0.34 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 14
% 0.12/0.38 number of clauses initially in problem: 20
% 0.12/0.38 percentage of clauses intially in UL: 70
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 13
% 0.12/0.38 distinct predicate count: 8
% 0.12/0.38 distinct function count: 3
% 0.12/0.38 distinct constant count: 2
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.89/1.13
% 0.89/1.13 -------- PROOF --------
% 0.89/1.13 % SZS status Theorem
% 0.89/1.13 % SZS output start Refutation
% 0.89/1.13
% 0.89/1.13 Model 3 (0.00 seconds, 0 Inserts)
% 0.89/1.13
% 0.89/1.13 Stopped by limit on number of solutions
% 0.89/1.13
% 0.89/1.13 Model 4 [ 1 0 647 ] (0.00 seconds, 8946 Inserts)
% 0.89/1.13
% 0.89/1.13 Stopped by limit on insertions
% 0.89/1.13
% 0.89/1.13 Model 5 [ 1 1 345 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.13
% 0.89/1.13 Model 6 [ 1 1 275 ] (0.00 seconds, 9564 Inserts)
% 0.89/1.13
% 0.89/1.13 Model 7 [ 1 0 346 ] (0.00 seconds, 245625 Inserts)
% 0.89/1.13
% 0.89/1.13 Stopped by limit on insertions
% 0.89/1.13
% 0.89/1.13 Model 8 [ 1 1 1380 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.13
% 0.89/1.13 Stopped by limit on insertions
% 0.89/1.13
% 0.89/1.13 Model 9 [ 2 0 121 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.13
% 0.89/1.13 Model 10 [ 1 1 716 ] (0.00 seconds, 179705 Inserts)
% 0.89/1.13
% 0.89/1.13 Stopped by limit on insertions
% 0.89/1.13
% 0.89/1.13 Model 11 [ 2 0 716 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.13
% 0.89/1.13 Stopped by limit on insertions
% 0.89/1.13
% 0.89/1.13 Model 12 [ 2 1 824 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.13
% 0.89/1.13 Stopped by limit on insertions
% 0.89/1.13
% 0.89/1.13 Model 13 [ 12 1 282 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.13
% 0.89/1.13 ----> UNIT CONFLICT at 0.76 sec ----> 51 [binary,50.1,15.1] {+} $F.
% 0.89/1.13
% 0.89/1.13 Length of proof is 12. Level of proof is 3.
% 0.89/1.13
% 0.89/1.13 ---------------- PROOF ----------------
% 0.89/1.13 % SZS status Theorem
% 0.89/1.13 % SZS output start Refutation
% 0.89/1.13
% 0.89/1.13 1 [] {+} -relation(A)| -well_ordering(A)|reflexive(A).
% 0.89/1.13 2 [] {+} -relation(A)| -well_ordering(A)|transitive(A).
% 0.89/1.13 3 [] {+} -relation(A)| -well_ordering(A)|antisymmetric(A).
% 0.89/1.13 4 [] {+} -relation(A)| -well_ordering(A)|connected(A).
% 0.89/1.13 5 [] {+} -relation(A)| -well_ordering(A)|well_founded_relation(A).
% 0.89/1.13 6 [] {+} -relation(A)|well_ordering(A)| -reflexive(A)| -transitive(A)| -antisymmetric(A)| -connected(A)| -well_founded_relation(A).
% 0.89/1.13 9 [] {+} -relation(A)|relation(relation_restriction(A,B)).
% 0.89/1.13 10 [] {+} -relation(A)| -reflexive(A)|reflexive(relation_restriction(A,B)).
% 0.89/1.13 11 [] {+} -relation(A)| -connected(A)|connected(relation_restriction(A,B)).
% 0.89/1.13 12 [] {+} -relation(A)| -transitive(A)|transitive(relation_restriction(A,B)).
% 0.89/1.13 13 [] {+} -relation(A)| -antisymmetric(A)|antisymmetric(relation_restriction(A,B)).
% 0.89/1.13 14 [] {+} -relation(A)| -well_founded_relation(A)|well_founded_relation(relation_restriction(A,B)).
% 0.89/1.13 15 [] {+} -well_ordering(relation_restriction($c1,$c2)).
% 0.89/1.13 19 [] {+} relation($c1).
% 0.89/1.13 20 [] {+} well_ordering($c1).
% 0.89/1.13 23 [hyper,19,9] {+} relation(relation_restriction($c1,A)).
% 0.89/1.13 26 [hyper,20,5,19] {+} well_founded_relation($c1).
% 0.89/1.13 27 [hyper,20,4,19] {+} connected($c1).
% 0.89/1.13 28 [hyper,20,3,19] {+} antisymmetric($c1).
% 0.89/1.13 29 [hyper,20,2,19] {+} transitive($c1).
% 0.89/1.13 30 [hyper,20,1,19] {+} reflexive($c1).
% 0.89/1.13 31 [hyper,26,14,19] {+} well_founded_relation(relation_restriction($c1,A)).
% 0.89/1.13 32 [hyper,27,11,19] {+} connected(relation_restriction($c1,A)).
% 0.89/1.13 34 [hyper,29,12,19] {+} transitive(relation_restriction($c1,A)).
% 0.89/1.13 35 [hyper,28,13,19] {+} antisymmetric(relation_restriction($c1,A)).
% 0.89/1.13 36 [hyper,30,10,19] {+} reflexive(relation_restriction($c1,A)).
% 0.89/1.13 50 [hyper,31,6,23,36,34,35,32] {-} well_ordering(relation_restriction($c1,A)).
% 0.89/1.13 51 [binary,50.1,15.1] {+} $F.
% 0.89/1.13
% 0.89/1.13 % SZS output end Refutation
% 0.89/1.13 ------------ end of proof -------------
% 0.89/1.13
% 0.89/1.13
% 0.89/1.13 Search stopped by max_proofs option.
% 0.89/1.13
% 0.89/1.13
% 0.89/1.13 Search stopped by max_proofs option.
% 0.89/1.13
% 0.89/1.13 ============ end of search ============
% 0.89/1.13
% 0.89/1.13 ----------- soft-scott stats ----------
% 0.89/1.13
% 0.89/1.13 true clauses given 5 (29.4%)
% 0.89/1.13 false clauses given 12
% 0.89/1.13
% 0.89/1.13 FALSE TRUE
% 0.89/1.13 6 3 2
% 0.89/1.13 9 0 2
% 0.89/1.13 13 0 3
% 0.89/1.13 19 0 1
% 0.89/1.13 tot: 3 8 (72.7% true)
% 0.89/1.13
% 0.89/1.13
% 0.89/1.13 Model 13 [ 12 1 282 ] (0.00 seconds, 250000 Inserts)
% 0.89/1.13
% 0.89/1.13 That finishes the proof of the theorem.
% 0.89/1.13
% 0.89/1.13 Process 32243 finished Mon Jun 20 04:32:39 2022
%------------------------------------------------------------------------------