TSTP Solution File: KRS063+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS063+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:40 EDT 2022
% Result : Unsatisfiable 0.46s 0.66s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS063+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n020.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 14:29:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox on n020.cluster.edu,
% 0.19/0.36 Tue Jun 7 14:29:21 2022
% 0.19/0.36 The command was "./sos". The process ID is 17153.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 formula_list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.19/0.36
% 0.19/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36 clauses in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(knuth_bendix).
% 0.19/0.36 dependent: set(para_from).
% 0.19/0.36 dependent: set(para_into).
% 0.19/0.36 dependent: clear(para_from_right).
% 0.19/0.36 dependent: clear(para_into_right).
% 0.19/0.36 dependent: set(para_from_vars).
% 0.19/0.36 dependent: set(eq_units_both_ways).
% 0.19/0.36 dependent: set(dynamic_demod_all).
% 0.19/0.36 dependent: set(dynamic_demod).
% 0.19/0.36 dependent: set(order_eq).
% 0.19/0.36 dependent: set(back_demod).
% 0.19/0.36 dependent: set(lrpo).
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36 13 back subsumes 5.
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 29 back subsumes 23.
% 0.19/0.36 29 back subsumes 6.
% 0.19/0.36 Following clause subsumed by 39 during input processing: 0 [copy,39,flip.1] {-} A=A.
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 25
% 0.19/0.39 number of clauses initially in problem: 36
% 0.19/0.39 percentage of clauses intially in UL: 69
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 19
% 0.19/0.39 distinct predicate count: 11
% 0.19/0.39 distinct function count: 1
% 0.19/0.39 distinct constant count: 7
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.46/0.66
% 0.46/0.66 -------- PROOF --------
% 0.46/0.66 % SZS status Theorem
% 0.46/0.66 % SZS output start Refutation
% 0.46/0.66
% 0.46/0.66 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.66
% 0.46/0.66 Stopped by limit on number of solutions
% 0.46/0.66
% 0.46/0.66 Model 4 (0.00 seconds, 0 Inserts)
% 0.46/0.66
% 0.46/0.66 Stopped by limit on number of solutions
% 0.46/0.66
% 0.46/0.66 Stopped by limit on insertions
% 0.46/0.66
% 0.46/0.66 Model 5 [ 1 0 73 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.66
% 0.46/0.66 Stopped by limit on insertions
% 0.46/0.66
% 0.46/0.66 Model 6 [ 1 0 135 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.66
% 0.46/0.66 Stopped by limit on insertions
% 0.46/0.66
% 0.46/0.66 Model 7 [ 1 0 81 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.66
% 0.46/0.66 Stopped by limit on insertions
% 0.46/0.66
% 0.46/0.66 Model 8 [ 1 1 26848 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.66
% 0.46/0.66 ----> UNIT CONFLICT at 0.28 sec ----> 55 [binary,54.1,28.1] {-} $F.
% 0.46/0.66
% 0.46/0.66 Length of proof is 2. Level of proof is 2.
% 0.46/0.66
% 0.46/0.66 ---------------- PROOF ----------------
% 0.46/0.66 % SZS status Theorem
% 0.46/0.66 % SZS output start Refutation
% 0.46/0.66
% 0.46/0.66 24 [] {+} cEuroMP(A)| -risEuroMPFrom(A,B)| -cowlThing(B).
% 0.46/0.66 27 [] {+} risEuroMPFrom(A,B)| -rhasEuroMP(B,A).
% 0.46/0.66 28 [] {+} -cEuroMP(iKinnock).
% 0.46/0.66 29 [] {+} cowlThing(A).
% 0.46/0.66 38 [] {+} rhasEuroMP(iUK,iKinnock).
% 0.46/0.66 46 [hyper,38,27] {+} risEuroMPFrom(iKinnock,iUK).
% 0.46/0.66 54 [hyper,46,24,29] {-} cEuroMP(iKinnock).
% 0.46/0.66 55 [binary,54.1,28.1] {-} $F.
% 0.46/0.66
% 0.46/0.66 % SZS output end Refutation
% 0.46/0.66 ------------ end of proof -------------
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 Search stopped by max_proofs option.
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 Search stopped by max_proofs option.
% 0.46/0.66
% 0.46/0.66 ============ end of search ============
% 0.46/0.66
% 0.46/0.66 ----------- soft-scott stats ----------
% 0.46/0.66
% 0.46/0.66 true clauses given 0 (0.0%)
% 0.46/0.66 false clauses given 7
% 0.46/0.66
% 0.46/0.66 FALSE TRUE
% 0.46/0.66 2 2 3
% 0.46/0.66 3 0 1
% 0.46/0.66 19 0 6
% 0.46/0.66 20 0 6
% 0.46/0.66 tot: 2 16 (88.9% true)
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 Model 8 [ 1 1 26848 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.66
% 0.46/0.66 That finishes the proof of the theorem.
% 0.46/0.66
% 0.46/0.66 Process 17153 finished Tue Jun 7 14:29:22 2022
%------------------------------------------------------------------------------