TSTP Solution File: PUZ008-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:57 EDT 2022
% Result : Unsatisfiable 0.49s 0.68s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : PUZ008-3 : TPTP v8.1.0. Released v1.2.0.
% 0.03/0.11 % Command : sos-script %s
% 0.11/0.32 % Computer : n023.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 : Sun May 29 01:28:42 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 sandbox on n023.cluster.edu,
% 0.11/0.34 Sun May 29 01:28:42 2022
% 0.11/0.34 The command was "./sos". The process ID is 31076.
% 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=1, equality=0, symmetry=0, max_lits=4.
% 0.11/0.34
% 0.11/0.34 This is a Horn set without equality. The strategy will
% 0.11/0.34 be hyperresolution, with satellites in sos and nuclei
% 0.11/0.34 in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: clear(order_hyper).
% 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.17/0.50
% 0.17/0.50 Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.50
% 0.17/0.50 Stopped by limit on number of solutions
% 0.17/0.50
% 0.17/0.50
% 0.17/0.50 -------------- Softie stats --------------
% 0.17/0.50
% 0.17/0.50 UPDATE_STOP: 300
% 0.17/0.50 SFINDER_TIME_LIMIT: 2
% 0.17/0.50 SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.50 number of clauses in intial UL: 13
% 0.17/0.50 number of clauses initially in problem: 16
% 0.17/0.50 percentage of clauses intially in UL: 81
% 0.17/0.50 percentage of distinct symbols occuring in initial UL: 100
% 0.17/0.50 percent of all initial clauses that are short: 93
% 0.17/0.50 absolute distinct symbol count: 11
% 0.17/0.50 distinct predicate count: 3
% 0.17/0.50 distinct function count: 5
% 0.17/0.50 distinct constant count: 3
% 0.17/0.50
% 0.17/0.50 ---------- no more Softie stats ----------
% 0.17/0.50
% 0.17/0.50
% 0.17/0.50
% 0.17/0.50 Stopped by limit on insertions
% 0.17/0.50
% 0.17/0.50 =========== start of search ===========
% 0.49/0.68
% 0.49/0.68 -------- PROOF --------
% 0.49/0.68 % SZS status Unsatisfiable
% 0.49/0.68 % SZS output start Refutation
% 0.49/0.68
% 0.49/0.68 Stopped by limit on insertions
% 0.49/0.68
% 0.49/0.68 Stopped by limit on insertions
% 0.49/0.68
% 0.49/0.68 Model 2 [ 2 1 99 ] (0.00 seconds, 250000 Inserts)
% 0.49/0.68
% 0.49/0.68 ----> UNIT CONFLICT at 0.31 sec ----> 45 [binary,44.1,13.1] {+} $F.
% 0.49/0.68
% 0.49/0.68 Length of proof is 18. Level of proof is 13.
% 0.49/0.68
% 0.49/0.68 ---------------- PROOF ----------------
% 0.49/0.68 % SZS status Unsatisfiable
% 0.49/0.68 % SZS output start Refutation
% 0.49/0.68
% 0.49/0.68 1 [] {+} -greater_or_equal(A,B)|safe(A,B).
% 0.49/0.68 2 [] {+} greater_or_equal(s(A),s(B))| -greater_or_equal(A,B).
% 0.49/0.68 4 [] {+} -achievable(west(m(A),c(B)),boatoneast,east(m(C),c(s(D))))| -safe(A,s(B))| -safe(C,D)|achievable(west(m(A),c(s(B))),boatonwest,east(m(C),c(D))).
% 0.49/0.68 5 [] {+} -achievable(west(m(A),c(s(s(B)))),boatonwest,east(m(C),c(D)))| -safe(A,B)| -safe(C,s(s(D)))|achievable(west(m(A),c(B)),boatoneast,east(m(C),c(s(s(D))))).
% 0.49/0.68 8 [] {+} -achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(D)))| -safe(s(A),B)| -safe(C,D)|achievable(west(m(s(A)),c(B)),boatonwest,east(m(C),c(D))).
% 0.49/0.68 9 [] {+} -achievable(west(m(s(s(A))),c(B)),boatonwest,east(m(C),c(D)))| -safe(A,B)| -safe(s(s(C)),D)|achievable(west(m(A),c(B)),boatoneast,east(m(s(s(C))),c(D))).
% 0.49/0.68 11 [] {+} -achievable(west(m(s(A)),c(s(B))),boatonwest,east(m(C),c(D)))| -safe(A,B)| -safe(s(C),s(D))|achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(s(D)))).
% 0.49/0.68 12 [] {+} -achievable(west(m(A),c(B)),boatoneast,east(m(s(C)),c(s(D))))| -safe(s(A),s(B))| -safe(C,D)|achievable(west(m(s(A)),c(s(B))),boatonwest,east(m(C),c(D))).
% 0.49/0.68 13 [] {+} -achievable(west(m(n0),c(n0)),A,east(m(s(s(s(n0)))),c(s(s(s(n0)))))).
% 0.49/0.68 14 [] {-} safe(n0,A).
% 0.49/0.68 15 [] {-} greater_or_equal(A,n0).
% 0.49/0.68 16 [] {-} achievable(west(m(s(s(s(n0)))),c(s(s(s(n0))))),boatonwest,east(m(n0),c(n0))).
% 0.49/0.68 17 [hyper,15,2] {+} greater_or_equal(s(A),s(n0)).
% 0.49/0.68 18 [hyper,15,1] {+} safe(A,n0).
% 0.49/0.68 19 [hyper,17,2] {+} greater_or_equal(s(s(A)),s(s(n0))).
% 0.49/0.68 20 [hyper,17,1] {+} safe(s(A),s(n0)).
% 0.49/0.68 21 [hyper,19,2] {+} greater_or_equal(s(s(s(A))),s(s(s(n0)))).
% 0.49/0.68 22 [hyper,19,1] {+} safe(s(s(A)),s(s(n0))).
% 0.49/0.68 23 [hyper,20,5,16,14] {-} achievable(west(m(s(s(s(n0)))),c(s(n0))),boatoneast,east(m(n0),c(s(s(n0))))).
% 0.49/0.68 25 [hyper,22,4,23,14] {-} achievable(west(m(s(s(s(n0)))),c(s(s(n0)))),boatonwest,east(m(n0),c(s(n0)))).
% 0.49/0.68 28 [hyper,21,1] {+} safe(s(s(s(A))),s(s(s(n0)))).
% 0.49/0.68 29 [hyper,25,5,18,14] {-} achievable(west(m(s(s(s(n0)))),c(n0)),boatoneast,east(m(n0),c(s(s(s(n0)))))).
% 0.49/0.68 30 [hyper,29,4,20,14] {-} achievable(west(m(s(s(s(n0)))),c(s(n0))),boatonwest,east(m(n0),c(s(s(n0))))).
% 0.49/0.68 33 [hyper,30,9,20,22] {-} achievable(west(m(s(n0)),c(s(n0))),boatoneast,east(m(s(s(n0))),c(s(s(n0))))).
% 0.49/0.68 34 [hyper,33,12,22,20] {-} achievable(west(m(s(s(n0))),c(s(s(n0)))),boatonwest,east(m(s(n0)),c(s(n0)))).
% 0.49/0.68 35 [hyper,34,9,14,20] {-} achievable(west(m(n0),c(s(s(n0)))),boatoneast,east(m(s(s(s(n0)))),c(s(n0)))).
% 0.49/0.68 38 [hyper,35,4,14,18] {-} achievable(west(m(n0),c(s(s(s(n0))))),boatonwest,east(m(s(s(s(n0)))),c(n0))).
% 0.49/0.68 39 [hyper,38,5,14,22] {-} achievable(west(m(n0),c(s(n0))),boatoneast,east(m(s(s(s(n0)))),c(s(s(n0))))).
% 0.49/0.68 40 [hyper,39,8,20,22] {-} achievable(west(m(s(n0)),c(s(n0))),boatonwest,east(m(s(s(n0))),c(s(s(n0))))).
% 0.49/0.68 44 [hyper,40,11,18,28] {-} achievable(west(m(n0),c(n0)),boatoneast,east(m(s(s(s(n0)))),c(s(s(s(n0)))))).
% 0.49/0.68 45 [binary,44.1,13.1] {+} $F.
% 0.49/0.68
% 0.49/0.68 % SZS output end Refutation
% 0.49/0.68 ------------ end of proof -------------
% 0.49/0.68
% 0.49/0.68
% 0.49/0.68 Search stopped by max_proofs option.
% 0.49/0.68
% 0.49/0.68
% 0.49/0.68 Search stopped by max_proofs option.
% 0.49/0.68
% 0.49/0.68 ============ end of search ============
% 0.49/0.68
% 0.49/0.68 ----------- soft-scott stats ----------
% 0.49/0.68
% 0.49/0.68 true clauses given 11 (40.7%)
% 0.49/0.68 false clauses given 16
% 0.49/0.68
% 0.49/0.68 FALSE TRUE
% 0.49/0.68 15 0 1
% 0.49/0.68 17 0 1
% 0.49/0.68 18 1 0
% 0.49/0.68 tot: 1 2 (66.7% true)
% 0.49/0.68
% 0.49/0.68
% 0.49/0.68 Model 2 [ 2 1 99 ] (0.00 seconds, 250000 Inserts)
% 0.49/0.68
% 0.49/0.68 That finishes the proof of the theorem.
% 0.49/0.68
% 0.49/0.68 Process 31076 finished Sun May 29 01:28:43 2022
%------------------------------------------------------------------------------