%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : FLD039-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 : Sat Jul 16 02:27:45 EDT 2022
% Result : Unsatisfiable 4.32s 4.51s
% Output : Refutation 4.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : FLD039-3 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n020.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 6 10:47:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n020.cluster.edu,
% 0.12/0.35 Mon Jun 6 10:47:22 2022
% 0.12/0.35 The command was "./sos". The process ID is 8403.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.43
% 0.18/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.43
% 0.18/0.43 Stopped by limit on number of solutions
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 -------------- Softie stats --------------
% 0.18/0.43
% 0.18/0.43 UPDATE_STOP: 300
% 0.18/0.43 SFINDER_TIME_LIMIT: 2
% 0.18/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.43 number of clauses in intial UL: 48
% 0.18/0.43 number of clauses initially in problem: 52
% 0.18/0.43 percentage of clauses intially in UL: 92
% 0.18/0.43 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.43 percent of all initial clauses that are short: 100
% 0.18/0.43 absolute distinct symbol count: 11
% 0.18/0.43 distinct predicate count: 4
% 0.18/0.43 distinct function count: 4
% 0.18/0.43 distinct constant count: 3
% 0.18/0.43
% 0.18/0.43 ---------- no more Softie stats ----------
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.43
% 0.18/0.43 Stopped by limit on number of solutions
% 0.18/0.43
% 0.18/0.43 =========== start of search ===========
% 4.32/4.51
% 4.32/4.51 -------- PROOF --------
% 4.32/4.51 % SZS status Unsatisfiable
% 4.32/4.51 % SZS output start Refutation
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 3 [ 2 2 147 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Model 4 [ 3 4 23542 ] (0.00 seconds, 196681 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 5 [ 3 2 144 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 6 [ 3 1 770 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 7 [ 6 2 225 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 8 [ 3 1 358 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 9 [ 5 1 139 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 10 [ 3 1 408 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 11 [ 3 2 608 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 12 [ 3 2 365 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 13 [ 3 2 498 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 14 [ 5 2 103 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 15 [ 3 2 323 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 16 [ 3 1 220 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 17 [ 15 1 177 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 18 [ 4 2 423 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 19 [ 17 1 219 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 20 [ 19 1 197 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 21 [ 3 8 62681 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 22 [ 20 1 103 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 23 [ 19 1 140 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 Stopped by limit on insertions
% 4.32/4.51
% 4.32/4.51 Model 24 [ 20 2 150 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 ----> UNIT CONFLICT at 4.13 sec ----> 1643 [binary,1642.1,24.1] {+} $F.
% 4.32/4.51
% 4.32/4.51 Length of proof is 6. Level of proof is 4.
% 4.32/4.51
% 4.32/4.51 ---------------- PROOF ----------------
% 4.32/4.51 % SZS status Unsatisfiable
% 4.32/4.51 % SZS output start Refutation
% 4.32/4.51
% 4.32/4.51 3 [] {+} sum(additive_identity,A,A)| -defined(A).
% 4.32/4.51 19 [] {+} sum(additive_identity,A,B)| -less_or_equal(A,B)| -less_or_equal(B,A).
% 4.32/4.51 21 [] {+} less_or_equal(A,B)|less_or_equal(B,A)| -defined(A)| -defined(B).
% 4.32/4.51 22 [] {+} less_or_equal(A,B)| -less_or_equal(C,D)| -sum(C,E,A)| -sum(D,E,B).
% 4.32/4.51 24 [] {+} -sum(additive_identity,additive_identity,multiplicative_identity).
% 4.32/4.51 44 [factor,21.1.2,factor_simp] {+} less_or_equal(A,A)| -defined(A).
% 4.32/4.51 49 [] {+} defined(additive_identity).
% 4.32/4.51 50 [] {-} defined(multiplicative_identity).
% 4.32/4.51 52 [] {+} sum(additive_identity,multiplicative_identity,additive_identity).
% 4.32/4.51 53 [hyper,49,44] {+} less_or_equal(additive_identity,additive_identity).
% 4.32/4.51 81 [hyper,50,3] {+} sum(additive_identity,multiplicative_identity,multiplicative_identity).
% 4.32/4.51 1634 [hyper,81,22,53,52] {+} less_or_equal(additive_identity,multiplicative_identity).
% 4.32/4.51 1635 [hyper,81,22,53,52] {+} less_or_equal(multiplicative_identity,additive_identity).
% 4.32/4.51 1642 [hyper,1635,19,1634] {-} sum(additive_identity,additive_identity,multiplicative_identity).
% 4.32/4.51 1643 [binary,1642.1,24.1] {+} $F.
% 4.32/4.51
% 4.32/4.51 % SZS output end Refutation
% 4.32/4.51 ------------ end of proof -------------
% 4.32/4.51
% 4.32/4.51
% 4.32/4.51 Search stopped by max_proofs option.
% 4.32/4.51
% 4.32/4.51
% 4.32/4.51 Search stopped by max_proofs option.
% 4.32/4.51
% 4.32/4.51 ============ end of search ============
% 4.32/4.51
% 4.32/4.51 ----------- soft-scott stats ----------
% 4.32/4.51
% 4.32/4.51 true clauses given 5 (16.7%)
% 4.32/4.51 false clauses given 25
% 4.32/4.51
% 4.32/4.51 FALSE TRUE
% 4.32/4.51 4 14 4
% 4.32/4.51 5 65 4
% 4.32/4.51 6 179 15
% 4.32/4.51 7 184 7
% 4.32/4.51 8 283 44
% 4.32/4.51 9 15 0
% 4.32/4.51 10 118 83
% 4.32/4.51 11 11 0
% 4.32/4.51 12 122 102
% 4.32/4.51 14 183 114
% 4.32/4.51 15 11 0
% 4.32/4.51 tot: 1185 373 (23.9% true)
% 4.32/4.51
% 4.32/4.51
% 4.32/4.51 Model 24 [ 20 2 150 ] (0.00 seconds, 250000 Inserts)
% 4.32/4.51
% 4.32/4.51 That finishes the proof of the theorem.
% 4.32/4.51
% 4.32/4.51 Process 8403 finished Mon Jun 6 10:47:26 2022
%------------------------------------------------------------------------------