TSTP Solution File: KRS125+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS125+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:50 EDT 2022
% Result : Unsatisfiable 0.70s 0.89s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS125+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 17:25:15 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 sandbox on n028.cluster.edu,
% 0.12/0.35 Tue Jun 7 17:25:15 2022
% 0.12/0.35 The command was "./sos". The process ID is 6295.
% 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=3.
% 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
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 16
% 0.12/0.39 number of clauses initially in problem: 21
% 0.12/0.39 percentage of clauses intially in UL: 76
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 80
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 20
% 0.12/0.39 distinct predicate count: 15
% 0.12/0.39 distinct function count: 4
% 0.12/0.39 distinct constant count: 1
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.70/0.89
% 0.70/0.89 -------- PROOF --------
% 0.70/0.89 % SZS status Theorem
% 0.70/0.89 % SZS output start Refutation
% 0.70/0.89
% 0.70/0.89 Model 3 [ 1 0 118 ] (0.00 seconds, 190 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 4 [ 2 1 111 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 5 [ 2 1 108 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 6 [ 2 0 102 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 7 [ 4 0 105 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 8 [ 3 0 106 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 9 [ 3 1 168 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 10 [ 3 0 164 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 -----> EMPTY CLAUSE at 0.51 sec ----> 28 [hyper,27,9,24] {-} $F.
% 0.70/0.89
% 0.70/0.89 Length of proof is 6. Level of proof is 4.
% 0.70/0.89
% 0.70/0.89 ---------------- PROOF ----------------
% 0.70/0.89 % SZS status Theorem
% 0.70/0.89 % SZS output start Refutation
% 0.70/0.89
% 0.70/0.89 3 [] {+} -cUnsatisfiable(A)|ce3(A).
% 0.70/0.89 4 [] {+} -cUnsatisfiable(A)|cf(A).
% 0.70/0.89 6 [] {+} -cc(A)|cdxcomp(A).
% 0.70/0.89 9 [] {+} -cd(A)| -ra_Px1(A,B).
% 0.70/0.89 10 [] {+} -cdxcomp(A)|ra_Px1(A,$f2(A)).
% 0.70/0.89 15 [] {+} -ce3(A)|cc(A).
% 0.70/0.89 16 [] {+} -cf(A)|cd(A).
% 0.70/0.89 21 [] {-} cUnsatisfiable(i2003_11_14_17_22_17947).
% 0.70/0.89 22 [hyper,21,4] {+} cf(i2003_11_14_17_22_17947).
% 0.70/0.89 23 [hyper,21,3] {+} ce3(i2003_11_14_17_22_17947).
% 0.70/0.89 24 [hyper,22,16] {+} cd(i2003_11_14_17_22_17947).
% 0.70/0.89 25 [hyper,23,15] {+} cc(i2003_11_14_17_22_17947).
% 0.70/0.89 26 [hyper,25,6] {+} cdxcomp(i2003_11_14_17_22_17947).
% 0.70/0.89 27 [hyper,26,10] {+} ra_Px1(i2003_11_14_17_22_17947,$f2(i2003_11_14_17_22_17947)).
% 0.70/0.89 28 [hyper,27,9,24] {-} $F.
% 0.70/0.89
% 0.70/0.89 % SZS output end Refutation
% 0.70/0.89 ------------ end of proof -------------
% 0.70/0.89
% 0.70/0.89
% 0.70/0.89 Search stopped by max_proofs option.
% 0.70/0.89
% 0.70/0.89
% 0.70/0.89 Search stopped by max_proofs option.
% 0.70/0.89
% 0.70/0.89 ============ end of search ============
% 0.70/0.89
% 0.70/0.89 ----------- soft-scott stats ----------
% 0.70/0.89
% 0.70/0.89 true clauses given 1 (9.1%)
% 0.70/0.89 false clauses given 10
% 0.70/0.89
% 0.70/0.89 FALSE TRUE
% 0.70/0.89 tot: 0 0 (-nan% true)
% 0.70/0.89
% 0.70/0.89
% 0.70/0.89 Model 10 [ 3 0 164 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 That finishes the proof of the theorem.
% 0.70/0.89
% 0.70/0.89 Process 6295 finished Tue Jun 7 17:25:15 2022
%------------------------------------------------------------------------------