%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS139+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:52 EDT 2022
% Result : Theorem 0.19s 0.53s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS139+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n028.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 13:51:15 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 n028.cluster.edu,
% 0.13/0.35 Tue Jun 7 13:51:15 2022
% 0.13/0.35 The command was "./sos". The process ID is 10432.
% 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=7.
% 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 Following clause subsumed by 8 during input processing: 0 [] {-} cowlThing(iAntwerp).
% 0.13/0.35 Following clause subsumed by 8 during input processing: 0 [] {-} cowlThing(iGhent).
% 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: 5
% 0.13/0.39 number of clauses initially in problem: 8
% 0.13/0.39 percentage of clauses intially in UL: 62
% 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: 5
% 0.13/0.39 distinct function count: 0
% 0.13/0.39 distinct constant count: 4
% 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.53
% 0.19/0.53 -------- PROOF --------
% 0.19/0.53 % SZS status Theorem
% 0.19/0.53 % SZS output start Refutation
% 0.19/0.53
% 0.19/0.53 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.53
% 0.19/0.53 Stopped by limit on number of solutions
% 0.19/0.53
% 0.19/0.53 Model 4 [ 1 1 31 ] (0.00 seconds, 26095 Inserts)
% 0.19/0.53
% 0.19/0.53 Model 5 [ 1 1 87 ] (0.00 seconds, 25186 Inserts)
% 0.19/0.53
% 0.19/0.53 Model 6 [ 1 0 96 ] (0.00 seconds, 14333 Inserts)
% 0.19/0.53
% 0.19/0.53 Model 7 [ 2 1 115 ] (0.00 seconds, 15047 Inserts)
% 0.19/0.53
% 0.19/0.53 -----> EMPTY CLAUSE at 0.13 sec ----> 14 [hyper,13,2,12] {-} $F.
% 0.19/0.53
% 0.19/0.53 Length of proof is 5. Level of proof is 3.
% 0.19/0.53
% 0.19/0.53 ---------------- PROOF ----------------
% 0.19/0.53 % SZS status Theorem
% 0.19/0.53 % SZS output start Refutation
% 0.19/0.53
% 0.19/0.53 1 [] {+} -cowlNothing(A).
% 0.19/0.53 2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.19/0.53 3 [] {+} -rpath(A,B)|rpath(B,A).
% 0.19/0.53 4 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(iAntwerp)| -rpath(iAntwerp,iGhent)| -cowlThing(iGhent).
% 0.19/0.53 5 [copy,4,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(iAntwerp)| -rpath(iAntwerp,iGhent)| -cowlThing(iGhent).
% 0.19/0.53 6 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(iAntwerp)| -rpath(iAntwerp,iGhent)| -cowlThing(iGhent).
% 0.19/0.53 7 [copy,6,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(iAntwerp)| -rpath(iAntwerp,iGhent)| -cowlThing(iGhent).
% 0.19/0.53 8 [] {+} cowlThing(A).
% 0.19/0.53 9 [] {+} xsd_string(A)|xsd_integer(A).
% 0.19/0.53 10 [] {+} rpath(iGhent,iAntwerp).
% 0.19/0.53 11 [hyper,10,3] {+} rpath(iAntwerp,iGhent).
% 0.19/0.53 12 [hyper,11,7,8,9,8,8,factor_simp] {+} xsd_integer($c2).
% 0.19/0.53 13 [hyper,12,5,8,8,11,8] {+} xsd_string($c2).
% 0.19/0.53 14 [hyper,13,2,12] {-} $F.
% 0.19/0.53
% 0.19/0.53 % SZS output end Refutation
% 0.19/0.53 ------------ end of proof -------------
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Search stopped by max_proofs option.
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Search stopped by max_proofs option.
% 0.19/0.53
% 0.19/0.53 ============ end of search ============
% 0.19/0.53
% 0.19/0.53 ----------- soft-scott stats ----------
% 0.19/0.53
% 0.19/0.53 true clauses given 0 (0.0%)
% 0.19/0.53 false clauses given 6
% 0.19/0.53
% 0.19/0.53 FALSE TRUE
% 0.19/0.53 tot: 0 0 (-nan% true)
% 0.19/0.53
% 0.19/0.53
% 0.19/0.53 Model 7 [ 2 1 115 ] (0.00 seconds, 15047 Inserts)
% 0.19/0.53
% 0.19/0.53 That finishes the proof of the theorem.
% 0.19/0.53
% 0.19/0.53 Process 10432 finished Tue Jun 7 13:51:15 2022
%------------------------------------------------------------------------------