TSTP Solution File: PUZ027-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ027-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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 0.43s 0.61s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : PUZ027-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.09 % Command : sos-script %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Sat May 28 20:10:40 EDT 2022
% 0.09/0.28 % CPUTime :
% 0.12/0.29 ----- Otter 3.2, August 2001 -----
% 0.12/0.29 The process was started by sandbox on n032.cluster.edu,
% 0.12/0.29 Sat May 28 20:10:40 2022
% 0.12/0.29 The command was "./sos". The process ID is 9168.
% 0.12/0.29
% 0.12/0.29 set(prolog_style_variables).
% 0.12/0.29 set(auto).
% 0.12/0.29 dependent: set(auto1).
% 0.12/0.29 dependent: set(process_input).
% 0.12/0.29 dependent: clear(print_kept).
% 0.12/0.29 dependent: clear(print_new_demod).
% 0.12/0.29 dependent: clear(print_back_demod).
% 0.12/0.29 dependent: clear(print_back_sub).
% 0.12/0.29 dependent: set(control_memory).
% 0.12/0.29 dependent: assign(max_mem, 12000).
% 0.12/0.29 dependent: assign(pick_given_ratio, 4).
% 0.12/0.29 dependent: assign(stats_level, 1).
% 0.12/0.29 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.29 dependent: assign(sos_limit, 5000).
% 0.12/0.29 dependent: assign(max_weight, 60).
% 0.12/0.29 clear(print_given).
% 0.12/0.29
% 0.12/0.29 list(usable).
% 0.12/0.29
% 0.12/0.29 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.12/0.29
% 0.12/0.29 This is a non-Horn set without equality. The strategy
% 0.12/0.29 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.29 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.29
% 0.12/0.29 dependent: set(hyper_res).
% 0.12/0.29 dependent: set(factor).
% 0.12/0.29 dependent: set(unit_deletion).
% 0.12/0.29
% 0.12/0.29 ------------> process usable:
% 0.12/0.29
% 0.12/0.29 ------------> process sos:
% 0.12/0.29
% 0.12/0.29 ======= end of input processing =======
% 0.12/0.32
% 0.12/0.32 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.32
% 0.12/0.32 Stopped by limit on number of solutions
% 0.12/0.32
% 0.12/0.32
% 0.12/0.32 -------------- Softie stats --------------
% 0.12/0.32
% 0.12/0.32 UPDATE_STOP: 300
% 0.12/0.32 SFINDER_TIME_LIMIT: 2
% 0.12/0.32 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.32 number of clauses in intial UL: 30
% 0.12/0.32 number of clauses initially in problem: 35
% 0.12/0.32 percentage of clauses intially in UL: 85
% 0.12/0.32 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.32 percent of all initial clauses that are short: 100
% 0.12/0.32 absolute distinct symbol count: 19
% 0.12/0.32 distinct predicate count: 2
% 0.12/0.32 distinct function count: 6
% 0.12/0.32 distinct constant count: 11
% 0.12/0.32
% 0.12/0.32 ---------- no more Softie stats ----------
% 0.12/0.32
% 0.12/0.32
% 0.12/0.32
% 0.12/0.32 =========== start of search ===========
% 0.43/0.61
% 0.43/0.61 -------- PROOF --------
% 0.43/0.61 % SZS status Unsatisfiable
% 0.43/0.61 % SZS output start Refutation
% 0.43/0.61
% 0.43/0.61 Model 2 (0.00 seconds, 0 Inserts)
% 0.43/0.61
% 0.43/0.61 Stopped by limit on number of solutions
% 0.43/0.61
% 0.43/0.61 Model 3 (0.00 seconds, 0 Inserts)
% 0.43/0.61
% 0.43/0.61 Stopped by limit on number of solutions
% 0.43/0.61
% 0.43/0.61 Stopped by limit on insertions
% 0.43/0.61
% 0.43/0.61 Model 4 [ 2 1 745 ] (0.00 seconds, 250000 Inserts)
% 0.43/0.61
% 0.43/0.61 Stopped by limit on insertions
% 0.43/0.61
% 0.43/0.61 Model 5 [ 3 1 711 ] (0.00 seconds, 250000 Inserts)
% 0.43/0.61
% 0.43/0.61 Stopped by limit on insertions
% 0.43/0.61
% 0.43/0.61 ----> UNIT CONFLICT at 0.29 sec ----> 176 [binary,175.1,27.1] {-} $F.
% 0.43/0.61
% 0.43/0.61 Length of proof is 10. Level of proof is 9.
% 0.43/0.61
% 0.43/0.61 ---------------- PROOF ----------------
% 0.43/0.61 % SZS status Unsatisfiable
% 0.43/0.61 % SZS output start Refutation
% 0.43/0.61
% 0.43/0.61 6 [] {+} -a_truth(A)| -a_truth(says(B,A))|a_truth(truthteller(B))|a_truth(normal(B)).
% 0.43/0.61 10 [] {+} -a_truth(lower(A,B))| -a_truth(normal(A))|a_truth(truthteller(B)).
% 0.43/0.61 11 [] {+} -a_truth(lower(A,B))| -a_truth(truthteller(A)).
% 0.43/0.61 18 [] {+} -a_truth(truthteller(a))| -a_truth(truthteller(b))|answer(a_and_b_truthteller).
% 0.43/0.61 19 [] {+} -a_truth(truthteller(a))| -a_truth(normal(b))|answer(a_truthteller_b_normal).
% 0.43/0.61 21 [] {+} -a_truth(normal(a))| -a_truth(truthteller(b))|answer(a_normal_b_truthteller).
% 0.43/0.61 22 [] {+} -a_truth(normal(a))| -a_truth(normal(b))|answer(a_and_b_normal).
% 0.43/0.61 24 [] {+} -a_truth(liar(a))| -a_truth(truthteller(b))|answer(a_liar_b_truthteller).
% 0.43/0.61 25 [] {+} -a_truth(liar(a))| -a_truth(normal(b))|answer(a_liar_b_normal).
% 0.43/0.61 26 [] {+} -a_truth(liar(a))| -a_truth(liar(b))|answer(a_and_b_liar).
% 0.43/0.61 27 [] {+} -answer(A).
% 0.43/0.61 31 [] {-} a_truth(truthteller(A))|a_truth(liar(A))|a_truth(normal(A)).
% 0.43/0.61 33 [] {+} a_truth(not_lower(A,B))|a_truth(lower(A,B)).
% 0.43/0.61 35 [] {-} a_truth(says(b,not_lower(a,b))).
% 0.43/0.61 36 [hyper,31,24,31,unit_del,27] {-} a_truth(liar(b))|a_truth(normal(b))|a_truth(truthteller(a))|a_truth(normal(a)).
% 0.43/0.61 57 [hyper,36,26,31,unit_del,27,factor_simp,factor_simp] {-} a_truth(normal(b))|a_truth(truthteller(a))|a_truth(normal(a)).
% 0.43/0.61 61 [hyper,57,25,31,unit_del,27,factor_simp,factor_simp] {-} a_truth(truthteller(a))|a_truth(normal(a)).
% 0.43/0.61 73 [hyper,61,11,33] {-} a_truth(normal(a))|a_truth(not_lower(a,A)).
% 0.43/0.61 84 [hyper,73,10,33,factor_simp] {-} a_truth(not_lower(a,A))|a_truth(truthteller(A)).
% 0.43/0.61 88 [hyper,84,6,35,factor_simp] {+} a_truth(truthteller(b))|a_truth(normal(b)).
% 0.43/0.61 138 [hyper,88,21,61,unit_del,27] {-} a_truth(normal(b))|a_truth(truthteller(a)).
% 0.43/0.61 153 [hyper,138,22,61,unit_del,27,factor_simp] {+} a_truth(truthteller(a)).
% 0.43/0.61 154 [hyper,138,18,88,unit_del,27,factor_simp] {-} a_truth(normal(b)).
% 0.43/0.61 175 [hyper,154,19,153] {-} answer(a_truthteller_b_normal).
% 0.43/0.61 176 [binary,175.1,27.1] {-} $F.
% 0.43/0.61
% 0.43/0.61 % SZS output end Refutation
% 0.43/0.61 ------------ end of proof -------------
% 0.43/0.61
% 0.43/0.61
% 0.43/0.61 Search stopped by max_proofs option.
% 0.43/0.61
% 0.43/0.61
% 0.43/0.61 Search stopped by max_proofs option.
% 0.43/0.61
% 0.43/0.61 ============ end of search ============
% 0.43/0.61
% 0.43/0.61 ----------- soft-scott stats ----------
% 0.43/0.61
% 0.43/0.61 true clauses given 1 (5.9%)
% 0.43/0.61 false clauses given 16
% 0.43/0.61
% 0.43/0.61 FALSE TRUE
% 0.43/0.61 4 2 0
% 0.43/0.61 6 2 0
% 0.43/0.61 7 1 0
% 0.43/0.61 10 3 1
% 0.43/0.61 13 3 0
% 0.43/0.61 14 5 0
% 0.43/0.61 16 1 0
% 0.43/0.61 17 2 0
% 0.43/0.61 18 4 0
% 0.43/0.61 21 4 0
% 0.43/0.61 24 1 0
% 0.43/0.61 25 5 0
% 0.43/0.61 27 1 0
% 0.43/0.61 tot: 34 1 (2.9% true)
% 0.43/0.61
% 0.43/0.61
% 0.43/0.61 Model 5 [ 3 -7 711 ] (0.00 seconds, 250000 Inserts)
% 0.43/0.61
% 0.43/0.61 That finishes the proof of the theorem.
% 0.43/0.61
% 0.43/0.61 Process 9168 finished Sat May 28 20:10:41 2022
%------------------------------------------------------------------------------