TSTP Solution File: PHI022+1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : PHI022+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n019.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 16:48:50 EDT 2022

% Result   : Theorem 0.82s 1.05s
% Output   : Refutation 0.82s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PHI022+1 : TPTP v8.1.0. Released v7.4.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.14/0.33  % Computer : n019.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 : Thu Jun  2 01:49:10 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 sandbox on n019.cluster.edu,
% 0.14/0.35  Thu Jun  2 01:49:10 2022
% 0.14/0.35  The command was "./sos".  The process ID is 23952.
% 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  formula_list(usable).
% 0.14/0.35  
% 0.14/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.14/0.35  
% 0.14/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.14/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.35  clauses in usable.
% 0.14/0.35  
% 0.14/0.35     dependent: set(knuth_bendix).
% 0.14/0.35     dependent: set(para_from).
% 0.14/0.35     dependent: set(para_into).
% 0.14/0.35     dependent: clear(para_from_right).
% 0.14/0.35     dependent: clear(para_into_right).
% 0.14/0.35     dependent: set(para_from_vars).
% 0.14/0.35     dependent: set(eq_units_both_ways).
% 0.14/0.35     dependent: set(dynamic_demod_all).
% 0.14/0.35     dependent: set(dynamic_demod).
% 0.14/0.35     dependent: set(order_eq).
% 0.14/0.35     dependent: set(back_demod).
% 0.14/0.35     dependent: set(lrpo).
% 0.14/0.35     dependent: set(hyper_res).
% 0.14/0.35     dependent: set(unit_deletion).
% 0.14/0.35     dependent: set(factor).
% 0.14/0.35  
% 0.14/0.35  ------------> process usable:
% 0.14/0.35    Following clause subsumed by 40 during input processing: 0 [] {-} -exists(A)|existsIn(A,A)|A!=B.
% 0.14/0.35  
% 0.14/0.35  ------------> process sos:
% 0.14/0.35  60 back subsumes 43.
% 0.14/0.35    Following clause subsumed by 62 during input processing: 0 [copy,62,flip.1] {-} A=A.
% 0.14/0.35  
% 0.14/0.35  ======= end of input processing =======
% 0.14/0.38  
% 0.14/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.38  
% 0.14/0.38  Stopped by limit on number of solutions
% 0.14/0.38  
% 0.14/0.38  
% 0.14/0.38  -------------- Softie stats --------------
% 0.14/0.38  
% 0.14/0.38  UPDATE_STOP: 300
% 0.14/0.38  SFINDER_TIME_LIMIT: 2
% 0.14/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.38  number of clauses in intial UL: 56
% 0.14/0.38  number of clauses initially in problem: 59
% 0.14/0.38  percentage of clauses intially in UL: 94
% 0.14/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.38  percent of all initial clauses that are short: 100
% 0.14/0.38  absolute distinct symbol count: 50
% 0.14/0.38     distinct predicate count: 49
% 0.14/0.38     distinct function count: 0
% 0.14/0.38     distinct constant count: 1
% 0.14/0.38  
% 0.14/0.38  ---------- no more Softie stats ----------
% 0.14/0.38  
% 0.14/0.38  
% 0.14/0.38  
% 0.14/0.38  =========== start of search ===========
% 0.82/1.05  
% 0.82/1.05  -------- PROOF -------- 
% 0.82/1.05  % SZS status Theorem
% 0.82/1.05  % SZS output start Refutation
% 0.82/1.05  
% 0.82/1.05  Stopped by limit on insertions
% 0.82/1.05  
% 0.82/1.05  Model 2 [ 1 1 683 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.05  
% 0.82/1.05  Stopped by limit on insertions
% 0.82/1.05  
% 0.82/1.05  Model 3 [ 2 0 735 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.05  
% 0.82/1.05  Stopped by limit on insertions
% 0.82/1.05  
% 0.82/1.05  Model 4 [ 2 0 1374 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.05  
% 0.82/1.05  Stopped by limit on insertions
% 0.82/1.05  
% 0.82/1.05  Model 5 [ 3 1 967 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.05  
% 0.82/1.05  Stopped by limit on insertions
% 0.82/1.05  
% 0.82/1.05  Model 6 [ 3 0 1240 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.05  
% 0.82/1.05  Stopped by limit on insertions
% 0.82/1.05  
% 0.82/1.05  Model 7 [ 4 1 730 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.05  
% 0.82/1.05  ----> UNIT CONFLICT at   0.67 sec ----> 77 [binary,76.1,58.1] {-} $F.
% 0.82/1.05  
% 0.82/1.05  Length of proof is 6.  Level of proof is 4.
% 0.82/1.05  
% 0.82/1.05  ---------------- PROOF ----------------
% 0.82/1.05  % SZS status Theorem
% 0.82/1.05  % SZS output start Refutation
% 0.82/1.05  
% 0.82/1.05  1 [] {+} -selfCaused(A)|essenceInvExistence(A).
% 0.82/1.05  7 [] {+} -substance(A)|inItself(A).
% 0.82/1.05  54 [] {+} -substance(A)|being(A).
% 0.82/1.05  55 [] {+} -inItself(A)|selfCaused(A).
% 0.82/1.05  56 [] {+} -being(A)|hasEssence(A).
% 0.82/1.05  57 [] {+} -essenceInvExistence(A)| -hasEssence(A)|exists(A).
% 0.82/1.05  58 [] {+} -exists($c1).
% 0.82/1.05  61 [] {-} substance($c1).
% 0.82/1.05  63 [hyper,61,54] {+} being($c1).
% 0.82/1.05  65 [hyper,61,7] {+} inItself($c1).
% 0.82/1.05  67 [hyper,63,56] {+} hasEssence($c1).
% 0.82/1.05  69 [hyper,65,55] {+} selfCaused($c1).
% 0.82/1.05  73 [hyper,69,1] {+} essenceInvExistence($c1).
% 0.82/1.05  76 [hyper,73,57,67] {-} exists($c1).
% 0.82/1.05  77 [binary,76.1,58.1] {-} $F.
% 0.82/1.05  
% 0.82/1.05  % SZS output end Refutation
% 0.82/1.05  ------------ end of proof -------------
% 0.82/1.05  
% 0.82/1.05  
% 0.82/1.05  Search stopped by max_proofs option.
% 0.82/1.05  
% 0.82/1.05  
% 0.82/1.05  Search stopped by max_proofs option.
% 0.82/1.05  
% 0.82/1.05  ============ end of search ============
% 0.82/1.05  
% 0.82/1.05  ----------- soft-scott stats ----------
% 0.82/1.05  
% 0.82/1.05  true clauses given           2      (22.2%)
% 0.82/1.05  false clauses given          7
% 0.82/1.05  
% 0.82/1.05        FALSE     TRUE
% 0.82/1.05     2  0         1
% 0.82/1.05     5  0         6
% 0.82/1.05  tot:  0         7      (100.0% true)
% 0.82/1.05  
% 0.82/1.05  
% 0.82/1.05  Model 7 [ 4 1 730 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.05  
% 0.82/1.05  That finishes the proof of the theorem.
% 0.82/1.05  
% 0.82/1.05  Process 23952 finished Thu Jun  2 01:49:11 2022
%------------------------------------------------------------------------------