TSTP Solution File: SWV006-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV006-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:42 EDT 2022
% Result : Unsatisfiable 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 19:29:28 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n021.cluster.edu,
% 0.14/0.36 Tue Jun 14 19:29:28 2022
% 0.14/0.36 The command was "./sos". The process ID is 7015.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.14/0.36
% 0.14/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.36 clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 23 during input processing: 0 [copy,23,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.39
% 0.14/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 -------------- Softie stats --------------
% 0.14/0.39
% 0.14/0.39 UPDATE_STOP: 300
% 0.14/0.39 SFINDER_TIME_LIMIT: 2
% 0.14/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39 number of clauses in intial UL: 12
% 0.14/0.39 number of clauses initially in problem: 23
% 0.14/0.39 percentage of clauses intially in UL: 52
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 9
% 0.14/0.39 distinct predicate count: 2
% 0.14/0.39 distinct function count: 3
% 0.14/0.39 distinct constant count: 4
% 0.14/0.39
% 0.14/0.39 ---------- no more Softie stats ----------
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39 =========== start of search ===========
% 0.19/0.45
% 0.19/0.45 -------- PROOF --------
% 0.19/0.45 % SZS status Unsatisfiable
% 0.19/0.45 % SZS output start Refutation
% 0.19/0.45
% 0.19/0.45 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.45
% 0.19/0.45 Stopped by limit on number of solutions
% 0.19/0.45
% 0.19/0.45 Model 4 [ 2 1 1085 ] (0.00 seconds, 1123 Inserts)
% 0.19/0.45
% 0.19/0.45 Model 5 [ 3 0 45 ] (0.00 seconds, 1848 Inserts)
% 0.19/0.45
% 0.19/0.45 Model 6 [ 3 0 2016 ] (0.00 seconds, 3799 Inserts)
% 0.19/0.45
% 0.19/0.45 -----> EMPTY CLAUSE at 0.06 sec ----> 172 [factor,145.1.5,unit_del,4,44,22,4] {-} $F.
% 0.19/0.45
% 0.19/0.45 Length of proof is 2. Level of proof is 1.
% 0.19/0.45
% 0.19/0.45 ---------------- PROOF ----------------
% 0.19/0.45 % SZS status Unsatisfiable
% 0.19/0.45 % SZS output start Refutation
% 0.19/0.45
% 0.19/0.45 3 [] {+} less_than(A,B)| -less_than(A,C)| -less_than(C,B).
% 0.19/0.45 4 [] {+} -less_than(A,A).
% 0.19/0.45 10 [] {+} less_than(A,i)| -less_than(A,successor(n))| -less_than(a(A),a(m)).
% 0.19/0.45 18 [] {-} less_than(A,successor(A)).
% 0.19/0.45 19 [] {+} less_than(A,B)|less_than(B,A)|A=B.
% 0.19/0.45 21 [] {+} less_than(i,n).
% 0.19/0.45 22 [] {-} less_than(a(i),a(m)).
% 0.19/0.45 44 [hyper,21,3,18] {+} less_than(i,successor(n)).
% 0.19/0.45 145 [para_from,19.3.1,10.1.2] {-} less_than(A,B)| -less_than(A,successor(n))| -less_than(a(A),a(m))|less_than(i,B)|less_than(B,i).
% 0.19/0.45 172 [factor,145.1.5,unit_del,4,44,22,4] {-} $F.
% 0.19/0.45
% 0.19/0.45 % SZS output end Refutation
% 0.19/0.45 ------------ end of proof -------------
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Search stopped by max_proofs option.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Search stopped by max_proofs option.
% 0.19/0.45
% 0.19/0.45 ============ end of search ============
% 0.19/0.45
% 0.19/0.45 ----------- soft-scott stats ----------
% 0.19/0.45
% 0.19/0.45 true clauses given 4 (36.4%)
% 0.19/0.45 false clauses given 7
% 0.19/0.45
% 0.19/0.45 FALSE TRUE
% 0.19/0.45 4 0 1
% 0.19/0.45 5 7 2
% 0.19/0.45 7 2 3
% 0.19/0.45 8 8 6
% 0.19/0.45 9 2 15
% 0.19/0.45 10 0 2
% 0.19/0.45 14 0 1
% 0.19/0.45 tot: 19 30 (61.2% true)
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Model 6 [ 3 0 2016 ] (0.00 seconds, 3799 Inserts)
% 0.19/0.45
% 0.19/0.45 That finishes the proof of the theorem.
% 0.19/0.45
% 0.19/0.45 Process 7015 finished Tue Jun 14 19:29:28 2022
%------------------------------------------------------------------------------