TSTP Solution File: SWV002-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n022.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 14:28:18 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 n022.cluster.edu,
% 0.14/0.36 Tue Jun 14 14:28:18 2022
% 0.14/0.36 The command was "./sos". The process ID is 8441.
% 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 26 during input processing: 0 [copy,26,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 14
% 0.20/0.39 number of clauses initially in problem: 26
% 0.20/0.39 percentage of clauses intially in UL: 53
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 11
% 0.20/0.39 distinct predicate count: 2
% 0.20/0.39 distinct function count: 3
% 0.20/0.39 distinct constant count: 6
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 0.20/0.48
% 0.20/0.48 -------- PROOF --------
% 0.20/0.48 % SZS status Unsatisfiable
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.48
% 0.20/0.48 Stopped by limit on number of solutions
% 0.20/0.48
% 0.20/0.48 Model 4 [ 2 0 511 ] (0.00 seconds, 552 Inserts)
% 0.20/0.48
% 0.20/0.48 Model 5 [ 3 1 49 ] (0.00 seconds, 1868 Inserts)
% 0.20/0.48
% 0.20/0.48 Model 6 [ 3 1 42 ] (0.00 seconds, 1832 Inserts)
% 0.20/0.48
% 0.20/0.48 ----> UNIT CONFLICT at 0.10 sec ----> 408 [binary,407.1,4.1] {-} $F.
% 0.20/0.48
% 0.20/0.48 Length of proof is 3. Level of proof is 3.
% 0.20/0.48
% 0.20/0.48 ---------------- PROOF ----------------
% 0.20/0.48 % SZS status Unsatisfiable
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 3 [] {+} less_than(A,B)| -less_than(A,C)| -less_than(C,B).
% 0.20/0.48 4 [] {+} -less_than(A,A).
% 0.20/0.48 10 [] {+} less_than(A,i)| -less_than(A,j)| -less_than(a(A),a(k)).
% 0.20/0.48 13 [] {+} -less_than(q,i).
% 0.20/0.48 14 [] {+} -less_than(j,q).
% 0.20/0.48 21 [] {+} less_than(A,B)|less_than(B,A)|A=B.
% 0.20/0.48 24 [] {-} less_than(a(j),a(k)).
% 0.20/0.48 25 [] {-} less_than(a(q),a(j)).
% 0.20/0.48 219 [hyper,25,3,24] {-} less_than(a(q),a(k)).
% 0.20/0.48 392,391 [hyper,219,10,21,unit_del,13,14,flip.1] {-} q=j.
% 0.20/0.48 407 [back_demod,25,demod,392] {-} less_than(a(j),a(j)).
% 0.20/0.48 408 [binary,407.1,4.1] {-} $F.
% 0.20/0.48
% 0.20/0.48 % SZS output end Refutation
% 0.20/0.48 ------------ end of proof -------------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48 ============ end of search ============
% 0.20/0.48
% 0.20/0.48 ----------- soft-scott stats ----------
% 0.20/0.48
% 0.20/0.48 true clauses given 7 (29.2%)
% 0.20/0.48 false clauses given 17
% 0.20/0.48
% 0.20/0.48 FALSE TRUE
% 0.20/0.48 5 0 2
% 0.20/0.48 6 12 9
% 0.20/0.48 7 13 8
% 0.20/0.48 8 25 6
% 0.20/0.48 9 6 38
% 0.20/0.48 10 51 20
% 0.20/0.48 11 30 15
% 0.20/0.48 12 16 12
% 0.20/0.48 13 18 7
% 0.20/0.48 14 0 1
% 0.20/0.48 15 0 12
% 0.20/0.48 16 0 2
% 0.20/0.48 17 0 7
% 0.20/0.48 18 0 8
% 0.20/0.48 19 2 6
% 0.20/0.48 20 0 3
% 0.20/0.48 21 0 5
% 0.20/0.48 22 0 2
% 0.20/0.48 23 0 1
% 0.20/0.48 24 0 9
% 0.20/0.48 26 0 1
% 0.20/0.48 30 0 1
% 0.20/0.48 tot: 173 175 (50.3% true)
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Model 6 [ 3 -3 42 ] (0.00 seconds, 1832 Inserts)
% 0.20/0.48
% 0.20/0.48 That finishes the proof of the theorem.
% 0.20/0.48
% 0.20/0.48 Process 8441 finished Tue Jun 14 14:28:18 2022
%------------------------------------------------------------------------------