TSTP Solution File: KRS169+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS169+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:56 EDT 2022
% Result : Theorem 0.67s 0.87s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS169+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 13:25:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n028.cluster.edu,
% 0.12/0.35 Tue Jun 7 13:25:30 2022
% 0.12/0.35 The command was "./sos". The process ID is 25211.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=7.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 9 during input processing: 0 [] {-} cowlThing(iX).
% 0.12/0.35 Following clause subsumed by 9 during input processing: 0 [] {-} cowlThing(iY).
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 6
% 0.19/0.39 number of clauses initially in problem: 9
% 0.19/0.39 percentage of clauses intially in UL: 66
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 10
% 0.19/0.39 distinct predicate count: 6
% 0.19/0.39 distinct function count: 0
% 0.19/0.39 distinct constant count: 4
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.67/0.87
% 0.67/0.87 -------- PROOF --------
% 0.67/0.87 % SZS status Theorem
% 0.67/0.87 % SZS output start Refutation
% 0.67/0.87
% 0.67/0.87 Model 3 (0.00 seconds, 0 Inserts)
% 0.67/0.87
% 0.67/0.87 Stopped by limit on number of solutions
% 0.67/0.87
% 0.67/0.87 Model 4 [ 1 1 41 ] (0.00 seconds, 212562 Inserts)
% 0.67/0.87
% 0.67/0.87 Model 5 [ 1 1 145 ] (0.00 seconds, 212845 Inserts)
% 0.67/0.87
% 0.67/0.87 Model 6 [ 1 0 135 ] (0.00 seconds, 121039 Inserts)
% 0.67/0.87
% 0.67/0.87 Model 7 [ 2 1 107 ] (0.00 seconds, 126422 Inserts)
% 0.67/0.87
% 0.67/0.87 -----> EMPTY CLAUSE at 0.48 sec ----> 15 [hyper,14,2,13] {-} $F.
% 0.67/0.87
% 0.67/0.87 Length of proof is 5. Level of proof is 3.
% 0.67/0.87
% 0.67/0.87 ---------------- PROOF ----------------
% 0.67/0.87 % SZS status Theorem
% 0.67/0.87 % SZS output start Refutation
% 0.67/0.87
% 0.67/0.87 1 [] {+} -cowlNothing(A).
% 0.67/0.87 2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.67/0.87 3 [] {+} -rhasLeader(A,B)|rhasHead(A,B).
% 0.67/0.87 5 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(iX)| -rhasHead(iX,iY)| -cowlThing(iY).
% 0.67/0.87 6 [copy,5,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(iX)| -rhasHead(iX,iY)| -cowlThing(iY).
% 0.67/0.87 7 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(iX)| -rhasHead(iX,iY)| -cowlThing(iY).
% 0.67/0.87 8 [copy,7,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(iX)| -rhasHead(iX,iY)| -cowlThing(iY).
% 0.67/0.87 9 [] {+} cowlThing(A).
% 0.67/0.87 10 [] {+} xsd_string(A)|xsd_integer(A).
% 0.67/0.87 11 [] {+} rhasLeader(iX,iY).
% 0.67/0.87 12 [hyper,11,3] {+} rhasHead(iX,iY).
% 0.67/0.87 13 [hyper,12,8,9,10,9,9,factor_simp] {+} xsd_integer($c2).
% 0.67/0.87 14 [hyper,13,6,9,9,12,9] {+} xsd_string($c2).
% 0.67/0.87 15 [hyper,14,2,13] {-} $F.
% 0.67/0.87
% 0.67/0.87 % SZS output end Refutation
% 0.67/0.87 ------------ end of proof -------------
% 0.67/0.87
% 0.67/0.87
% 0.67/0.87 Search stopped by max_proofs option.
% 0.67/0.87
% 0.67/0.87
% 0.67/0.87 Search stopped by max_proofs option.
% 0.67/0.87
% 0.67/0.87 ============ end of search ============
% 0.67/0.87
% 0.67/0.87 ----------- soft-scott stats ----------
% 0.67/0.87
% 0.67/0.87 true clauses given 0 (0.0%)
% 0.67/0.87 false clauses given 6
% 0.67/0.87
% 0.67/0.87 FALSE TRUE
% 0.67/0.87 tot: 0 0 (-nan% true)
% 0.67/0.87
% 0.67/0.87
% 0.67/0.87 Model 7 [ 2 1 107 ] (0.00 seconds, 126422 Inserts)
% 0.67/0.87
% 0.67/0.87 That finishes the proof of the theorem.
% 0.67/0.87
% 0.67/0.87 Process 25211 finished Tue Jun 7 13:25:30 2022
%------------------------------------------------------------------------------