%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : FLD071-4 : TPTP v8.1.0. Bugfixed v2.1.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 : Sat Jul 16 02:28:00 EDT 2022
% Result : Unsatisfiable 1.84s 2.05s
% Output : Refutation 1.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD071-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n028.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 6 10:50:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox2 on n028.cluster.edu,
% 0.19/0.36 Mon Jun 6 10:50:43 2022
% 0.19/0.36 The command was "./sos". The process ID is 3194.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.19/0.36
% 0.19/0.36 This is a non-Horn set without equality. The strategy
% 0.19/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.19/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.43
% 0.19/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 -------------- Softie stats --------------
% 0.19/0.43
% 0.19/0.43 UPDATE_STOP: 300
% 0.19/0.43 SFINDER_TIME_LIMIT: 2
% 0.19/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.43 number of clauses in intial UL: 48
% 0.19/0.43 number of clauses initially in problem: 56
% 0.19/0.43 percentage of clauses intially in UL: 85
% 0.19/0.43 percentage of distinct symbols occuring in initial UL: 84
% 0.19/0.43 percent of all initial clauses that are short: 100
% 0.19/0.43 absolute distinct symbol count: 13
% 0.19/0.43 distinct predicate count: 4
% 0.19/0.43 distinct function count: 4
% 0.19/0.43 distinct constant count: 5
% 0.19/0.43
% 0.19/0.43 ---------- no more Softie stats ----------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 =========== start of search ===========
% 1.84/2.05
% 1.84/2.05 -------- PROOF --------
% 1.84/2.05 % SZS status Unsatisfiable
% 1.84/2.05 % SZS output start Refutation
% 1.84/2.05
% 1.84/2.05 Stopped by limit on insertions
% 1.84/2.05
% 1.84/2.05 Model 3 [ 2 1 328 ] (0.00 seconds, 250000 Inserts)
% 1.84/2.05
% 1.84/2.05 Stopped by limit on insertions
% 1.84/2.05
% 1.84/2.05 Model 4 [ 2 1 389 ] (0.00 seconds, 250000 Inserts)
% 1.84/2.05
% 1.84/2.05 Stopped by limit on insertions
% 1.84/2.05
% 1.84/2.05 Model 5 [ 2 2 7061 ] (0.00 seconds, 250000 Inserts)
% 1.84/2.05
% 1.84/2.05 Stopped by limit on insertions
% 1.84/2.05
% 1.84/2.05 Model 6 [ 2 1 351 ] (0.00 seconds, 250000 Inserts)
% 1.84/2.05
% 1.84/2.05 Stopped by limit on insertions
% 1.84/2.05
% 1.84/2.05 Model 7 [ 2 2 318 ] (0.00 seconds, 250000 Inserts)
% 1.84/2.05
% 1.84/2.05 Stopped by limit on insertions
% 1.84/2.05
% 1.84/2.05 Model 8 [ 2 2 671 ] (0.00 seconds, 250000 Inserts)
% 1.84/2.05
% 1.84/2.05 Stopped by limit on insertions
% 1.84/2.05
% 1.84/2.05 Model 9 [ 9 2 8610 ] (0.00 seconds, 250000 Inserts)
% 1.84/2.05
% 1.84/2.05 Stopped by limit on insertions
% 1.84/2.05
% 1.84/2.05 Model 10 [ 8 2 268 ] (0.00 seconds, 250000 Inserts)
% 1.84/2.05
% 1.84/2.05 Stopped by limit on insertions
% 1.84/2.05
% 1.84/2.05 Model 11 [ 5 1 511 ] (0.00 seconds, 250000 Inserts)
% 1.84/2.05
% 1.84/2.05 ----> UNIT CONFLICT at 1.67 sec ----> 397 [binary,396.1,25.1] {-} $F.
% 1.84/2.05
% 1.84/2.05 Length of proof is 1. Level of proof is 1.
% 1.84/2.05
% 1.84/2.05 ---------------- PROOF ----------------
% 1.84/2.05 % SZS status Unsatisfiable
% 1.84/2.05 % SZS output start Refutation
% 1.84/2.05
% 1.84/2.05 23 [] {+} less_or_equal(additive_identity,A)| -less_or_equal(additive_identity,B)| -less_or_equal(additive_identity,C)| -product(B,C,A).
% 1.84/2.05 25 [] {+} -less_or_equal(additive_identity,u).
% 1.84/2.05 54 [] {+} less_or_equal(additive_identity,a).
% 1.84/2.05 55 [] {+} less_or_equal(additive_identity,b).
% 1.84/2.05 56 [] {+} product(a,b,u).
% 1.84/2.05 396 [hyper,55,23,54,56] {-} less_or_equal(additive_identity,u).
% 1.84/2.05 397 [binary,396.1,25.1] {-} $F.
% 1.84/2.05
% 1.84/2.05 % SZS output end Refutation
% 1.84/2.05 ------------ end of proof -------------
% 1.84/2.05
% 1.84/2.05
% 1.84/2.05 Search stopped by max_proofs option.
% 1.84/2.05
% 1.84/2.05
% 1.84/2.05 Search stopped by max_proofs option.
% 1.84/2.05
% 1.84/2.05 ============ end of search ============
% 1.84/2.05
% 1.84/2.05 ----------- soft-scott stats ----------
% 1.84/2.05
% 1.84/2.05 true clauses given 1 (7.7%)
% 1.84/2.05 false clauses given 12
% 1.84/2.05
% 1.84/2.05 FALSE TRUE
% 1.84/2.05 3 0 6
% 1.84/2.05 4 31 33
% 1.84/2.05 5 20 48
% 1.84/2.05 6 17 64
% 1.84/2.05 7 2 5
% 1.84/2.05 8 12 63
% 1.84/2.05 9 2 5
% 1.84/2.05 10 0 21
% 1.84/2.05 12 0 3
% 1.84/2.05 tot: 84 248 (74.7% true)
% 1.84/2.05
% 1.84/2.05
% 1.84/2.05 Model 11 [ 5 1 511 ] (0.00 seconds, 250000 Inserts)
% 1.84/2.05
% 1.84/2.05 That finishes the proof of the theorem.
% 1.84/2.05
% 1.84/2.05 Process 3194 finished Mon Jun 6 10:50:45 2022
%------------------------------------------------------------------------------