↑ Up

SOS---2.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : KRS166+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n021.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 : Sun Jul 17 03:29:56 EDT 2022

% Result   : Theorem 0.19s 0.41s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : KRS166+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12  % Command  : sos-script %s
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun  7 19:18:06 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox on n021.cluster.edu,
% 0.13/0.35  Tue Jun  7 19:18:06 2022
% 0.13/0.35  The command was "./sos".  The process ID is 8501.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  formula_list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.13/0.35  
% 0.13/0.35  This is a non-Horn set without equality.  The strategy
% 0.13/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: set(factor).
% 0.13/0.35     dependent: set(unit_deletion).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.13/0.39  
% 0.13/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39  
% 0.13/0.39  Stopped by limit on number of solutions
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  -------------- Softie stats --------------
% 0.13/0.39  
% 0.13/0.39  UPDATE_STOP: 300
% 0.13/0.39  SFINDER_TIME_LIMIT: 2
% 0.13/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39  number of clauses in intial UL: 8
% 0.13/0.39  number of clauses initially in problem: 10
% 0.13/0.39  percentage of clauses intially in UL: 80
% 0.13/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.39  percent of all initial clauses that are short: 100
% 0.13/0.39  absolute distinct symbol count: 9
% 0.13/0.39     distinct predicate count: 6
% 0.13/0.39     distinct function count: 0
% 0.13/0.39     distinct constant count: 3
% 0.13/0.39  
% 0.13/0.39  ---------- no more Softie stats ----------
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  
% 0.13/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39  
% 0.13/0.39  Stopped by limit on number of solutions
% 0.13/0.39  
% 0.13/0.39  =========== start of search ===========
% 0.19/0.41  
% 0.19/0.41  -------- PROOF -------- 
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  % SZS output start Refutation
% 0.19/0.41  
% 0.19/0.41  Model 3 [ 1 1 80 ] (0.00 seconds, 1575 Inserts)
% 0.19/0.41  
% 0.19/0.41  Model 4 [ 1 1 60 ] (0.00 seconds, 1038 Inserts)
% 0.19/0.41  
% 0.19/0.41  Model 5 [ 1 0 60 ] (0.00 seconds, 1013 Inserts)
% 0.19/0.41  
% 0.19/0.41  -----> EMPTY CLAUSE at   0.03 sec ----> 22 [hyper,21,2,20] {-} $F.
% 0.19/0.41  
% 0.19/0.41  Length of proof is 11.  Level of proof is 8.
% 0.19/0.41  
% 0.19/0.41  ---------------- PROOF ----------------
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  % SZS output start Refutation
% 0.19/0.41  
% 0.19/0.41  1 [] {+} -cowlNothing(A).
% 0.19/0.41  2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.19/0.41  3 [] {+} -cAutomobile(A)|cCar(A).
% 0.19/0.41  4 [] {+} -cCar(A)|cAutomobile(A).
% 0.19/0.41  5 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|cCar($c3)|cAutomobile($c3).
% 0.19/0.41  6 [copy,5,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|cCar($c3)|cAutomobile($c3).
% 0.19/0.41  7 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cCar($c3)| -cAutomobile($c3).
% 0.19/0.41  8 [copy,7,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cCar($c3)| -cAutomobile($c3).
% 0.19/0.41  9 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|cCar($c3)|cAutomobile($c3).
% 0.19/0.41  10 [copy,9,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|cCar($c3)|cAutomobile($c3).
% 0.19/0.41  11 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cCar($c3)| -cAutomobile($c3).
% 0.19/0.41  12 [copy,11,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cCar($c3)| -cAutomobile($c3).
% 0.19/0.41  13 [] {+} cowlThing(A).
% 0.19/0.41  14 [] {+} xsd_string(A)|xsd_integer(A).
% 0.19/0.41  15 [hyper,14,10,13,factor_simp] {+} xsd_integer($c2)|cCar($c3)|cAutomobile($c3).
% 0.19/0.41  16 [hyper,15,6,13,factor_simp,factor_simp] {-} cCar($c3)|cAutomobile($c3)|xsd_string($c2).
% 0.19/0.41  17 [hyper,16,2,15,factor_simp,factor_simp] {+} cCar($c3)|cAutomobile($c3).
% 0.19/0.41  18 [hyper,17,4,factor_simp] {+} cAutomobile($c3).
% 0.19/0.41  19 [hyper,18,3] {+} cCar($c3).
% 0.19/0.41  20 [hyper,19,12,13,14,18,factor_simp] {+} xsd_integer($c2).
% 0.19/0.41  21 [hyper,20,8,13,19,18] {+} xsd_string($c2).
% 0.19/0.41  22 [hyper,21,2,20] {-} $F.
% 0.19/0.41  
% 0.19/0.41  % SZS output end Refutation
% 0.19/0.41  ------------ end of proof -------------
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Search stopped by max_proofs option.
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Search stopped by max_proofs option.
% 0.19/0.41  
% 0.19/0.41  ============ end of search ============
% 0.19/0.41  
% 0.19/0.41  ----------- soft-scott stats ----------
% 0.19/0.41  
% 0.19/0.41  true clauses given           4      (44.4%)
% 0.19/0.41  false clauses given          5
% 0.19/0.41  
% 0.19/0.41        FALSE     TRUE
% 0.19/0.41  tot:  0         0      (-nan% true)
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Model 5 [ 1 0 60 ] (0.00 seconds, 1013 Inserts)
% 0.19/0.41  
% 0.19/0.41  That finishes the proof of the theorem.
% 0.19/0.41  
% 0.19/0.41  Process 8501 finished Tue Jun  7 19:18:06 2022
%------------------------------------------------------------------------------