%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV399+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:38:19 EDT 2022
% Result : Theorem 2.33s 2.51s
% Output : Refutation 2.33s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV399+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.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 : Wed Jun 15 18:27:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n026.cluster.edu,
% 0.13/0.36 Wed Jun 15 18:27:22 2022
% 0.13/0.36 The command was "./sos". The process ID is 4869.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Failed to model usable list: disabling FINDER
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 -------------- Softie stats --------------
% 0.20/0.45
% 0.20/0.45 UPDATE_STOP: 300
% 0.20/0.45 SFINDER_TIME_LIMIT: 2
% 0.20/0.45 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.45 number of clauses in intial UL: 22
% 0.20/0.45 number of clauses initially in problem: 35
% 0.20/0.45 percentage of clauses intially in UL: 62
% 0.20/0.45 percentage of distinct symbols occuring in initial UL: 82
% 0.20/0.45 percent of all initial clauses that are short: 100
% 0.20/0.45 absolute distinct symbol count: 17
% 0.20/0.45 distinct predicate count: 6
% 0.20/0.45 distinct function count: 5
% 0.20/0.45 distinct constant count: 6
% 0.20/0.45
% 0.20/0.45 ---------- no more Softie stats ----------
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 =========== start of search ===========
% 1.75/1.92
% 1.75/1.92
% 1.75/1.92 Changing weight limit from 60 to 34.
% 1.75/1.92
% 1.75/1.92 Resetting weight limit to 34 after 110 givens.
% 1.75/1.92
% 2.05/2.22
% 2.05/2.22
% 2.05/2.22 Changing weight limit from 34 to 30.
% 2.05/2.22
% 2.05/2.22 Resetting weight limit to 30 after 115 givens.
% 2.05/2.22
% 2.26/2.45
% 2.26/2.45
% 2.26/2.45 Changing weight limit from 30 to 28.
% 2.26/2.45
% 2.26/2.45 Resetting weight limit to 28 after 120 givens.
% 2.26/2.45
% 2.33/2.51
% 2.33/2.51 -------- PROOF --------
% 2.33/2.51 % SZS status Theorem
% 2.33/2.51 % SZS output start Refutation
% 2.33/2.51
% 2.33/2.51 -----> EMPTY CLAUSE at 2.13 sec ----> 5959 [hyper,5847,21,34] {-} $F.
% 2.33/2.51
% 2.33/2.51 Length of proof is 8. Level of proof is 7.
% 2.33/2.51
% 2.33/2.51 ---------------- PROOF ----------------
% 2.33/2.51 % SZS status Theorem
% 2.33/2.51 % SZS output start Refutation
% 2.33/2.51
% 2.33/2.51 1 [] {+} -less_than(A,B)| -less_than(B,C)|less_than(A,C).
% 2.33/2.51 3 [] {+} -strictly_less_than(A,B)| -less_than(B,A).
% 2.33/2.51 4 [] {+} strictly_less_than(A,B)| -less_than(A,B)|less_than(B,A).
% 2.33/2.51 19 [] {+} -pair_in_list(A,B,C)| -less_than(D,C)|pair_in_list(update_slb(A,D),B,C).
% 2.33/2.51 20 [] {+} -pair_in_list(A,B,C)| -strictly_less_than(C,D)|pair_in_list(update_slb(A,D),B,D).
% 2.33/2.51 21 [] {+} -pair_in_list(update_slb($c4,$c3),A,B)| -strictly_less_than(A,B).
% 2.33/2.51 23 [] {-} less_than(A,B)|less_than(B,A).
% 2.33/2.51 33 [] {-} pair_in_list($c4,$c2,$c1).
% 2.33/2.51 34 [] {-} strictly_less_than($c2,$c1).
% 2.33/2.51 37 [hyper,23,4,factor_simp] {-} less_than(A,B)|strictly_less_than(B,A).
% 2.33/2.51 50 [hyper,34,3,23] {-} less_than($c2,$c1).
% 2.33/2.51 123 [hyper,37,20,33] {-} less_than(A,$c1)|pair_in_list(update_slb($c4,A),$c2,A).
% 2.33/2.51 948 [hyper,123,19,33] {-} pair_in_list(update_slb($c4,A),$c2,A)|pair_in_list(update_slb($c4,A),$c2,$c1).
% 2.33/2.51 5596 [hyper,948,21,34] {-} pair_in_list(update_slb($c4,$c3),$c2,$c3).
% 2.33/2.51 5694 [hyper,5596,21,37] {-} less_than($c3,$c2).
% 2.33/2.51 5777 [hyper,5694,1,50] {-} less_than($c3,$c1).
% 2.33/2.51 5847 [hyper,5777,19,33] {-} pair_in_list(update_slb($c4,$c3),$c2,$c1).
% 2.33/2.51 5959 [hyper,5847,21,34] {-} $F.
% 2.33/2.51
% 2.33/2.51 % SZS output end Refutation
% 2.33/2.51 ------------ end of proof -------------
% 2.33/2.51
% 2.33/2.51
% 2.33/2.51 Search stopped by max_proofs option.
% 2.33/2.51
% 2.33/2.51
% 2.33/2.51 Search stopped by max_proofs option.
% 2.33/2.51
% 2.33/2.51 ============ end of search ============
% 2.33/2.51
% 2.33/2.51 That finishes the proof of the theorem.
% 2.33/2.51
% 2.33/2.51 Process 4869 finished Wed Jun 15 18:27:24 2022
%------------------------------------------------------------------------------