TSTP Solution File: PUZ009-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:26:57 EDT 2022
% Result : Unsatisfiable 0.20s 0.40s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PUZ009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n029.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 : Sun May 29 03:02:58 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 n029.cluster.edu,
% 0.13/0.35 Sun May 29 03:02:58 2022
% 0.13/0.35 The command was "./sos". The process ID is 20679.
% 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=1, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 The clause set is propositional; the strategy will be
% 0.13/0.35 ordered hyperresolution with the propositional
% 0.13/0.35 optimizations, 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(propositional).
% 0.13/0.35 dependent: set(sort_literals).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35 Following clause subsumed by 1 during input processing: 0 [propositional] {-} -a_is_a_knight| -b_is_a_knight.
% 0.13/0.35 Following clause subsumed by 2 during input processing: 0 [propositional] {-} -a_is_a_knight| -d_is_a_knight.
% 0.13/0.35 Following clause subsumed by 0 during input processing: 0 [] {-} -d_is_a_knight|b_is_a_knight.
% 0.13/0.35 Following clause subsumed by 6 during input processing: 0 [] {-} -d_is_a_knight| -c_is_a_knight.
% 0.13/0.35 Following clause subsumed by 4 during input processing: 0 [propositional] {-} -b_is_a_knight|d_is_a_knight|c_is_a_knight.
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 21 back subsumes 15.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 8
% 0.13/0.38 number of clauses initially in problem: 12
% 0.13/0.38 percentage of clauses intially in UL: 66
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 5
% 0.13/0.38 distinct predicate count: 0
% 0.13/0.38 distinct function count: 0
% 0.13/0.38 distinct constant count: 5
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 0.20/0.40
% 0.20/0.40 -------- PROOF --------
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40 % SZS output start Refutation
% 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 Model 3 [ 1 0 10 ] (0.00 seconds, 10 Inserts)
% 0.20/0.40
% 0.20/0.40 Model 4 [ 1 1 10 ] (0.00 seconds, 11 Inserts)
% 0.20/0.40
% 0.20/0.40 -----> EMPTY CLAUSE at 0.02 sec ----> 26 [hyper,24,1,21] {-} $F.
% 0.20/0.40
% 0.20/0.40 Length of proof is 6. Level of proof is 4.
% 0.20/0.40
% 0.20/0.40 ---------------- PROOF ----------------
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40 % SZS output start Refutation
% 0.20/0.40
% 0.20/0.40 1 [] {+} -a_is_a_knight| -b_is_a_knight.
% 0.20/0.40 3 [] {-} -b_is_a_knight|c_is_a_knight|d_is_a_knight.
% 0.20/0.40 4 [copy,3,propositional] {+} -b_is_a_knight|d_is_a_knight|c_is_a_knight.
% 0.20/0.40 7 [] {-} -e_is_a_knight| -d_is_a_knight|c_is_a_knight.
% 0.20/0.40 8 [copy,7,propositional] {+} -d_is_a_knight| -e_is_a_knight|c_is_a_knight.
% 0.20/0.40 12 [] {-} a_is_a_knight| -c_is_a_knight.
% 0.20/0.40 13 [copy,12,propositional] {+} -c_is_a_knight|a_is_a_knight.
% 0.20/0.40 20 [] {+} a_is_a_knight|e_is_a_knight.
% 0.20/0.40 21 [] {+} b_is_a_knight.
% 0.20/0.40 22 [hyper,21,4] {+} d_is_a_knight|c_is_a_knight.
% 0.20/0.40 23 [hyper,22,8,20] {+} a_is_a_knight|c_is_a_knight.
% 0.20/0.40 24 [hyper,23,13] {+} a_is_a_knight.
% 0.20/0.40 26 [hyper,24,1,21] {-} $F.
% 0.20/0.40
% 0.20/0.40 % SZS output end Refutation
% 0.20/0.40 ------------ end of proof -------------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Search stopped by max_proofs option.
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Search stopped by max_proofs option.
% 0.20/0.40
% 0.20/0.40 ============ end of search ============
% 0.20/0.40
% 0.20/0.40 ----------- soft-scott stats ----------
% 0.20/0.40
% 0.20/0.40 true clauses given 3 (50.0%)
% 0.20/0.40 false clauses given 3
% 0.20/0.40
% 0.20/0.40 FALSE TRUE
% 0.20/0.40 tot: 0 0 (-nan% true)
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 4 [ 1 1 10 ] (0.00 seconds, 11 Inserts)
% 0.20/0.40
% 0.20/0.40 That finishes the proof of the theorem.
% 0.20/0.40
% 0.20/0.40 Process 20679 finished Sun May 29 03:02:58 2022
%------------------------------------------------------------------------------