%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN009-3 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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 : Thu Jul 21 12:09:05 EDT 2022
% Result : Unsatisfiable 0.59s 0.79s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN009-3 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n017.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 Jul 11 19:36:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n017.cluster.edu,
% 0.12/0.35 Mon Jul 11 19:36:34 2022
% 0.12/0.35 The command was "./sos". The process ID is 3477.
% 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=6.
% 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.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 10
% 0.12/0.37 number of clauses initially in problem: 14
% 0.12/0.37 percentage of clauses intially in UL: 71
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 70
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 10
% 0.12/0.37 distinct predicate count: 7
% 0.12/0.37 distinct function count: 0
% 0.12/0.37 distinct constant count: 3
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 0.59/0.79
% 0.59/0.79 -------- PROOF --------
% 0.59/0.79 % SZS status Unsatisfiable
% 0.59/0.79 % SZS output start Refutation
% 0.59/0.79
% 0.59/0.79 Model 2 (0.00 seconds, 0 Inserts)
% 0.59/0.79
% 0.59/0.79 Stopped by limit on number of solutions
% 0.59/0.79
% 0.59/0.79 Stopped by limit on insertions
% 0.59/0.79
% 0.59/0.79 Model 3 [ 1 0 175 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.79
% 0.59/0.79 Stopped by limit on insertions
% 0.59/0.79
% 0.59/0.79 Model 4 [ 1 1 188 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.79
% 0.59/0.79 Stopped by limit on insertions
% 0.59/0.79
% 0.59/0.79 Model 5 [ 1 0 271 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.79
% 0.59/0.79 Stopped by limit on insertions
% 0.59/0.79
% 0.59/0.79 Model 6 [ 2 0 183 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.79
% 0.59/0.79 Stopped by limit on insertions
% 0.59/0.79
% 0.59/0.79 Model 7 [ 2 1 186 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.79
% 0.59/0.79 -----> EMPTY CLAUSE at 0.42 sec ----> 46 [hyper,45,1,24] {-} $F.
% 0.59/0.79
% 0.59/0.79 Length of proof is 7. Level of proof is 5.
% 0.59/0.79
% 0.59/0.79 ---------------- PROOF ----------------
% 0.59/0.79 % SZS status Unsatisfiable
% 0.59/0.79 % SZS output start Refutation
% 0.59/0.79
% 0.59/0.79 1 [] {+} -p(A,B,C)| -t(A,B,C).
% 0.59/0.79 2 [] {+} -q(A,B,C)| -t(A,B,C).
% 0.59/0.79 3 [] {+} -r(A,B,C)| -t(A,B,C).
% 0.59/0.79 4 [] {+} -v(A,B,C).
% 0.59/0.79 5 [] {+} -s(A)| -s(B)| -s(C)|p(A,B,C)|q(A,B,C)|r(A,B,C).
% 0.59/0.79 6 [] {-} -u(A,B,C)|t(A,B,C)|v(A,B,C).
% 0.59/0.79 7 [copy,6,unit_del,4] {+} -u(A,B,C)|t(A,B,C).
% 0.59/0.79 8 [factor,5.1.2] {+} -s(A)| -s(B)|p(A,A,B)|q(A,A,B)|r(A,A,B).
% 0.59/0.79 11 [factor,8.1.2] {+} -s(A)|p(A,A,A)|q(A,A,A)|r(A,A,A).
% 0.59/0.79 14 [] {+} s(c).
% 0.59/0.79 15 [] {+} u(c,c,c).
% 0.59/0.79 17 [hyper,14,11] {+} p(c,c,c)|q(c,c,c)|r(c,c,c).
% 0.59/0.79 24 [hyper,15,7] {+} t(c,c,c).
% 0.59/0.79 44 [hyper,17,3,24] {+} p(c,c,c)|q(c,c,c).
% 0.59/0.79 45 [hyper,44,2,24] {+} p(c,c,c).
% 0.59/0.79 46 [hyper,45,1,24] {-} $F.
% 0.59/0.79
% 0.59/0.79 % SZS output end Refutation
% 0.59/0.79 ------------ end of proof -------------
% 0.59/0.79
% 0.59/0.79
% 0.59/0.79 Search stopped by max_proofs option.
% 0.59/0.79
% 0.59/0.79
% 0.59/0.79 Search stopped by max_proofs option.
% 0.59/0.79
% 0.59/0.79 ============ end of search ============
% 0.59/0.79
% 0.59/0.79 ----------- soft-scott stats ----------
% 0.59/0.79
% 0.59/0.79 true clauses given 3 (33.3%)
% 0.59/0.79 false clauses given 6
% 0.59/0.79
% 0.59/0.79 FALSE TRUE
% 0.59/0.79 12 6 19
% 0.59/0.79 tot: 6 19 (76.0% true)
% 0.59/0.79
% 0.59/0.79
% 0.59/0.79 Model 7 [ 2 1 186 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.79
% 0.59/0.79 That finishes the proof of the theorem.
% 0.59/0.79
% 0.59/0.79 Process 3477 finished Mon Jul 11 19:36:34 2022
%------------------------------------------------------------------------------