TSTP Solution File: PLA031-1.003 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : PLA031-1.003 : TPTP v8.1.0. Released v3.5.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 17:32:13 EDT 2022

% Result   : Unsatisfiable 58.55s 58.77s
% Output   : Refutation 58.55s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : PLA031-1.003 : TPTP v8.1.0. Released v3.5.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 : Tue May 31 20:41:44 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.09/0.30  ----- Otter 3.2, August 2001 -----
% 0.09/0.30  The process was started by sandbox2 on n032.cluster.edu,
% 0.09/0.30  Tue May 31 20:41:44 2022
% 0.09/0.30  The command was "./sos".  The process ID is 21391.
% 0.09/0.30  
% 0.09/0.30  set(prolog_style_variables).
% 0.09/0.30  set(auto).
% 0.09/0.30     dependent: set(auto1).
% 0.09/0.30     dependent: set(process_input).
% 0.09/0.30     dependent: clear(print_kept).
% 0.09/0.30     dependent: clear(print_new_demod).
% 0.09/0.30     dependent: clear(print_back_demod).
% 0.09/0.30     dependent: clear(print_back_sub).
% 0.09/0.30     dependent: set(control_memory).
% 0.09/0.30     dependent: assign(max_mem, 12000).
% 0.09/0.30     dependent: assign(pick_given_ratio, 4).
% 0.09/0.30     dependent: assign(stats_level, 1).
% 0.09/0.30     dependent: assign(pick_semantic_ratio, 3).
% 0.09/0.30     dependent: assign(sos_limit, 5000).
% 0.09/0.30     dependent: assign(max_weight, 60).
% 0.09/0.30  clear(print_given).
% 0.09/0.30  
% 0.09/0.30  list(usable).
% 0.09/0.30  
% 0.09/0.30  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.09/0.30  
% 0.09/0.30  This is a Horn set without equality.  The strategy will
% 0.09/0.30  be hyperresolution, with satellites in sos and nuclei
% 0.09/0.30  in usable.
% 0.09/0.30  
% 0.09/0.30     dependent: set(hyper_res).
% 0.09/0.30     dependent: clear(order_hyper).
% 0.09/0.30  
% 0.09/0.30  ------------> process usable:
% 0.09/0.30  
% 0.09/0.30  ------------> process sos:
% 0.09/0.30  
% 0.09/0.30  ======= end of input processing =======
% 0.13/0.32  
% 0.13/0.32  
% 0.13/0.32  Failed to model usable list: disabling FINDER
% 0.13/0.32  
% 0.13/0.32  
% 0.13/0.32  
% 0.13/0.32  -------------- Softie stats --------------
% 0.13/0.32  
% 0.13/0.32  UPDATE_STOP: 300
% 0.13/0.32  SFINDER_TIME_LIMIT: 2
% 0.13/0.32  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.32  number of clauses in intial UL: 39
% 0.13/0.32  number of clauses initially in problem: 112
% 0.13/0.32  percentage of clauses intially in UL: 34
% 0.13/0.32  percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.32  percent of all initial clauses that are short: 100
% 0.13/0.32  absolute distinct symbol count: 12
% 0.13/0.32     distinct predicate count: 4
% 0.13/0.32     distinct function count: 0
% 0.13/0.32     distinct constant count: 8
% 0.13/0.32  
% 0.13/0.32  ---------- no more Softie stats ----------
% 0.13/0.32  
% 0.13/0.32  
% 0.13/0.32  
% 0.13/0.32  =========== start of search ===========
% 1.73/1.94  
% 1.73/1.94  
% 1.73/1.94  Changing weight limit from 60 to 9.
% 1.73/1.94  
% 1.73/1.94  Modelling stopped after 300 given clauses and 0.00 seconds
% 1.73/1.94  
% 1.73/1.94  
% 1.73/1.94  Resetting weight limit to 9 after 5325 givens.
% 1.73/1.94  
% 58.55/58.77  
% 58.55/58.77  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 58.55/58.77  
% 58.55/58.77  ----> UNIT CONFLICT at  58.06 sec ----> 115785 [binary,115784.1,39.1] {-} $F.
% 58.55/58.77  
% 58.55/58.77  Length of proof is 17.  Level of proof is 17.
% 58.55/58.77  
% 58.55/58.77  ---------------- PROOF ----------------
% 58.55/58.77  % SZS status Unsatisfiable
% 58.55/58.77  % SZS output start Refutation
% 58.55/58.77  
% 58.55/58.77  1 [] {+} -s(A,B,C,D,E,F,A,G)|s(truck1,B,C,D,E,F,A,G).
% 58.55/58.77  2 [] {+} s(A,B,C,D,E,F,A,G)| -s(truck1,B,C,D,E,F,A,G).
% 58.55/58.77  9 [] {+} -s(A,B,C,D,E,F,C,G)|s(A,B,truck1,D,E,F,C,G).
% 58.55/58.77  10 [] {+} s(A,B,C,D,E,F,C,G)| -s(A,B,truck1,D,E,F,C,G).
% 58.55/58.77  13 [] {+} -s(A,B,C,D,E,F,D,G)|s(A,B,C,truck1,E,F,D,G).
% 58.55/58.77  14 [] {+} s(A,B,C,D,E,F,D,G)| -s(A,B,C,truck1,E,F,D,G).
% 58.55/58.77  19 [] {+} -s(A,B,C,D,E,F,G,E)| -neq(F,truck2)|s(A,B,C,D,truck2,F,G,E).
% 58.55/58.77  20 [] {+} s(A,B,C,D,E,F,G,E)| -s(A,B,C,D,truck2,F,G,E).
% 58.55/58.77  21 [] {+} -s(A,B,C,D,E,F,F,G)| -neq(E,truck1)|s(A,B,C,D,E,truck1,F,G).
% 58.55/58.77  27 [] {+} -s(A,B,C,D,E,truck1,F,G)| -link(F,H)|s(A,B,C,D,E,truck1,H,G).
% 58.55/58.77  29 [] {+} -s(A,B,C,D,E,F,G,H)| -path(E,I)|s(A,B,C,D,I,F,G,H).
% 58.55/58.77  30 [] {+} -s(A,B,C,D,E,F,G,H)| -path(F,I)|s(A,B,C,D,E,I,G,H).
% 58.55/58.77  39 [] {+} -s(s2,s2,s0,s2,s1,A,s0,B).
% 58.55/58.77  40 [] {-} neq(truck1,truck2).
% 58.55/58.77  61 [] {-} neq(s1,truck1).
% 58.55/58.77  96 [] {-} path(s0,p0_1).
% 58.55/58.77  99 [] {-} path(p0_1,s1).
% 58.55/58.77  101 [] {-} path(p1_2,s1).
% 58.55/58.77  102 [] {-} path(s2,p1_2).
% 58.55/58.77  108 [] {-} link(s1,s2).
% 58.55/58.77  110 [] {-} link(s2,s0).
% 58.55/58.77  111 [] {-} link(s0,s2).
% 58.55/58.77  112 [] {-} s(s1,s2,s2,s0,s2,s0,s1,s1).
% 58.55/58.77  114 [hyper,112,30,96] {-} s(s1,s2,s2,s0,s2,p0_1,s1,s1).
% 58.55/58.77  124 [hyper,114,30,99] {-} s(s1,s2,s2,s0,s2,s1,s1,s1).
% 58.55/58.77  147 [hyper,124,29,102] {-} s(s1,s2,s2,s0,p1_2,s1,s1,s1).
% 58.55/58.77  187 [hyper,147,29,101] {-} s(s1,s2,s2,s0,s1,s1,s1,s1).
% 58.55/58.77  246 [hyper,187,21,61] {-} s(s1,s2,s2,s0,s1,truck1,s1,s1).
% 58.55/58.77  343 [hyper,246,19,40] {-} s(s1,s2,s2,s0,truck2,truck1,s1,s1).
% 58.55/58.77  586 [hyper,343,1] {-} s(truck1,s2,s2,s0,truck2,truck1,s1,s1).
% 58.55/58.77  1204 [hyper,586,27,108] {-} s(truck1,s2,s2,s0,truck2,truck1,s2,s1).
% 58.55/58.77  2597 [hyper,1204,9] {-} s(truck1,s2,truck1,s0,truck2,truck1,s2,s1).
% 58.55/58.77  5399 [hyper,2597,2] {-} s(s2,s2,truck1,s0,truck2,truck1,s2,s1).
% 58.55/58.77  10454 [hyper,5399,27,110] {-} s(s2,s2,truck1,s0,truck2,truck1,s0,s1).
% 58.55/58.77  24372 [hyper,10454,13] {-} s(s2,s2,truck1,truck1,truck2,truck1,s0,s1).
% 58.55/58.77  39751 [hyper,24372,27,111] {-} s(s2,s2,truck1,truck1,truck2,truck1,s2,s1).
% 58.55/58.77  57733 [hyper,39751,14] {-} s(s2,s2,truck1,s2,truck2,truck1,s2,s1).
% 58.55/58.77  76195 [hyper,57733,20] {-} s(s2,s2,truck1,s2,s1,truck1,s2,s1).
% 58.55/58.77  95627 [hyper,76195,27,110] {-} s(s2,s2,truck1,s2,s1,truck1,s0,s1).
% 58.55/58.77  115784 [hyper,95627,10] {-} s(s2,s2,s0,s2,s1,truck1,s0,s1).
% 58.55/58.77  115785 [binary,115784.1,39.1] {-} $F.
% 58.55/58.77  
% 58.55/58.77  % SZS output end Refutation
% 58.55/58.77  ------------ end of proof -------------
% 58.55/58.77  
% 58.55/58.77  
% 58.55/58.77  Search stopped by max_proofs option.
% 58.55/58.77  
% 58.55/58.77  
% 58.55/58.77  Search stopped by max_proofs option.
% 58.55/58.77  
% 58.55/58.77  ============ end of search ============
% 58.55/58.77  
% 58.55/58.77  That finishes the proof of the theorem.
% 58.55/58.77  
% 58.55/58.77  Process 21391 finished Tue May 31 20:42:42 2022
%------------------------------------------------------------------------------