TSTP Solution File: PUZ031+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ031+3 : TPTP v8.1.0. Released v4.1.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 : Mon Jul 18 18:27:01 EDT 2022
% Result : Theorem 0.65s 0.88s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : PUZ031+3 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n026.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 : Sat May 28 20:51:39 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 sandbox2 on n026.cluster.edu,
% 0.12/0.35 Sat May 28 20:51:39 2022
% 0.12/0.35 The command was "./sos". The process ID is 25405.
% 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 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=8.
% 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: 29
% 0.12/0.37 number of clauses initially in problem: 38
% 0.12/0.37 percentage of clauses intially in UL: 76
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 59
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 22
% 0.12/0.37 distinct predicate count: 11
% 0.12/0.37 distinct function count: 2
% 0.12/0.37 distinct constant count: 9
% 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.65/0.88
% 0.65/0.88 -------- PROOF --------
% 0.65/0.88 % SZS status Theorem
% 0.65/0.88 % SZS output start Refutation
% 0.65/0.88
% 0.65/0.88 Model 2 (0.00 seconds, 0 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on number of solutions
% 0.65/0.88
% 0.65/0.88 Model 3 (0.00 seconds, 0 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on number of solutions
% 0.65/0.88
% 0.65/0.88 Model 4 (0.00 seconds, 0 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on number of solutions
% 0.65/0.88
% 0.65/0.88 Model 5 (0.00 seconds, 0 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on number of solutions
% 0.65/0.88
% 0.65/0.88 Model 6 (0.00 seconds, 0 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on number of solutions
% 0.65/0.88
% 0.65/0.88 Stopped by limit on insertions
% 0.65/0.88
% 0.65/0.88 Model 7 [ 1 0 358 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on insertions
% 0.65/0.88
% 0.65/0.88 Model 8 [ 2 0 193 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on insertions
% 0.65/0.88
% 0.65/0.88 Model 9 [ 1 6 246136 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on insertions
% 0.65/0.88
% 0.65/0.88 Model 10 [ 2 0 196 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on insertions
% 0.65/0.88
% 0.65/0.88 Model 11 [ 2 1 209 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on insertions
% 0.65/0.88
% 0.65/0.88 Model 12 [ 4 1 74 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on insertions
% 0.65/0.88
% 0.65/0.88 Model 13 [ 3 0 153 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.88
% 0.65/0.88 Stopped by limit on insertions
% 0.65/0.88
% 0.65/0.88 Model 14 [ 3 1 73 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.88
% 0.65/0.88 -----> EMPTY CLAUSE at 0.51 sec ----> 93 [hyper,91,22,40,42,38,84] {-} $F.
% 0.65/0.88
% 0.65/0.88 Length of proof is 17. Level of proof is 7.
% 0.65/0.88
% 0.65/0.88 ---------------- PROOF ----------------
% 0.65/0.88 % SZS status Theorem
% 0.65/0.88 % SZS output start Refutation
% 0.65/0.88
% 0.65/0.88 2 [] {+} -wolf(A)|animal(A).
% 0.65/0.88 3 [] {+} -fox(A)|animal(A).
% 0.65/0.88 4 [] {+} -bird(A)|animal(A).
% 0.65/0.88 6 [] {+} -snail(A)|animal(A).
% 0.65/0.88 8 [] {+} -grain(A)|plant(A).
% 0.65/0.88 9 [] {+} -animal(A)| -plant(B)|eats(A,B)| -animal(C)| -much_smaller(C,A)| -plant(D)| -eats(C,D)|eats(A,C).
% 0.65/0.88 10 [] {+} -bird(A)| -snail(B)|much_smaller(B,A).
% 0.65/0.88 12 [] {+} -bird(A)| -fox(B)|much_smaller(A,B).
% 0.65/0.88 13 [] {+} -fox(A)| -wolf(B)|much_smaller(A,B).
% 0.65/0.88 15 [] {+} -wolf(A)| -grain(B)| -eats(A,B).
% 0.65/0.88 17 [] {+} -bird(A)| -snail(B)| -eats(A,B).
% 0.65/0.88 20 [] {+} -snail(A)|plant($f2(A)).
% 0.65/0.88 21 [] {+} -snail(A)|eats(A,$f2(A)).
% 0.65/0.88 22 [] {+} -animal(A)| -animal(B)| -grain(C)| -eats(B,C)| -eats(A,B).
% 0.65/0.88 24 [factor,9.2.6] {+} -animal(A)| -plant(B)|eats(A,B)| -animal(C)| -much_smaller(C,A)| -eats(C,B)|eats(A,C).
% 0.65/0.88 32 [] {+} wolf($c3).
% 0.65/0.88 33 [] {+} fox($c4).
% 0.65/0.88 34 [] {+} bird($c5).
% 0.65/0.88 36 [] {+} snail($c7).
% 0.65/0.88 38 [] {+} grain($c9).
% 0.65/0.88 40 [hyper,32,2] {+} animal($c3).
% 0.65/0.88 41 [hyper,33,13,32] {+} much_smaller($c4,$c3).
% 0.65/0.88 42 [hyper,33,3] {+} animal($c4).
% 0.65/0.88 43 [hyper,34,12,33] {+} much_smaller($c5,$c4).
% 0.65/0.88 44 [hyper,34,4] {+} animal($c5).
% 0.65/0.88 50 [hyper,36,21] {+} eats($c7,$f2($c7)).
% 0.65/0.88 51 [hyper,36,20] {+} plant($f2($c7)).
% 0.65/0.88 52 [hyper,36,10,34] {+} much_smaller($c7,$c5).
% 0.65/0.88 53 [hyper,36,6] {+} animal($c7).
% 0.65/0.88 54 [hyper,38,8] {+} plant($c9).
% 0.65/0.88 65 [hyper,52,9,44,54,53,51,50] {+} eats($c5,$c9)|eats($c5,$c7).
% 0.65/0.88 72 [hyper,65,17,34,36] {+} eats($c5,$c9).
% 0.65/0.88 74 [hyper,72,24,42,54,44,43] {+} eats($c4,$c9)|eats($c4,$c5).
% 0.65/0.88 84 [hyper,74,22,42,44,38,72] {+} eats($c4,$c9).
% 0.65/0.88 85 [hyper,84,24,40,54,42,41] {+} eats($c3,$c9)|eats($c3,$c4).
% 0.65/0.88 91 [hyper,85,15,32,38] {+} eats($c3,$c4).
% 0.65/0.88 93 [hyper,91,22,40,42,38,84] {-} $F.
% 0.65/0.88
% 0.65/0.88 % SZS output end Refutation
% 0.65/0.88 ------------ end of proof -------------
% 0.65/0.88
% 0.65/0.88
% 0.65/0.88 Search stopped by max_proofs option.
% 0.65/0.88
% 0.65/0.88
% 0.65/0.88 Search stopped by max_proofs option.
% 0.65/0.88
% 0.65/0.88 ============ end of search ============
% 0.65/0.88
% 0.65/0.88 ----------- soft-scott stats ----------
% 0.65/0.88
% 0.65/0.88 true clauses given 36 (72.0%)
% 0.65/0.88 false clauses given 14
% 0.65/0.88
% 0.65/0.88 FALSE TRUE
% 0.65/0.88 3 0 1
% 0.65/0.88 7 0 1
% 0.65/0.88 tot: 0 2 (100.0% true)
% 0.65/0.88
% 0.65/0.88
% 0.65/0.88 Model 14 [ 3 1 73 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.88
% 0.65/0.88 That finishes the proof of the theorem.
% 0.65/0.88
% 0.65/0.88 Process 25405 finished Sat May 28 20:51:39 2022
%------------------------------------------------------------------------------