TSTP Solution File: KRS137+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS137+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:51 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS137+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n029.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 16:08:50 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n029.cluster.edu,
% 0.13/0.37 Tue Jun 7 16:08:50 2022
% 0.13/0.37 The command was "./sos". The process ID is 14048.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=8.
% 0.13/0.37
% 0.13/0.37 This is a non-Horn set without equality. The strategy
% 0.13/0.37 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.37 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 9 during input processing: 0 [] {-} cowlThing(iauto).
% 0.13/0.37 Following clause subsumed by 9 during input processing: 0 [] {-} cowlThing(icar).
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 6
% 0.13/0.40 number of clauses initially in problem: 10
% 0.13/0.40 percentage of clauses intially in UL: 60
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 10
% 0.13/0.40 distinct predicate count: 6
% 0.13/0.40 distinct function count: 0
% 0.13/0.40 distinct constant count: 4
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 0.20/0.46
% 0.20/0.46 -------- PROOF --------
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 % SZS output start Refutation
% 0.20/0.46
% 0.20/0.46 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.46
% 0.20/0.46 Stopped by limit on number of solutions
% 0.20/0.46
% 0.20/0.46 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.46
% 0.20/0.46 Stopped by limit on number of solutions
% 0.20/0.46
% 0.20/0.46 Model 5 [ 1 1 31 ] (0.00 seconds, 3633 Inserts)
% 0.20/0.46
% 0.20/0.46 Model 6 [ 1 0 35 ] (0.00 seconds, 4134 Inserts)
% 0.20/0.46
% 0.20/0.46 Model 7 [ 1 1 77 ] (0.00 seconds, 3950 Inserts)
% 0.20/0.46
% 0.20/0.46 Model 8 [ 1 1 95 ] (0.00 seconds, 2420 Inserts)
% 0.20/0.46
% 0.20/0.46 -----> EMPTY CLAUSE at 0.07 sec ----> 17 [hyper,16,2,15] {-} $F.
% 0.20/0.46
% 0.20/0.46 Length of proof is 6. Level of proof is 3.
% 0.20/0.46
% 0.20/0.46 ---------------- PROOF ----------------
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 % SZS output start Refutation
% 0.20/0.46
% 0.20/0.46 1 [] {+} -cowlNothing(A).
% 0.20/0.46 2 [] {+} -xsd_string(A)| -xsd_integer(A).
% 0.20/0.46 3 [] {+} -cCar(A)|cAutomobile(A).
% 0.20/0.46 4 [] {+} cCar(A)| -cAutomobile(A).
% 0.20/0.46 5 [] {-} -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cCar(iauto)| -cowlThing(iauto)| -cowlThing(icar)| -cAutomobile(icar).
% 0.20/0.46 6 [copy,5,unit_del,1] {+} -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cCar(iauto)| -cowlThing(iauto)| -cowlThing(icar)| -cAutomobile(icar).
% 0.20/0.46 7 [] {-} -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cCar(iauto)| -cowlThing(iauto)| -cowlThing(icar)| -cAutomobile(icar).
% 0.20/0.46 8 [copy,7,unit_del,1] {+} -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cCar(iauto)| -cowlThing(iauto)| -cowlThing(icar)| -cAutomobile(icar).
% 0.20/0.46 9 [] {+} cowlThing(A).
% 0.20/0.46 10 [] {+} xsd_string(A)|xsd_integer(A).
% 0.20/0.46 11 [] {+} cAutomobile(iauto).
% 0.20/0.46 12 [] {+} cCar(icar).
% 0.20/0.46 13 [hyper,12,3] {+} cAutomobile(icar).
% 0.20/0.46 14 [hyper,11,4] {+} cCar(iauto).
% 0.20/0.46 15 [hyper,14,8,9,10,9,9,13,factor_simp] {+} xsd_integer($c2).
% 0.20/0.46 16 [hyper,15,6,9,14,9,9,13] {+} xsd_string($c2).
% 0.20/0.46 17 [hyper,16,2,15] {-} $F.
% 0.20/0.46
% 0.20/0.46 % SZS output end Refutation
% 0.20/0.46 ------------ end of proof -------------
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Search stopped by max_proofs option.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Search stopped by max_proofs option.
% 0.20/0.46
% 0.20/0.46 ============ end of search ============
% 0.20/0.46
% 0.20/0.46 ----------- soft-scott stats ----------
% 0.20/0.46
% 0.20/0.46 true clauses given 1 (12.5%)
% 0.20/0.46 false clauses given 7
% 0.20/0.46
% 0.20/0.46 FALSE TRUE
% 0.20/0.46 tot: 0 0 (-nan% true)
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Model 8 [ 1 1 95 ] (0.00 seconds, 2420 Inserts)
% 0.20/0.46
% 0.20/0.46 That finishes the proof of the theorem.
% 0.20/0.46
% 0.20/0.46 Process 14048 finished Tue Jun 7 16:08:50 2022
%------------------------------------------------------------------------------