TSTP Solution File: KRS092+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS092+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:44 EDT 2022
% Result : Unsatisfiable 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS092+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n018.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 12:26:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n018.cluster.edu,
% 0.13/0.36 Tue Jun 7 12:26:36 2022
% 0.13/0.36 The command was "./sos". The process ID is 32223.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36 9 back subsumes 8.
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 14 back subsumes 4.
% 0.13/0.36
% 0.13/0.36 ======= 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: 11
% 0.13/0.39 number of clauses initially in problem: 14
% 0.13/0.39 percentage of clauses intially in UL: 78
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 93
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 15
% 0.13/0.39 distinct predicate count: 12
% 0.13/0.39 distinct function count: 2
% 0.13/0.39 distinct constant count: 1
% 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.20/0.48
% 0.20/0.48 -------- PROOF --------
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 Model 3 [ 1 1 77 ] (0.00 seconds, 633 Inserts)
% 0.20/0.48
% 0.20/0.48 Stopped by limit on insertions
% 0.20/0.48
% 0.20/0.48 Model 4 [ 2 1 84 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.48
% 0.20/0.48 -----> EMPTY CLAUSE at 0.10 sec ----> 20 [hyper,19,9,18] {-} $F.
% 0.20/0.48
% 0.20/0.48 Length of proof is 3. Level of proof is 2.
% 0.20/0.48
% 0.20/0.48 ---------------- PROOF ----------------
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 3 [] {+} -cUnsatisfiable(A)|rr(A,$f1(A)).
% 0.20/0.48 5 [] {+} -cUnsatisfiable(A)| -rr(A,B)|cd(B).
% 0.20/0.48 6 [] {+} -cUnsatisfiable(A)| -rr(A,B)|cc(B).
% 0.20/0.48 9 [] {+} -cc(A)| -cd(A).
% 0.20/0.48 16 [] {-} cUnsatisfiable(i2003_11_14_17_20_04172).
% 0.20/0.48 17 [hyper,16,3] {+} rr(i2003_11_14_17_20_04172,$f1(i2003_11_14_17_20_04172)).
% 0.20/0.48 18 [hyper,17,6,16] {+} cc($f1(i2003_11_14_17_20_04172)).
% 0.20/0.48 19 [hyper,17,5,16] {+} cd($f1(i2003_11_14_17_20_04172)).
% 0.20/0.48 20 [hyper,19,9,18] {-} $F.
% 0.20/0.48
% 0.20/0.48 % SZS output end Refutation
% 0.20/0.48 ------------ end of proof -------------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48 ============ end of search ============
% 0.20/0.48
% 0.20/0.48 ----------- soft-scott stats ----------
% 0.20/0.48
% 0.20/0.48 true clauses given 2 (33.3%)
% 0.20/0.48 false clauses given 4
% 0.20/0.48
% 0.20/0.48 FALSE TRUE
% 0.20/0.48 tot: 0 0 (-nan% true)
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Model 4 [ 2 1 84 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.48
% 0.20/0.48 That finishes the proof of the theorem.
% 0.20/0.48
% 0.20/0.48 Process 32223 finished Tue Jun 7 12:26:36 2022
%------------------------------------------------------------------------------