TSTP Solution File: SWV001-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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 : Wed Jul 20 21:36:41 EDT 2022
% Result : Unsatisfiable 0.66s 0.88s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n021.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 23:14:43 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n021.cluster.edu,
% 0.12/0.35 Tue Jun 14 23:14:43 2022
% 0.12/0.35 The command was "./sos". The process ID is 12422.
% 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 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 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.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 14
% 0.18/0.39 number of clauses initially in problem: 17
% 0.18/0.39 percentage of clauses intially in UL: 82
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 88
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 9
% 0.18/0.39 distinct predicate count: 6
% 0.18/0.39 distinct function count: 0
% 0.18/0.39 distinct constant count: 3
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 0.66/0.88
% 0.66/0.88 -------- PROOF --------
% 0.66/0.88 % SZS status Unsatisfiable
% 0.66/0.88 % SZS output start Refutation
% 0.66/0.88
% 0.66/0.88 Stopped by limit on insertions
% 0.66/0.88
% 0.66/0.88 Model 3 [ 1 0 354 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 Model 4 (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 Stopped by limit on number of solutions
% 0.66/0.88
% 0.66/0.88 Stopped by limit on insertions
% 0.66/0.88
% 0.66/0.88 Model 5 [ 1 1 278 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 Stopped by limit on insertions
% 0.66/0.88
% 0.66/0.88 Model 6 [ 1 0 624 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 Stopped by limit on insertions
% 0.66/0.88
% 0.66/0.88 Stopped by limit on insertions
% 0.66/0.88
% 0.66/0.88 Model 7 [ 2 1 278 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 Stopped by limit on insertions
% 0.66/0.88
% 0.66/0.88 Model 8 [ 3 0 154 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 -----> EMPTY CLAUSE at 0.50 sec ----> 83 [hyper,64,13,68,15] {-} $F.
% 0.66/0.88
% 0.66/0.88 Length of proof is 11. Level of proof is 7.
% 0.66/0.88
% 0.66/0.88 ---------------- PROOF ----------------
% 0.66/0.88 % SZS status Unsatisfiable
% 0.66/0.88 % SZS output start Refutation
% 0.66/0.88
% 0.66/0.88 3 [] {+} -q1(A,B,C)| -less_or_equalish(A,B)|q2(A,B,C).
% 0.66/0.88 4 [] {+} -q1(A,B,C)|less_or_equalish(A,B)|q3(A,B,C).
% 0.66/0.88 5 [] {+} -q2(A,B,C)|q4(A,B,B).
% 0.66/0.88 6 [] {+} -q3(A,B,C)|q4(A,B,A).
% 0.66/0.88 10 [] {+} -q4(a,b,A)| -less_or_equalish(a,A)| -less_or_equalish(b,A)| -less_or_equalish(A,a).
% 0.66/0.88 11 [] {+} -q4(a,b,A)| -less_or_equalish(a,A)| -less_or_equalish(b,A)| -less_or_equalish(A,b).
% 0.66/0.88 13 [factor,10.2.4] {+} -q4(a,b,a)| -less_or_equalish(a,a)| -less_or_equalish(b,a).
% 0.66/0.88 14 [factor,11.3.4] {+} -q4(a,b,b)| -less_or_equalish(a,b)| -less_or_equalish(b,b).
% 0.66/0.88 15 [] {+} less_or_equalish(A,A).
% 0.66/0.88 16 [] {+} less_or_equalish(A,B)|less_or_equalish(B,A).
% 0.66/0.88 17 [] {+} q1(a,b,c).
% 0.66/0.88 19 [hyper,17,4] {+} less_or_equalish(a,b)|q3(a,b,c).
% 0.66/0.88 24 [hyper,16,3,17] {+} less_or_equalish(b,a)|q2(a,b,c).
% 0.66/0.88 26 [hyper,19,3,17] {-} q3(a,b,c)|q2(a,b,c).
% 0.66/0.88 38 [hyper,26,6] {-} q2(a,b,c)|q4(a,b,a).
% 0.66/0.88 52 [hyper,24,13,38,15,factor_simp] {+} q2(a,b,c).
% 0.66/0.88 53 [hyper,52,5] {+} q4(a,b,b).
% 0.66/0.88 63 [hyper,53,14,19,15] {-} q3(a,b,c).
% 0.66/0.88 64 [hyper,53,14,16,15] {+} less_or_equalish(b,a).
% 0.66/0.88 68 [hyper,63,6] {+} q4(a,b,a).
% 0.66/0.88 83 [hyper,64,13,68,15] {-} $F.
% 0.66/0.88
% 0.66/0.88 % SZS output end Refutation
% 0.66/0.88 ------------ end of proof -------------
% 0.66/0.88
% 0.66/0.88
% 0.66/0.88 Search stopped by max_proofs option.
% 0.66/0.88
% 0.66/0.88
% 0.66/0.88 Search stopped by max_proofs option.
% 0.66/0.88
% 0.66/0.88 ============ end of search ============
% 0.66/0.88
% 0.66/0.88 ----------- soft-scott stats ----------
% 0.66/0.88
% 0.66/0.88 true clauses given 4 (23.5%)
% 0.66/0.88 false clauses given 13
% 0.66/0.88
% 0.66/0.88 FALSE TRUE
% 0.66/0.88 3 1 0
% 0.66/0.88 6 1 1
% 0.66/0.88 10 0 15
% 0.66/0.88 12 1 0
% 0.66/0.88 15 1 0
% 0.66/0.88 16 0 9
% 0.66/0.88 tot: 4 25 (86.2% true)
% 0.66/0.88
% 0.66/0.88
% 0.66/0.88 Model 8 [ 3 0 154 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 That finishes the proof of the theorem.
% 0.66/0.88
% 0.66/0.88 Process 12422 finished Tue Jun 14 23:14:44 2022
%------------------------------------------------------------------------------