%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYO613-1 : TPTP v8.1.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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 : Thu Jul 21 19:49:59 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO613-1 : TPTP v8.1.0. Released v7.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n029.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 : Fri Jul 8 19:32:45 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 sandbox2 on n029.cluster.edu,
% 0.13/0.36 Fri Jul 8 19:32:45 2022
% 0.13/0.36 The command was "./sos". The process ID is 27480.
% 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 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=23.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive 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: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 2
% 0.20/0.40 number of clauses initially in problem: 6
% 0.20/0.40 percentage of clauses intially in UL: 33
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 33
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 6
% 0.20/0.40 distinct predicate count: 2
% 0.20/0.40 distinct function count: 3
% 0.20/0.40 distinct constant count: 1
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.20/0.42
% 0.20/0.42 -------- PROOF --------
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 -----> EMPTY CLAUSE at 0.03 sec ----> 11 [hyper,10,7,4,4,4,4,4,4,4,4,4,4,4] {-} $F.
% 0.20/0.42
% 0.20/0.42 Length of proof is 2. Level of proof is 1.
% 0.20/0.42
% 0.20/0.42 ---------------- PROOF ----------------
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 3 [] {-} -eq(f(A),a0)| -eq(f(B),a0)| -eq(f(C),a0)| -eq(f(D),a0)| -eq(f(E),a0)| -eq(f(F),a0)| -eq(f(G),a0)| -eq(f(H),a0)| -eq(f(I),a0)| -eq(f(J),a0)| -eq(f(K),a0)| -eq(f(L),a0)| -le(s(A),B)| -le(s(B),C)| -le(s(C),D)| -le(s(D),E)| -le(s(E),F)| -le(s(F),G)| -le(s(G),H)| -le(s(H),I)| -le(s(I),J)| -le(s(J),K)| -le(s(K),L).
% 0.20/0.42 4 [] {+} le(A,A).
% 0.20/0.42 6,5 [] {+} eq(f(A),a0).
% 0.20/0.42 7 [back_demod,3,demod,6,6,6,6,6,6,6,6,6,6,6,6] {-} -eq(a0,a0)| -le(s(A),B)| -le(s(B),C)| -le(s(C),D)| -le(s(D),E)| -le(s(E),F)| -le(s(F),G)| -le(s(G),H)| -le(s(H),I)| -le(s(I),J)| -le(s(J),K)| -le(s(K),L).
% 0.20/0.42 10 [para_into,5.1.1,5.1.1] {+} eq(a0,a0).
% 0.20/0.42 11 [hyper,10,7,4,4,4,4,4,4,4,4,4,4,4] {-} $F.
% 0.20/0.42
% 0.20/0.42 % SZS output end Refutation
% 0.20/0.42 ------------ end of proof -------------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42 ============ end of search ============
% 0.20/0.42
% 0.20/0.42 ----------- soft-scott stats ----------
% 0.20/0.42
% 0.20/0.42 true clauses given 1 (25.0%)
% 0.20/0.42 false clauses given 3
% 0.20/0.42
% 0.20/0.42 FALSE TRUE
% 0.20/0.42 5 0 2
% 0.20/0.42 tot: 0 2 (100.0% true)
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 That finishes the proof of the theorem.
% 0.20/0.42
% 0.20/0.42 Process 27480 finished Fri Jul 8 19:32:45 2022
%------------------------------------------------------------------------------