%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MED001+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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 : Sun Jul 17 21:55:46 EDT 2022
% Result : Theorem 0.72s 0.89s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : MED001+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.11 % Command : sos-script %s
% 0.12/0.32 % Computer : n028.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jul 5 01:47:35 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n028.cluster.edu,
% 0.12/0.34 Tue Jul 5 01:47:35 2022
% 0.12/0.34 The command was "./sos". The process ID is 30990.
% 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=0, equality=0, symmetry=0, max_lits=7.
% 0.12/0.34
% 0.12/0.34 This is a non-Horn set without equality. The strategy
% 0.12/0.34 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.34 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: set(factor).
% 0.12/0.34 dependent: set(unit_deletion).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 68
% 0.18/0.39 number of clauses initially in problem: 73
% 0.18/0.39 percentage of clauses intially in UL: 93
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 31
% 0.18/0.39 distinct predicate count: 15
% 0.18/0.39 distinct function count: 14
% 0.18/0.39 distinct constant count: 2
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 0.72/0.89
% 0.72/0.89 -------- PROOF --------
% 0.72/0.89 % SZS status Theorem
% 0.72/0.89 % SZS output start Refutation
% 0.72/0.89
% 0.72/0.89 Model 3 (0.00 seconds, 0 Inserts)
% 0.72/0.89
% 0.72/0.89 Stopped by limit on number of solutions
% 0.72/0.89
% 0.72/0.89 Model 4 (0.00 seconds, 0 Inserts)
% 0.72/0.89
% 0.72/0.89 Stopped by limit on number of solutions
% 0.72/0.89
% 0.72/0.89 Stopped by limit on insertions
% 0.72/0.89
% 0.72/0.89 Model 5 [ 1 1 994 ] (0.00 seconds, 250000 Inserts)
% 0.72/0.89
% 0.72/0.89 Stopped by limit on insertions
% 0.72/0.89
% 0.72/0.89 Model 6 [ 1 1 621 ] (0.00 seconds, 250000 Inserts)
% 0.72/0.89
% 0.72/0.89 Stopped by limit on insertions
% 0.72/0.89
% 0.72/0.89 Stopped by limit on insertions
% 0.72/0.89
% 0.72/0.89 Model 7 [ 1 1 785 ] (0.00 seconds, 250000 Inserts)
% 0.72/0.89
% 0.72/0.89 Stopped by limit on insertions
% 0.72/0.89
% 0.72/0.89 Model 8 [ 4 0 682 ] (0.00 seconds, 250000 Inserts)
% 0.72/0.89
% 0.72/0.89 ----> UNIT CONFLICT at 0.52 sec ----> 145 [binary,144.1,51.1] {+} $F.
% 0.72/0.89
% 0.72/0.89 Length of proof is 28. Level of proof is 17.
% 0.72/0.89
% 0.72/0.89 ---------------- PROOF ----------------
% 0.72/0.89 % SZS status Theorem
% 0.72/0.89 % SZS output start Refutation
% 0.72/0.89
% 0.72/0.89 5 [] {+} -bcapacityex(A)| -bcapacitysn(A).
% 0.72/0.89 14 [] {+} -gt(A,$f2(A))|bcapacityex(A)|gt(A,B)|bsecretioni(B).
% 0.72/0.89 15 [] {+} -drugsu($f2(A))|bcapacityex(A)|gt(A,B)|bsecretioni(B).
% 0.72/0.89 18 [] {+} -gt(A,$f4(A))| -bcapacitysn(A)| -qilt27(A)|gt(A,$f5(A))|gt(A,B)|conditionnormo(B).
% 0.72/0.89 19 [] {+} -gt(A,$f4(A))| -bcapacitysn(A)| -qilt27(A)| -conditionhyper($f5(A))|gt(A,B)|conditionnormo(B).
% 0.72/0.89 20 [] {+} -bsecretioni($f4(A))| -bcapacitysn(A)| -qilt27(A)|gt(A,$f5(A))|gt(A,B)|conditionnormo(B).
% 0.72/0.89 21 [] {+} -bsecretioni($f4(A))| -bcapacitysn(A)| -qilt27(A)| -conditionhyper($f5(A))|gt(A,B)|conditionnormo(B).
% 0.72/0.89 50 [] {+} -gt(n0,A)|conditionhyper(A).
% 0.72/0.89 51 [] {+} -gt(n0,$c1).
% 0.72/0.89 52 [] {+} -conditionnormo($c1).
% 0.72/0.89 71 [] {+} gt(n0,A)|drugsu(A).
% 0.72/0.89 72 [] {+} bcapacitysn(n0).
% 0.72/0.89 73 [] {+} qilt27(n0).
% 0.72/0.89 76 [hyper,71,15] {-} gt(n0,$f2(A))|bcapacityex(A)|gt(A,B)|bsecretioni(B).
% 0.72/0.89 80 [hyper,76,20,72,73] {-} gt(n0,$f2(A))|bcapacityex(A)|gt(A,$f4(n0))|gt(n0,$f5(n0))|gt(n0,B)|conditionnormo(B).
% 0.72/0.89 83 [hyper,80,52,unit_del,51] {-} gt(n0,$f2(A))|bcapacityex(A)|gt(A,$f4(n0))|gt(n0,$f5(n0)).
% 0.72/0.89 84 [hyper,83,5,72] {-} gt(n0,$f2(n0))|gt(n0,$f4(n0))|gt(n0,$f5(n0)).
% 0.72/0.89 89 [hyper,84,18,72,73,factor_simp] {-} gt(n0,$f2(n0))|gt(n0,$f5(n0))|gt(n0,A)|conditionnormo(A).
% 0.72/0.89 90 [hyper,84,50] {-} gt(n0,$f2(n0))|gt(n0,$f4(n0))|conditionhyper($f5(n0)).
% 0.72/0.89 94 [hyper,90,21,76,72,73] {-} gt(n0,$f2(n0))|gt(n0,$f4(n0))|gt(n0,A)|conditionnormo(A)|gt(n0,$f2(B))|bcapacityex(B)|gt(B,$f4(n0)).
% 0.72/0.89 102 [hyper,89,52,unit_del,51] {-} gt(n0,$f2(n0))|gt(n0,$f5(n0)).
% 0.72/0.89 104 [hyper,102,14] {-} gt(n0,$f5(n0))|bcapacityex(n0)|gt(n0,A)|bsecretioni(A).
% 0.72/0.89 105 [hyper,102,50] {-} gt(n0,$f2(n0))|conditionhyper($f5(n0)).
% 0.72/0.89 107 [hyper,94,52,unit_del,51] {-} gt(n0,$f2(n0))|gt(n0,$f4(n0))|gt(n0,$f2(A))|bcapacityex(A)|gt(A,$f4(n0)).
% 0.72/0.89 108 [factor,107.1.3,factor_simp] {-} gt(n0,$f2(n0))|gt(n0,$f4(n0))|bcapacityex(n0).
% 0.72/0.89 112 [hyper,108,5,72] {-} gt(n0,$f2(n0))|gt(n0,$f4(n0)).
% 0.72/0.89 114 [hyper,104,20,72,73,factor_simp] {+} gt(n0,$f5(n0))|bcapacityex(n0)|gt(n0,$f4(n0))|gt(n0,A)|conditionnormo(A).
% 0.72/0.89 119 [hyper,112,19,72,73,105,factor_simp] {-} gt(n0,$f2(n0))|gt(n0,A)|conditionnormo(A).
% 0.72/0.89 122 [hyper,119,52,unit_del,51] {+} gt(n0,$f2(n0)).
% 0.72/0.89 124 [hyper,122,14] {+} bcapacityex(n0)|gt(n0,A)|bsecretioni(A).
% 0.72/0.89 125 [hyper,114,52,unit_del,51] {+} gt(n0,$f5(n0))|bcapacityex(n0)|gt(n0,$f4(n0)).
% 0.72/0.89 126 [hyper,125,5,72] {+} gt(n0,$f5(n0))|gt(n0,$f4(n0)).
% 0.72/0.89 127 [hyper,126,50] {+} gt(n0,$f4(n0))|conditionhyper($f5(n0)).
% 0.72/0.89 130 [hyper,126,18,72,73,factor_simp] {+} gt(n0,$f5(n0))|gt(n0,A)|conditionnormo(A).
% 0.72/0.89 131 [hyper,127,21,124,72,73,factor_simp] {+} gt(n0,$f4(n0))|gt(n0,A)|conditionnormo(A)|bcapacityex(n0).
% 0.72/0.89 136 [hyper,130,52,unit_del,51] {+} gt(n0,$f5(n0)).
% 0.72/0.89 137 [hyper,136,50] {+} conditionhyper($f5(n0)).
% 0.72/0.89 140 [hyper,131,52,unit_del,51] {+} gt(n0,$f4(n0))|bcapacityex(n0).
% 0.72/0.89 141 [hyper,140,5,72] {+} gt(n0,$f4(n0)).
% 0.72/0.89 143 [hyper,141,19,72,73,137] {-} gt(n0,A)|conditionnormo(A).
% 0.72/0.89 144 [hyper,143,52] {-} gt(n0,$c1).
% 0.72/0.89 145 [binary,144.1,51.1] {+} $F.
% 0.72/0.89
% 0.72/0.89 % SZS output end Refutation
% 0.72/0.89 ------------ end of proof -------------
% 0.72/0.89
% 0.72/0.89
% 0.72/0.89 Search stopped by max_proofs option.
% 0.72/0.89
% 0.72/0.89
% 0.72/0.89 Search stopped by max_proofs option.
% 0.72/0.89
% 0.72/0.89 ============ end of search ============
% 0.72/0.89
% 0.72/0.89 ----------- soft-scott stats ----------
% 0.72/0.89
% 0.72/0.89 true clauses given 22 (44.0%)
% 0.72/0.89 false clauses given 28
% 0.72/0.89
% 0.72/0.89 FALSE TRUE
% 0.72/0.89 tot: 0 0 (-nan% true)
% 0.72/0.89
% 0.72/0.89
% 0.72/0.89 Model 8 [ 4 -9 682 ] (0.00 seconds, 250000 Inserts)
% 0.72/0.89
% 0.72/0.89 That finishes the proof of the theorem.
% 0.72/0.89
% 0.72/0.89 Process 30990 finished Tue Jul 5 01:47:36 2022
%------------------------------------------------------------------------------