%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ026-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.50s 0.70s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : PUZ026-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.09 % Command : sos-script %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Sat May 28 19:49:10 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.08/0.29 ----- Otter 3.2, August 2001 -----
% 0.08/0.29 The process was started by sandbox on n032.cluster.edu,
% 0.08/0.29 Sat May 28 19:49:10 2022
% 0.08/0.29 The command was "./sos". The process ID is 10722.
% 0.08/0.29
% 0.08/0.29 set(prolog_style_variables).
% 0.08/0.29 set(auto).
% 0.08/0.29 dependent: set(auto1).
% 0.08/0.29 dependent: set(process_input).
% 0.08/0.29 dependent: clear(print_kept).
% 0.08/0.29 dependent: clear(print_new_demod).
% 0.08/0.29 dependent: clear(print_back_demod).
% 0.08/0.29 dependent: clear(print_back_sub).
% 0.08/0.29 dependent: set(control_memory).
% 0.08/0.29 dependent: assign(max_mem, 12000).
% 0.08/0.29 dependent: assign(pick_given_ratio, 4).
% 0.08/0.29 dependent: assign(stats_level, 1).
% 0.08/0.29 dependent: assign(pick_semantic_ratio, 3).
% 0.08/0.29 dependent: assign(sos_limit, 5000).
% 0.08/0.29 dependent: assign(max_weight, 60).
% 0.08/0.29 clear(print_given).
% 0.08/0.29
% 0.08/0.29 list(usable).
% 0.08/0.29
% 0.08/0.29 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.08/0.29
% 0.08/0.29 This is a non-Horn set without equality. The strategy
% 0.08/0.29 will be ordered hyper_res, ur_res, unit deletion, and
% 0.08/0.29 factoring, with satellites in sos and nuclei in usable.
% 0.08/0.29
% 0.08/0.29 dependent: set(hyper_res).
% 0.08/0.29 dependent: set(factor).
% 0.08/0.29 dependent: set(unit_deletion).
% 0.08/0.29
% 0.08/0.29 ------------> process usable:
% 0.08/0.29
% 0.08/0.29 ------------> process sos:
% 0.08/0.29
% 0.08/0.29 ======= end of input processing =======
% 0.12/0.31
% 0.12/0.31 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.31
% 0.12/0.31 Stopped by limit on number of solutions
% 0.12/0.31
% 0.12/0.31
% 0.12/0.31 -------------- Softie stats --------------
% 0.12/0.31
% 0.12/0.31 UPDATE_STOP: 300
% 0.12/0.31 SFINDER_TIME_LIMIT: 2
% 0.12/0.31 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.31 number of clauses in intial UL: 24
% 0.12/0.31 number of clauses initially in problem: 32
% 0.12/0.31 percentage of clauses intially in UL: 75
% 0.12/0.31 percentage of distinct symbols occuring in initial UL: 70
% 0.12/0.31 percent of all initial clauses that are short: 100
% 0.12/0.31 absolute distinct symbol count: 10
% 0.12/0.31 distinct predicate count: 2
% 0.12/0.31 distinct function count: 5
% 0.12/0.31 distinct constant count: 3
% 0.12/0.31
% 0.12/0.31 ---------- no more Softie stats ----------
% 0.12/0.31
% 0.12/0.31
% 0.12/0.31
% 0.12/0.31 =========== start of search ===========
% 0.50/0.70
% 0.50/0.70 -------- PROOF --------
% 0.50/0.70 % SZS status Unsatisfiable
% 0.50/0.70 % SZS output start Refutation
% 0.50/0.70
% 0.50/0.70 Model 2 (0.00 seconds, 0 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Model 3 (0.00 seconds, 0 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Model 4 (0.00 seconds, 0 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Model 5 (0.00 seconds, 0 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Model 6 (0.00 seconds, 0 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on number of solutions
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70 Model 7 [ 1 0 322 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70 Model 8 [ 1 0 181 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70 Model 9 [ 3 0 104 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70 Model 10 [ 4 1 1066 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 -----> EMPTY CLAUSE at 0.38 sec ----> 183 [hyper,171,15,164,167] {-} $F.
% 0.50/0.70
% 0.50/0.70 Length of proof is 11. Level of proof is 8.
% 0.50/0.70
% 0.50/0.70 ---------------- PROOF ----------------
% 0.50/0.70 % SZS status Unsatisfiable
% 0.50/0.70 % SZS output start Refutation
% 0.50/0.70
% 0.50/0.70 6 [] {+} -a_truth(A)| -a_truth(says(B,A))|a_truth(truthteller(B))|a_truth(normal(B)).
% 0.50/0.70 7 [] {+} a_truth(A)| -a_truth(says(B,A))|a_truth(liar(B))|a_truth(normal(B)).
% 0.50/0.70 9 [] {+} -people(A,B,C)| -a_truth(truthteller(A))| -a_truth(truthteller(B)).
% 0.50/0.70 12 [] {+} -people(A,B,C)| -a_truth(liar(A))| -a_truth(liar(C)).
% 0.50/0.70 13 [] {+} -people(A,B,C)| -a_truth(normal(A))| -a_truth(normal(B)).
% 0.50/0.70 14 [] {+} -people(A,B,C)| -a_truth(normal(A))| -a_truth(normal(C)).
% 0.50/0.70 15 [] {+} -a_truth(liar(A))| -a_truth(normal(B))| -a_truth(truthteller(C)).
% 0.50/0.70 18 [factor,7.1.4] {+} a_truth(normal(A))| -a_truth(says(A,normal(A)))|a_truth(liar(A)).
% 0.50/0.70 25 [] {-} a_truth(truthteller(A))|a_truth(liar(A))|a_truth(normal(A)).
% 0.50/0.70 28 [] {+} people(b,c,a).
% 0.50/0.70 29 [] {+} people(c,b,a).
% 0.50/0.70 30 [] {+} a_truth(says(a,normal(a))).
% 0.50/0.70 31 [] {-} a_truth(says(b,normal(a))).
% 0.50/0.70 34 [hyper,30,18] {-} a_truth(normal(a))|a_truth(liar(a)).
% 0.50/0.70 52 [hyper,31,7] {-} a_truth(normal(a))|a_truth(liar(b))|a_truth(normal(b)).
% 0.50/0.70 68 [hyper,52,12,28,34,factor_simp] {-} a_truth(normal(a))|a_truth(normal(b)).
% 0.50/0.70 127 [hyper,68,6,31,factor_simp] {-} a_truth(normal(b))|a_truth(truthteller(b)).
% 0.50/0.70 130 [hyper,68,15,34,25,factor_simp] {-} a_truth(normal(a))|a_truth(liar(A))|a_truth(normal(A)).
% 0.50/0.70 156 [hyper,130,12,29,130,factor_simp,factor_simp] {-} a_truth(normal(a))|a_truth(normal(c)).
% 0.50/0.70 164 [hyper,156,13,28,68,factor_simp] {+} a_truth(normal(a)).
% 0.50/0.70 166 [hyper,164,14,29,25] {-} a_truth(truthteller(c))|a_truth(liar(c)).
% 0.50/0.70 167 [hyper,164,14,28,127] {+} a_truth(truthteller(b)).
% 0.50/0.70 171 [hyper,166,9,28,167] {+} a_truth(liar(c)).
% 0.50/0.70 183 [hyper,171,15,164,167] {-} $F.
% 0.50/0.70
% 0.50/0.70 % SZS output end Refutation
% 0.50/0.70 ------------ end of proof -------------
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Search stopped by max_proofs option.
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Search stopped by max_proofs option.
% 0.50/0.70
% 0.50/0.70 ============ end of search ============
% 0.50/0.70
% 0.50/0.70 ----------- soft-scott stats ----------
% 0.50/0.70
% 0.50/0.70 true clauses given 1 (4.5%)
% 0.50/0.70 false clauses given 21
% 0.50/0.70
% 0.50/0.70 FALSE TRUE
% 0.50/0.70 3 1 2
% 0.50/0.70 6 1 0
% 0.50/0.70 12 4 0
% 0.50/0.70 15 4 1
% 0.50/0.70 18 0 1
% 0.50/0.70 tot: 10 4 (28.6% true)
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Model 10 [ 4 1 1066 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 That finishes the proof of the theorem.
% 0.50/0.70
% 0.50/0.70 Process 10722 finished Sat May 28 19:49:11 2022
%------------------------------------------------------------------------------