%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ032-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:27:01 EDT 2022
% Result : Unsatisfiable 0.46s 0.67s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : PUZ032-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.11 % Command : sos-script %s
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat May 28 19:48:22 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox2 on n024.cluster.edu,
% 0.11/0.34 Sat May 28 19:48:22 2022
% 0.11/0.34 The command was "./sos". The process ID is 24055.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.11/0.34
% 0.11/0.34 This is a non-Horn set without equality. The strategy
% 0.11/0.34 will be ordered hyper_res, ur_res, unit deletion, and
% 0.11/0.34 factoring, with satellites in sos and nuclei in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: set(factor).
% 0.11/0.34 dependent: set(unit_deletion).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.11/0.38
% 0.11/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.38
% 0.11/0.38 Stopped by limit on number of solutions
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 -------------- Softie stats --------------
% 0.11/0.38
% 0.11/0.38 UPDATE_STOP: 300
% 0.11/0.38 SFINDER_TIME_LIMIT: 2
% 0.11/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.38 number of clauses in intial UL: 8
% 0.11/0.38 number of clauses initially in problem: 12
% 0.11/0.38 percentage of clauses intially in UL: 66
% 0.11/0.38 percentage of distinct symbols occuring in initial UL: 62
% 0.11/0.38 percent of all initial clauses that are short: 100
% 0.11/0.38 absolute distinct symbol count: 8
% 0.11/0.38 distinct predicate count: 1
% 0.11/0.38 distinct function count: 3
% 0.11/0.38 distinct constant count: 4
% 0.11/0.38
% 0.11/0.38 ---------- no more Softie stats ----------
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.11/0.38
% 0.11/0.38 Stopped by limit on number of solutions
% 0.11/0.38
% 0.11/0.38 =========== start of search ===========
% 0.46/0.67
% 0.46/0.67 -------- PROOF --------
% 0.46/0.67 % SZS status Unsatisfiable
% 0.46/0.67 % SZS output start Refutation
% 0.46/0.67
% 0.46/0.67 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Model 4 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 5 [ 1 1 26 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 6 [ 2 0 46 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 -----> EMPTY CLAUSE at 0.32 sec ----> 21 [hyper,18,7,17] {-} $F.
% 0.46/0.67
% 0.46/0.67 Length of proof is 5. Level of proof is 3.
% 0.46/0.67
% 0.46/0.67 ---------------- PROOF ----------------
% 0.46/0.67 % SZS status Unsatisfiable
% 0.46/0.67 % SZS output start Refutation
% 0.46/0.67
% 0.46/0.67 2 [] {+} -a_truth(truthteller(A))| -a_truth(says(A,B))|a_truth(B).
% 0.46/0.67 3 [] {+} -a_truth(liar(A))| -a_truth(says(A,B))| -a_truth(B).
% 0.46/0.67 4 [] {+} -a_truth(A)| -a_truth(says(B,A))|a_truth(truthteller(B)).
% 0.46/0.67 5 [] {+} a_truth(A)| -a_truth(says(B,A))|a_truth(liar(B)).
% 0.46/0.67 6 [] {+} -a_truth(truthteller(c)).
% 0.46/0.67 7 [factor,3.1.3] {+} -a_truth(liar(A))| -a_truth(says(A,liar(A))).
% 0.46/0.67 8 [factor,5.1.3] {+} a_truth(liar(A))| -a_truth(says(A,liar(A))).
% 0.46/0.67 9 [] {+} a_truth(truthteller(A))|a_truth(liar(A)).
% 0.46/0.67 11 [] {-} a_truth(says(b,says(a,liar(a)))).
% 0.46/0.67 12 [] {-} a_truth(says(c,liar(b))).
% 0.46/0.67 15 [hyper,12,4,9,unit_del,6] {+} a_truth(truthteller(b)).
% 0.46/0.67 17 [hyper,11,2,15] {-} a_truth(says(a,liar(a))).
% 0.46/0.67 18 [hyper,17,8] {+} a_truth(liar(a)).
% 0.46/0.67 21 [hyper,18,7,17] {-} $F.
% 0.46/0.67
% 0.46/0.67 % SZS output end Refutation
% 0.46/0.67 ------------ end of proof -------------
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Search stopped by max_proofs option.
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Search stopped by max_proofs option.
% 0.46/0.67
% 0.46/0.67 ============ end of search ============
% 0.46/0.67
% 0.46/0.67 ----------- soft-scott stats ----------
% 0.46/0.67
% 0.46/0.67 true clauses given 2 (20.0%)
% 0.46/0.67 false clauses given 8
% 0.46/0.67
% 0.46/0.67 FALSE TRUE
% 0.46/0.67 tot: 0 0 (-nan% true)
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Model 6 [ 2 0 46 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 That finishes the proof of the theorem.
% 0.46/0.67
% 0.46/0.67 Process 24055 finished Sat May 28 19:48:22 2022
%------------------------------------------------------------------------------