TSTP Solution File: SYN009-4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN009-4 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:06 EDT 2022
% Result : Unsatisfiable 0.70s 0.86s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN009-4 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 08:59:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n026.cluster.edu,
% 0.13/0.35 Tue Jul 12 08:59:13 2022
% 0.13/0.35 The command was "./sos". The process ID is 10900.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.13/0.35
% 0.13/0.35 This is a non-Horn set without equality. The strategy
% 0.13/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 14
% 0.20/0.40 number of clauses initially in problem: 17
% 0.20/0.40 percentage of clauses intially in UL: 82
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 77
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 9
% 0.20/0.40 distinct predicate count: 6
% 0.20/0.40 distinct function count: 0
% 0.20/0.40 distinct constant count: 3
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.70/0.86
% 0.70/0.86 -------- PROOF --------
% 0.70/0.86 % SZS status Unsatisfiable
% 0.70/0.86 % SZS output start Refutation
% 0.70/0.86
% 0.70/0.86 Model 3 (0.00 seconds, 0 Inserts)
% 0.70/0.86
% 0.70/0.86 Stopped by limit on number of solutions
% 0.70/0.86
% 0.70/0.86 Stopped by limit on insertions
% 0.70/0.86
% 0.70/0.86 Model 4 [ 1 0 297 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.86
% 0.70/0.86 Stopped by limit on insertions
% 0.70/0.86
% 0.70/0.86 Model 5 [ 2 1 162 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.86
% 0.70/0.86 Stopped by limit on insertions
% 0.70/0.86
% 0.70/0.86 Model 6 [ 1 0 158 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.86
% 0.70/0.86 Stopped by limit on insertions
% 0.70/0.86
% 0.70/0.86 Model 7 [ 1 1 2043 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.86
% 0.70/0.86 Stopped by limit on insertions
% 0.70/0.86
% 0.70/0.86 Model 8 [ 1 1 12541 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.86
% 0.70/0.86 Stopped by limit on insertions
% 0.70/0.86
% 0.70/0.86 Model 9 [ 2 1 188 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.86
% 0.70/0.86 -----> EMPTY CLAUSE at 0.48 sec ----> 74 [hyper,73,1,34] {-} $F.
% 0.70/0.86
% 0.70/0.86 Length of proof is 8. Level of proof is 5.
% 0.70/0.86
% 0.70/0.86 ---------------- PROOF ----------------
% 0.70/0.86 % SZS status Unsatisfiable
% 0.70/0.86 % SZS output start Refutation
% 0.70/0.86
% 0.70/0.86 1 [] {+} -p(A,B,C)| -m(A,B,C).
% 0.70/0.86 2 [] {+} -q(A,B,C)| -m(A,B,C).
% 0.70/0.86 3 [] {+} -r(A,B,C)| -m(A,B,C).
% 0.70/0.86 4 [] {+} -n(c,c,c).
% 0.70/0.86 5 [] {+} -s(A)| -s(B)| -s(C)|p(A,B,C)|q(A,B,C)|r(A,B,C).
% 0.70/0.86 6 [] {+} -s(A)| -s(B)| -s(C)|m(A,B,C)|n(A,B,C).
% 0.70/0.86 7 [factor,5.1.2] {+} -s(A)| -s(B)|p(A,A,B)|q(A,A,B)|r(A,A,B).
% 0.70/0.86 10 [factor,6.1.2] {+} -s(A)| -s(B)|m(A,A,B)|n(A,A,B).
% 0.70/0.86 13 [factor,7.1.2] {+} -s(A)|p(A,A,A)|q(A,A,A)|r(A,A,A).
% 0.70/0.86 14 [factor,10.1.2] {+} -s(A)|m(A,A,A)|n(A,A,A).
% 0.70/0.86 17 [] {-} s(c).
% 0.70/0.86 34 [hyper,17,14,unit_del,4] {+} m(c,c,c).
% 0.70/0.86 35 [hyper,17,13] {+} p(c,c,c)|q(c,c,c)|r(c,c,c).
% 0.70/0.86 72 [hyper,35,3,34] {+} p(c,c,c)|q(c,c,c).
% 0.70/0.86 73 [hyper,72,2,34] {+} p(c,c,c).
% 0.70/0.86 74 [hyper,73,1,34] {-} $F.
% 0.70/0.86
% 0.70/0.86 % SZS output end Refutation
% 0.70/0.86 ------------ end of proof -------------
% 0.70/0.86
% 0.70/0.86
% 0.70/0.86 Search stopped by max_proofs option.
% 0.70/0.86
% 0.70/0.86
% 0.70/0.86 Search stopped by max_proofs option.
% 0.70/0.86
% 0.70/0.86 ============ end of search ============
% 0.70/0.86
% 0.70/0.86 ----------- soft-scott stats ----------
% 0.70/0.86
% 0.70/0.86 true clauses given 30 (54.5%)
% 0.70/0.86 false clauses given 25
% 0.70/0.86
% 0.70/0.86 FALSE TRUE
% 0.70/0.86 12 0 4
% 0.70/0.86 tot: 0 4 (100.0% true)
% 0.70/0.86
% 0.70/0.86
% 0.70/0.86 Model 9 [ 2 1 188 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.86
% 0.70/0.86 That finishes the proof of the theorem.
% 0.70/0.86
% 0.70/0.86 Process 10900 finished Tue Jul 12 08:59:13 2022
%------------------------------------------------------------------------------