TSTP Solution File: KRS128+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS128+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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.60s 0.84s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS128+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 13:36:49 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n024.cluster.edu,
% 0.13/0.35 Tue Jun 7 13:36:49 2022
% 0.13/0.35 The command was "./sos". The process ID is 21108.
% 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=5.
% 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
% 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: 23
% 0.13/0.39 number of clauses initially in problem: 29
% 0.13/0.39 percentage of clauses intially in UL: 79
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 80
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 26
% 0.13/0.39 distinct predicate count: 16
% 0.13/0.39 distinct function count: 9
% 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.60/0.84
% 0.60/0.84 -------- PROOF --------
% 0.60/0.84 % SZS status Theorem
% 0.60/0.84 % SZS output start Refutation
% 0.60/0.84
% 0.60/0.84 Model 3 [ 1 1 224 ] (0.00 seconds, 15360 Inserts)
% 0.60/0.84
% 0.60/0.84 Model 4 [ 1 0 216 ] (0.00 seconds, 13962 Inserts)
% 0.60/0.84
% 0.60/0.84 Model 5 [ 1 0 426 ] (0.00 seconds, 668 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 6 [ 2 1 414 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 7 [ 3 1 225 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 8 [ 2 0 422 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 9 [ 2 1 308 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 10 [ 4 1 278 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 11 [ 4 0 210 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 12 [ 5 0 314 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 -----> EMPTY CLAUSE at 0.46 sec ----> 40 [hyper,35,20,36] {-} $F.
% 0.60/0.84
% 0.60/0.84 Length of proof is 6. Level of proof is 3.
% 0.60/0.84
% 0.60/0.84 ---------------- PROOF ----------------
% 0.60/0.84 % SZS status Theorem
% 0.60/0.84 % SZS output start Refutation
% 0.60/0.84
% 0.60/0.84 3 [] {+} -cUnsatisfiable(A)|rr(A,$f1(A)).
% 0.60/0.84 4 [] {+} -cUnsatisfiable(A)|cexcomp($f1(A)).
% 0.60/0.84 5 [] {+} -cUnsatisfiable(A)| -rr(A,B)|cd(B).
% 0.60/0.84 6 [] {+} -cUnsatisfiable(A)| -rr(A,B)|ca_Cx4(B).
% 0.60/0.84 18 [] {+} -ca_Cx4(A)|ra_Px4(A,$f8(A)).
% 0.60/0.84 20 [] {+} -ca_Cx4xcomp(A)| -ra_Px4(A,B).
% 0.60/0.84 23 [] {+} ca_Cx4xcomp(A)| -cd(A)| -cexcomp(A).
% 0.60/0.84 29 [] {-} cUnsatisfiable(i2003_11_14_17_22_31584).
% 0.60/0.84 30 [hyper,29,4] {+} cexcomp($f1(i2003_11_14_17_22_31584)).
% 0.60/0.84 31 [hyper,29,3] {+} rr(i2003_11_14_17_22_31584,$f1(i2003_11_14_17_22_31584)).
% 0.60/0.84 33 [hyper,31,6,29] {+} ca_Cx4($f1(i2003_11_14_17_22_31584)).
% 0.60/0.84 34 [hyper,31,5,29] {+} cd($f1(i2003_11_14_17_22_31584)).
% 0.60/0.84 35 [hyper,33,18] {+} ra_Px4($f1(i2003_11_14_17_22_31584),$f8($f1(i2003_11_14_17_22_31584))).
% 0.60/0.84 36 [hyper,34,23,30] {+} ca_Cx4xcomp($f1(i2003_11_14_17_22_31584)).
% 0.60/0.84 40 [hyper,35,20,36] {-} $F.
% 0.60/0.84
% 0.60/0.84 % SZS output end Refutation
% 0.60/0.84 ------------ end of proof -------------
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Search stopped by max_proofs option.
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Search stopped by max_proofs option.
% 0.60/0.84
% 0.60/0.84 ============ end of search ============
% 0.60/0.84
% 0.60/0.84 ----------- soft-scott stats ----------
% 0.60/0.84
% 0.60/0.84 true clauses given 0 (0.0%)
% 0.60/0.84 false clauses given 12
% 0.60/0.84
% 0.60/0.84 FALSE TRUE
% 0.60/0.84 6 2 2
% 0.60/0.84 tot: 2 2 (50.0% true)
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Model 12 [ 5 0 314 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 That finishes the proof of the theorem.
% 0.60/0.84
% 0.60/0.84 Process 21108 finished Tue Jun 7 13:36:50 2022
%------------------------------------------------------------------------------