TSTP Solution File: PUZ025-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ025-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:59 EDT 2022
% Result : Unsatisfiable 0.71s 0.89s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PUZ025-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.33 % Computer : n029.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Sat May 28 23:11:43 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 ----- Otter 3.2, August 2001 -----
% 0.14/0.35 The process was started by sandbox2 on n029.cluster.edu,
% 0.14/0.35 Sat May 28 23:11:43 2022
% 0.14/0.35 The command was "./sos". The process ID is 19693.
% 0.14/0.35
% 0.14/0.35 set(prolog_style_variables).
% 0.14/0.35 set(auto).
% 0.14/0.35 dependent: set(auto1).
% 0.14/0.35 dependent: set(process_input).
% 0.14/0.35 dependent: clear(print_kept).
% 0.14/0.35 dependent: clear(print_new_demod).
% 0.14/0.35 dependent: clear(print_back_demod).
% 0.14/0.35 dependent: clear(print_back_sub).
% 0.14/0.35 dependent: set(control_memory).
% 0.14/0.35 dependent: assign(max_mem, 12000).
% 0.14/0.35 dependent: assign(pick_given_ratio, 4).
% 0.14/0.35 dependent: assign(stats_level, 1).
% 0.14/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.35 dependent: assign(sos_limit, 5000).
% 0.14/0.35 dependent: assign(max_weight, 60).
% 0.14/0.35 clear(print_given).
% 0.14/0.35
% 0.14/0.35 list(usable).
% 0.14/0.35
% 0.14/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.14/0.35
% 0.14/0.35 This is a non-Horn set without equality. The strategy
% 0.14/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.35
% 0.14/0.35 dependent: set(hyper_res).
% 0.14/0.35 dependent: set(factor).
% 0.14/0.35 dependent: set(unit_deletion).
% 0.14/0.35
% 0.14/0.35 ------------> process usable:
% 0.14/0.35
% 0.14/0.35 ------------> process sos:
% 0.14/0.35
% 0.14/0.35 ======= end of input processing =======
% 0.20/0.52
% 0.20/0.52 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.52
% 0.20/0.52 Stopped by limit on number of solutions
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 -------------- Softie stats --------------
% 0.20/0.52
% 0.20/0.52 UPDATE_STOP: 300
% 0.20/0.52 SFINDER_TIME_LIMIT: 2
% 0.20/0.52 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.52 number of clauses in intial UL: 23
% 0.20/0.52 number of clauses initially in problem: 30
% 0.20/0.52 percentage of clauses intially in UL: 76
% 0.20/0.52 percentage of distinct symbols occuring in initial UL: 76
% 0.20/0.52 percent of all initial clauses that are short: 100
% 0.20/0.52 absolute distinct symbol count: 13
% 0.20/0.52 distinct predicate count: 4
% 0.20/0.52 distinct function count: 4
% 0.20/0.52 distinct constant count: 5
% 0.20/0.52
% 0.20/0.52 ---------- no more Softie stats ----------
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Stopped by limit on insertions
% 0.20/0.52
% 0.20/0.52 =========== start of search ===========
% 0.71/0.89
% 0.71/0.89 -------- PROOF --------
% 0.71/0.89 % SZS status Unsatisfiable
% 0.71/0.89 % SZS output start Refutation
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 2 [ 3 1 397 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 3 [ 3 0 192 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 4 [ 3 0 722 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 5 [ 4 1 481 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 ----> UNIT CONFLICT at 0.51 sec ----> 78 [binary,77.1,17.1] {-} $F.
% 0.71/0.89
% 0.71/0.89 Length of proof is 4. Level of proof is 3.
% 0.71/0.89
% 0.71/0.89 ---------------- PROOF ----------------
% 0.71/0.89 % SZS status Unsatisfiable
% 0.71/0.89 % SZS output start Refutation
% 0.71/0.89
% 0.71/0.89 13 [] {+} -ask_1_if_2(A,B)| -a_truth(truthteller(A))| -a_truth(B)|answer(yes).
% 0.71/0.89 14 [] {+} -ask_1_if_2(A,B)| -a_truth(truthteller(A))|a_truth(B)|answer(no).
% 0.71/0.89 15 [] {+} -ask_1_if_2(A,B)| -a_truth(liar(A))| -a_truth(B)|answer(no).
% 0.71/0.89 16 [] {+} -ask_1_if_2(A,B)| -a_truth(liar(A))|a_truth(B)|answer(yes).
% 0.71/0.89 17 [] {+} -answer(A).
% 0.71/0.89 24 [] {-} a_truth(truthteller(A))|a_truth(liar(A)).
% 0.71/0.89 30 [] {-} ask_1_if_2(c,equal_type(a,b)).
% 0.71/0.89 35 [hyper,30,16,24,unit_del,17] {-} a_truth(equal_type(a,b))|a_truth(truthteller(c)).
% 0.71/0.89 48 [hyper,35,15,30,24,unit_del,17,factor_simp] {-} a_truth(truthteller(c)).
% 0.71/0.89 49 [hyper,35,14,30,unit_del,17,factor_simp] {+} a_truth(equal_type(a,b)).
% 0.71/0.89 77 [hyper,49,13,30,48] {-} answer(yes).
% 0.71/0.89 78 [binary,77.1,17.1] {-} $F.
% 0.71/0.89
% 0.71/0.89 % SZS output end Refutation
% 0.71/0.89 ------------ end of proof -------------
% 0.71/0.89
% 0.71/0.89
% 0.71/0.89 Search stopped by max_proofs option.
% 0.71/0.89
% 0.71/0.89
% 0.71/0.89 Search stopped by max_proofs option.
% 0.71/0.89
% 0.71/0.89 ============ end of search ============
% 0.71/0.89
% 0.71/0.89 ----------- soft-scott stats ----------
% 0.71/0.89
% 0.71/0.89 true clauses given 2 (16.7%)
% 0.71/0.89 false clauses given 10
% 0.71/0.89
% 0.71/0.89 FALSE TRUE
% 0.71/0.89 4 0 1
% 0.71/0.89 6 1 0
% 0.71/0.89 7 0 4
% 0.71/0.89 9 1 0
% 0.71/0.89 10 1 4
% 0.71/0.89 11 0 1
% 0.71/0.89 13 2 0
% 0.71/0.89 14 2 0
% 0.71/0.89 tot: 7 10 (58.8% true)
% 0.71/0.89
% 0.71/0.89
% 0.71/0.89 Model 5 [ 4 1 481 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 That finishes the proof of the theorem.
% 0.71/0.89
% 0.71/0.89 Process 19693 finished Sat May 28 23:11:43 2022
%------------------------------------------------------------------------------