TSTP Solution File: PUZ021-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ021-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:59 EDT 2022
% Result : Unsatisfiable 2.82s 3.04s
% Output : Refutation 2.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n024.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 21:47:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox2 on n024.cluster.edu,
% 0.19/0.35 Sat May 28 21:47:21 2022
% 0.19/0.35 The command was "./sos". The process ID is 17515.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.19/0.35
% 0.19/0.35 This is a non-Horn set without equality. The strategy
% 0.19/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.19/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: set(factor).
% 0.19/0.35 dependent: set(unit_deletion).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 13
% 0.19/0.39 number of clauses initially in problem: 16
% 0.19/0.39 percentage of clauses intially in UL: 81
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 8
% 0.19/0.39 distinct predicate count: 2
% 0.19/0.39 distinct function count: 5
% 0.19/0.39 distinct constant count: 1
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 2.82/3.04
% 2.82/3.04 -------- PROOF --------
% 2.82/3.04 % SZS status Unsatisfiable
% 2.82/3.04 % SZS output start Refutation
% 2.82/3.04
% 2.82/3.04 Stopped by limit on insertions
% 2.82/3.04
% 2.82/3.04 Model 3 [ 3 1 404 ] (0.00 seconds, 250000 Inserts)
% 2.82/3.04
% 2.82/3.04 Stopped by limit on insertions
% 2.82/3.04
% 2.82/3.04 Model 4 [ 9 0 330 ] (0.00 seconds, 250000 Inserts)
% 2.82/3.04
% 2.82/3.04 Stopped by limit on insertions
% 2.82/3.04
% 2.82/3.04 Model 5 [ 6 1 2940 ] (0.00 seconds, 250000 Inserts)
% 2.82/3.04
% 2.82/3.04 Model 6 [ 1 1 3894 ] (0.00 seconds, 143726 Inserts)
% 2.82/3.04
% 2.82/3.04 Stopped by limit on insertions
% 2.82/3.04
% 2.82/3.04 Model 7 [ 1 13 234307 ] (0.00 seconds, 250000 Inserts)
% 2.82/3.04
% 2.82/3.04 Stopped by limit on insertions
% 2.82/3.04
% 2.82/3.04 Model 8 [ 2 0 644 ] (0.00 seconds, 250000 Inserts)
% 2.82/3.04
% 2.82/3.04 Stopped by limit on insertions
% 2.82/3.04
% 2.82/3.04 Model 9 [ 2 12 199908 ] (0.00 seconds, 250000 Inserts)
% 2.82/3.04
% 2.82/3.04 Stopped by limit on insertions
% 2.82/3.04
% 2.82/3.04 Model 10 [ 8 0 227 ] (0.00 seconds, 250000 Inserts)
% 2.82/3.04
% 2.82/3.04 -----> EMPTY CLAUSE at 2.67 sec ----> 3159 [hyper,2785,5,2784,2737] {-} $F.
% 2.82/3.04
% 2.82/3.04 Length of proof is 15. Level of proof is 11.
% 2.82/3.04
% 2.82/3.04 ---------------- PROOF ----------------
% 2.82/3.04 % SZS status Unsatisfiable
% 2.82/3.04 % SZS output start Refutation
% 2.82/3.04
% 2.82/3.04 3 [] {+} -a_truth(knight(A),B)| -says(A,C)|a_truth(C,B).
% 2.82/3.04 4 [] {+} -a_truth(knight(A),B)|says(A,C)| -a_truth(C,B).
% 2.82/3.04 5 [] {+} -a_truth(knave(A),B)| -says(A,C)| -a_truth(C,B).
% 2.82/3.04 6 [] {+} -a_truth(knave(A),B)|says(A,C)|a_truth(C,B).
% 2.82/3.04 7 [] {+} -a_truth(and(A,B),C)|a_truth(A,C).
% 2.82/3.04 8 [] {+} -a_truth(and(A,B),C)|a_truth(B,C).
% 2.82/3.04 10 [] {+} -says(me,A)| -a_truth(and(knave(me),rich(me)),A).
% 2.82/3.04 11 [factor,4.1.3] {+} -a_truth(knight(A),B)|says(A,knight(A)).
% 2.82/3.04 12 [factor,5.1.3] {+} -a_truth(knave(A),B)| -says(A,knave(A)).
% 2.82/3.04 14 [] {+} a_truth(knight(A),B)|a_truth(knave(A),B).
% 2.82/3.04 16 [] {-} says(me,A)|a_truth(and(knave(me),rich(me)),A).
% 2.82/3.04 26 [hyper,14,6] {+} a_truth(knight(A),B)|says(A,C)|a_truth(C,B).
% 2.82/3.04 44 [hyper,16,12,14] {-} a_truth(and(knave(me),rich(me)),knave(me))|a_truth(knight(me),A).
% 2.82/3.04 348 [hyper,44,7] {-} a_truth(knight(me),A)|a_truth(knave(me),knave(me)).
% 2.82/3.04 479 [hyper,348,5,26,44,factor_simp,factor_simp] {-} a_truth(knight(me),A)|a_truth(and(knave(me),rich(me)),A).
% 2.82/3.04 553 [hyper,479,3,16] {-} a_truth(and(knave(me),rich(me)),A)|a_truth(B,A)|a_truth(and(knave(me),rich(me)),B).
% 2.82/3.04 588 [factor,553.1.3] {-} a_truth(and(knave(me),rich(me)),A)|a_truth(A,A).
% 2.82/3.04 1804 [hyper,588,7] {+} a_truth(A,A)|a_truth(knave(me),A).
% 2.82/3.04 2403 [hyper,1804,6] {+} a_truth(A,A)|says(me,B)|a_truth(B,A).
% 2.82/3.04 2604 [factor,2403.1.3] {+} a_truth(A,A)|says(me,A).
% 2.82/3.04 2735 [hyper,2604,10,588,factor_simp] {-} a_truth(A,A).
% 2.82/3.04 2737 [hyper,2735,11] {+} says(A,knight(A)).
% 2.82/3.04 2784 [hyper,2735,8] {-} a_truth(A,and(B,A)).
% 2.82/3.04 2785 [hyper,2735,7] {-} a_truth(A,and(A,B)).
% 2.82/3.04 3159 [hyper,2785,5,2784,2737] {-} $F.
% 2.82/3.04
% 2.82/3.04 % SZS output end Refutation
% 2.82/3.04 ------------ end of proof -------------
% 2.82/3.04
% 2.82/3.04
% 2.82/3.04 Search stopped by max_proofs option.
% 2.82/3.04
% 2.82/3.04
% 2.82/3.04 Search stopped by max_proofs option.
% 2.82/3.04
% 2.82/3.04 ============ end of search ============
% 2.82/3.04
% 2.82/3.04 ----------- soft-scott stats ----------
% 2.82/3.04
% 2.82/3.04 true clauses given 5 (14.3%)
% 2.82/3.04 false clauses given 30
% 2.82/3.04
% 2.82/3.04 FALSE TRUE
% 2.82/3.04 5 1 1
% 2.82/3.04 6 1 0
% 2.82/3.04 7 10 0
% 2.82/3.04 8 5 0
% 2.82/3.04 9 15 0
% 2.82/3.04 10 14 0
% 2.82/3.04 11 16 3
% 2.82/3.04 12 33 1
% 2.82/3.04 13 56 2
% 2.82/3.04 14 33 0
% 2.82/3.04 15 91 4
% 2.82/3.04 16 46 2
% 2.82/3.04 17 57 7
% 2.82/3.04 18 109 0
% 2.82/3.04 19 93 0
% 2.82/3.04 20 25 8
% 2.82/3.04 21 132 5
% 2.82/3.04 22 153 0
% 2.82/3.04 23 91 0
% 2.82/3.04 24 2 0
% 2.82/3.04 25 213 16
% 2.82/3.04 26 112 0
% 2.82/3.04 28 19 0
% 2.82/3.04 29 64 0
% 2.82/3.04 30 54 0
% 2.82/3.04 tot: 1445 49 (3.3% true)
% 2.82/3.04
% 2.82/3.04
% 2.82/3.04 Model 10 [ 8 -50 227 ] (0.00 seconds, 250000 Inserts)
% 2.82/3.04
% 2.82/3.04 That finishes the proof of the theorem.
% 2.82/3.04
% 2.82/3.04 Process 17515 finished Sat May 28 21:47:24 2022
%------------------------------------------------------------------------------