TSTP Solution File: SWV009-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.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 : Wed Jul 20 21:36:43 EDT 2022
% Result : Unsatisfiable 0.65s 0.89s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 : Thu Jun 16 00:10:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n020.cluster.edu,
% 0.12/0.36 Thu Jun 16 00:10:34 2022
% 0.12/0.36 The command was "./sos". The process ID is 11081.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/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: 12
% 0.19/0.39 number of clauses initially in problem: 17
% 0.19/0.39 percentage of clauses intially in UL: 70
% 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: 9
% 0.19/0.39 distinct predicate count: 2
% 0.19/0.39 distinct function count: 1
% 0.19/0.39 distinct constant count: 6
% 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.65/0.89
% 0.65/0.89 -------- PROOF --------
% 0.65/0.89 % SZS status Unsatisfiable
% 0.65/0.89 % SZS output start Refutation
% 0.65/0.89
% 0.65/0.89 Model 3 (0.00 seconds, 0 Inserts)
% 0.65/0.89
% 0.65/0.89 Stopped by limit on number of solutions
% 0.65/0.89
% 0.65/0.89 Model 4 (0.00 seconds, 0 Inserts)
% 0.65/0.89
% 0.65/0.89 Stopped by limit on number of solutions
% 0.65/0.89
% 0.65/0.89 Stopped by limit on insertions
% 0.65/0.89
% 0.65/0.89 Model 5 [ 1 0 99 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.89
% 0.65/0.89 Stopped by limit on insertions
% 0.65/0.89
% 0.65/0.89 Model 6 [ 1 0 47 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.89
% 0.65/0.89 Stopped by limit on insertions
% 0.65/0.89
% 0.65/0.89 Model 7 [ 1 0 55 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.89
% 0.65/0.89 ----> UNIT CONFLICT at 0.51 sec ----> 41 [binary,40.1,4.1] {-} $F.
% 0.65/0.89
% 0.65/0.89 Length of proof is 3. Level of proof is 2.
% 0.65/0.89
% 0.65/0.89 ---------------- PROOF ----------------
% 0.65/0.89 % SZS status Unsatisfiable
% 0.65/0.89 % SZS output start Refutation
% 0.65/0.89
% 0.65/0.89 1 [] {+} -less_or_equal(m,A)| -less(A,i)| -less(j,B)| -less_or_equal(B,n)|less_or_equal(a(A),a(B)).
% 0.65/0.89 2 [] {+} -less_or_equal(m,A)| -less_or_equal(A,B)| -less_or_equal(B,j)|less_or_equal(a(A),a(B)).
% 0.65/0.89 3 [] {+} -less_or_equal(i,A)| -less_or_equal(A,B)| -less_or_equal(B,n)|less_or_equal(a(A),a(B)).
% 0.65/0.89 4 [] {+} -less_or_equal(a(p),a(q)).
% 0.65/0.89 13 [] {+} less_or_equal(A,B)|less(B,A).
% 0.65/0.89 15 [] {+} less_or_equal(m,p).
% 0.65/0.89 16 [] {+} less_or_equal(p,q).
% 0.65/0.89 17 [] {+} less_or_equal(q,n).
% 0.65/0.89 31 [hyper,16,2,15,13,unit_del,4] {+} less(j,q).
% 0.65/0.89 32 [hyper,17,3,13,16,unit_del,4] {+} less(p,i).
% 0.65/0.89 40 [hyper,32,1,15,31,17] {-} less_or_equal(a(p),a(q)).
% 0.65/0.89 41 [binary,40.1,4.1] {-} $F.
% 0.65/0.89
% 0.65/0.89 % SZS output end Refutation
% 0.65/0.89 ------------ end of proof -------------
% 0.65/0.89
% 0.65/0.89
% 0.65/0.89 Search stopped by max_proofs option.
% 0.65/0.89
% 0.65/0.89
% 0.65/0.89 Search stopped by max_proofs option.
% 0.65/0.89
% 0.65/0.89 ============ end of search ============
% 0.65/0.89
% 0.65/0.89 ----------- soft-scott stats ----------
% 0.65/0.89
% 0.65/0.89 true clauses given 2 (25.0%)
% 0.65/0.89 false clauses given 6
% 0.65/0.89
% 0.65/0.89 FALSE TRUE
% 0.65/0.89 5 0 1
% 0.65/0.89 8 0 1
% 0.65/0.89 11 0 12
% 0.65/0.89 14 0 2
% 0.65/0.89 21 0 2
% 0.65/0.89 tot: 0 18 (100.0% true)
% 0.65/0.89
% 0.65/0.89
% 0.65/0.89 Model 7 [ 1 0 55 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.89
% 0.65/0.89 That finishes the proof of the theorem.
% 0.65/0.89
% 0.65/0.89 Process 11081 finished Thu Jun 16 00:10:35 2022
%------------------------------------------------------------------------------