TSTP Solution File: KRS124+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS124+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:49 EDT 2022
% Result : Unsatisfiable 0.36s 0.54s
% Output : Refutation 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS124+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n018.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 09:28:20 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 n018.cluster.edu,
% 0.12/0.35 Tue Jun 7 09:28:20 2022
% 0.12/0.35 The command was "./sos". The process ID is 15599.
% 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=4.
% 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 22 back subsumes 4.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 20
% 0.18/0.38 number of clauses initially in problem: 25
% 0.18/0.38 percentage of clauses intially in UL: 80
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 87
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 24
% 0.18/0.38 distinct predicate count: 17
% 0.18/0.38 distinct function count: 6
% 0.18/0.38 distinct constant count: 1
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 0.36/0.54
% 0.36/0.54 -------- PROOF --------
% 0.36/0.54 % SZS status Theorem
% 0.36/0.54 % SZS output start Refutation
% 0.36/0.54
% 0.36/0.54 Model 3 [ 1 1 189 ] (0.00 seconds, 289 Inserts)
% 0.36/0.54
% 0.36/0.54 Model 4 [ 1 0 297 ] (0.00 seconds, 423 Inserts)
% 0.36/0.54
% 0.36/0.54 Model 5 [ 1 1 219 ] (0.00 seconds, 561 Inserts)
% 0.36/0.54
% 0.36/0.54 Stopped by limit on insertions
% 0.36/0.54
% 0.36/0.54 Model 6 [ 3 0 163 ] (0.00 seconds, 250000 Inserts)
% 0.36/0.54
% 0.36/0.54 Stopped by limit on insertions
% 0.36/0.54
% 0.36/0.54 Model 7 [ 4 1 155 ] (0.00 seconds, 250000 Inserts)
% 0.36/0.54
% 0.36/0.54 -----> EMPTY CLAUSE at 0.17 sec ----> 33 [hyper,32,11,30] {-} $F.
% 0.36/0.54
% 0.36/0.54 Length of proof is 6. Level of proof is 5.
% 0.36/0.54
% 0.36/0.54 ---------------- PROOF ----------------
% 0.36/0.54 % SZS status Theorem
% 0.36/0.54 % SZS output start Refutation
% 0.36/0.54
% 0.36/0.54 3 [] {+} -cUnsatisfiable(A)|rr(A,$f1(A)).
% 0.36/0.54 5 [] {+} -cUnsatisfiable(A)| -rr(A,B)|ca_Ax3(B).
% 0.36/0.54 8 [] {+} -cc(A)|cdxcomp(A).
% 0.36/0.54 11 [] {+} -cd(A)| -ra_Px1(A,B).
% 0.36/0.54 12 [] {+} -cdxcomp(A)|ra_Px1(A,$f4(A)).
% 0.36/0.54 19 [] {+} -ca_Ax3(A)|cd(A).
% 0.36/0.54 20 [] {+} -ca_Ax3(A)|cc(A).
% 0.36/0.54 26 [] {-} cUnsatisfiable(i2003_11_14_17_22_10903).
% 0.36/0.54 27 [hyper,26,3] {+} rr(i2003_11_14_17_22_10903,$f1(i2003_11_14_17_22_10903)).
% 0.36/0.54 28 [hyper,27,5,26] {-} ca_Ax3($f1(i2003_11_14_17_22_10903)).
% 0.36/0.54 29 [hyper,28,20] {+} cc($f1(i2003_11_14_17_22_10903)).
% 0.36/0.54 30 [hyper,28,19] {+} cd($f1(i2003_11_14_17_22_10903)).
% 0.36/0.54 31 [hyper,29,8] {+} cdxcomp($f1(i2003_11_14_17_22_10903)).
% 0.36/0.54 32 [hyper,31,12] {+} ra_Px1($f1(i2003_11_14_17_22_10903),$f4($f1(i2003_11_14_17_22_10903))).
% 0.36/0.54 33 [hyper,32,11,30] {-} $F.
% 0.36/0.54
% 0.36/0.54 % SZS output end Refutation
% 0.36/0.54 ------------ end of proof -------------
% 0.36/0.54
% 0.36/0.54
% 0.36/0.54 Search stopped by max_proofs option.
% 0.36/0.54
% 0.36/0.54
% 0.36/0.54 Search stopped by max_proofs option.
% 0.36/0.54
% 0.36/0.54 ============ end of search ============
% 0.36/0.54
% 0.36/0.54 ----------- soft-scott stats ----------
% 0.36/0.54
% 0.36/0.54 true clauses given 3 (27.3%)
% 0.36/0.54 false clauses given 8
% 0.36/0.54
% 0.36/0.54 FALSE TRUE
% 0.36/0.54 tot: 0 0 (-nan% true)
% 0.36/0.54
% 0.36/0.54
% 0.36/0.54 Model 7 [ 4 1 155 ] (0.00 seconds, 250000 Inserts)
% 0.36/0.54
% 0.36/0.54 That finishes the proof of the theorem.
% 0.36/0.54
% 0.36/0.54 Process 15599 finished Tue Jun 7 09:28:21 2022
%------------------------------------------------------------------------------