%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-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 : 600s
% DateTime : Tue Jul 19 14:28:14 EDT 2022
% Result : Theorem 0.19s 0.59s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU261+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jun 19 16:31:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n016.cluster.edu,
% 0.13/0.36 Sun Jun 19 16:31:39 2022
% 0.13/0.36 The command was "./sos". The process ID is 31567.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=7.
% 0.13/0.36
% 0.13/0.36 This is a Horn set without equality. The strategy will
% 0.13/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36 in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 12
% 0.19/0.40 number of clauses initially in problem: 20
% 0.19/0.40 percentage of clauses intially in UL: 60
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 76
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 13
% 0.19/0.40 distinct predicate count: 9
% 0.19/0.40 distinct function count: 0
% 0.19/0.40 distinct constant count: 4
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.19/0.59
% 0.19/0.59 -------- PROOF --------
% 0.19/0.59 % SZS status Theorem
% 0.19/0.59 % SZS output start Refutation
% 0.19/0.59
% 0.19/0.59 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.59
% 0.19/0.59 Stopped by limit on number of solutions
% 0.19/0.59
% 0.19/0.59 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.59
% 0.19/0.59 Stopped by limit on number of solutions
% 0.19/0.59
% 0.19/0.59 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.59
% 0.19/0.59 Stopped by limit on number of solutions
% 0.19/0.59
% 0.19/0.59 Model 6 (0.00 seconds, 0 Inserts)
% 0.19/0.59
% 0.19/0.59 Stopped by limit on number of solutions
% 0.19/0.59
% 0.19/0.59 Model 7 (0.00 seconds, 0 Inserts)
% 0.19/0.59
% 0.19/0.59 Stopped by limit on number of solutions
% 0.19/0.59
% 0.19/0.59 Stopped by limit on insertions
% 0.19/0.59
% 0.19/0.59 Model 8 [ 2 0 65 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.59
% 0.19/0.59 Model 9 (0.00 seconds, 250000 Inserts)
% 0.19/0.59
% 0.19/0.59 Stopped by limit on number of solutions
% 0.19/0.59
% 0.19/0.59 Stopped by limit on insertions
% 0.19/0.59
% 0.19/0.59 Model 10 [ 1 1 115 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.59
% 0.19/0.59 Stopped by limit on insertions
% 0.19/0.59
% 0.19/0.59 Model 11 [ 1 0 374 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.59
% 0.19/0.59 ----> UNIT CONFLICT at 0.20 sec ----> 32 [binary,31.1,12.1] {-} $F.
% 0.19/0.59
% 0.19/0.59 Length of proof is 11. Level of proof is 3.
% 0.19/0.59
% 0.19/0.59 ---------------- PROOF ----------------
% 0.19/0.59 % SZS status Theorem
% 0.19/0.59 % SZS output start Refutation
% 0.19/0.59
% 0.19/0.59 1 [] {+} -relation(A)| -well_ordering(A)|reflexive(A).
% 0.19/0.59 2 [] {+} -relation(A)| -well_ordering(A)|transitive(A).
% 0.19/0.59 3 [] {+} -relation(A)| -well_ordering(A)|antisymmetric(A).
% 0.19/0.59 4 [] {+} -relation(A)| -well_ordering(A)|connected(A).
% 0.19/0.59 5 [] {+} -relation(A)| -well_ordering(A)|well_founded_relation(A).
% 0.19/0.59 6 [] {+} -relation(A)|well_ordering(A)| -reflexive(A)| -transitive(A)| -antisymmetric(A)| -connected(A)| -well_founded_relation(A).
% 0.19/0.59 7 [] {+} -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -reflexive(A)|reflexive(B).
% 0.19/0.59 8 [] {+} -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -transitive(A)|transitive(B).
% 0.19/0.59 9 [] {+} -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -connected(A)|connected(B).
% 0.19/0.59 10 [] {+} -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -antisymmetric(A)|antisymmetric(B).
% 0.19/0.59 11 [] {+} -relation(A)| -relation(B)| -relation(C)| -function(C)| -relation_isomorphism(A,B,C)| -well_founded_relation(A)|well_founded_relation(B).
% 0.19/0.59 12 [] {+} -well_ordering($c3).
% 0.19/0.59 15 [] {+} relation($c4).
% 0.19/0.59 16 [] {+} relation($c3).
% 0.19/0.59 17 [] {+} relation($c2).
% 0.19/0.59 18 [] {+} function($c2).
% 0.19/0.59 19 [] {+} well_ordering($c4).
% 0.19/0.59 20 [] {+} relation_isomorphism($c4,$c3,$c2).
% 0.19/0.59 21 [hyper,19,5,15] {+} well_founded_relation($c4).
% 0.19/0.59 22 [hyper,19,4,15] {+} connected($c4).
% 0.19/0.59 23 [hyper,19,3,15] {+} antisymmetric($c4).
% 0.19/0.59 24 [hyper,19,2,15] {+} transitive($c4).
% 0.19/0.59 25 [hyper,19,1,15] {+} reflexive($c4).
% 0.19/0.59 26 [hyper,21,11,15,16,17,18,20] {+} well_founded_relation($c3).
% 0.19/0.59 27 [hyper,22,9,15,16,17,18,20] {+} connected($c3).
% 0.19/0.59 28 [hyper,23,10,15,16,17,18,20] {+} antisymmetric($c3).
% 0.19/0.59 29 [hyper,24,8,15,16,17,18,20] {+} transitive($c3).
% 0.19/0.59 30 [hyper,25,7,15,16,17,18,20] {+} reflexive($c3).
% 0.19/0.59 31 [hyper,29,6,16,30,28,27,26] {-} well_ordering($c3).
% 0.19/0.59 32 [binary,31.1,12.1] {-} $F.
% 0.19/0.59
% 0.19/0.59 % SZS output end Refutation
% 0.19/0.59 ------------ end of proof -------------
% 0.19/0.59
% 0.19/0.59
% 0.19/0.59 Search stopped by max_proofs option.
% 0.19/0.59
% 0.19/0.59
% 0.19/0.59 Search stopped by max_proofs option.
% 0.19/0.59
% 0.19/0.59 ============ end of search ============
% 0.19/0.59
% 0.19/0.59 ----------- soft-scott stats ----------
% 0.19/0.59
% 0.19/0.59 true clauses given 8 (44.4%)
% 0.19/0.59 false clauses given 10
% 0.19/0.59
% 0.19/0.59 FALSE TRUE
% 0.19/0.59 tot: 0 0 (-nan% true)
% 0.19/0.59
% 0.19/0.59
% 0.19/0.59 Model 11 [ 1 0 374 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.59
% 0.19/0.59 That finishes the proof of the theorem.
% 0.19/0.59
% 0.19/0.59 Process 31567 finished Sun Jun 19 16:31:39 2022
%------------------------------------------------------------------------------