%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN015-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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 12:09:12 EDT 2022
% Result : Unsatisfiable 2.34s 2.52s
% Output : Refutation 2.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN015-2 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.14/0.33 % Computer : n008.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Tue Jul 12 04:51:53 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.14/0.35 ----- Otter 3.2, August 2001 -----
% 0.14/0.35 The process was started by sandbox on n008.cluster.edu,
% 0.14/0.35 Tue Jul 12 04:51:53 2022
% 0.14/0.35 The command was "./sos". The process ID is 25487.
% 0.14/0.35
% 0.14/0.35 set(prolog_style_variables).
% 0.14/0.35 set(auto).
% 0.14/0.35 dependent: set(auto1).
% 0.14/0.35 dependent: set(process_input).
% 0.14/0.35 dependent: clear(print_kept).
% 0.14/0.35 dependent: clear(print_new_demod).
% 0.14/0.35 dependent: clear(print_back_demod).
% 0.14/0.35 dependent: clear(print_back_sub).
% 0.14/0.35 dependent: set(control_memory).
% 0.14/0.35 dependent: assign(max_mem, 12000).
% 0.14/0.35 dependent: assign(pick_given_ratio, 4).
% 0.14/0.35 dependent: assign(stats_level, 1).
% 0.14/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.35 dependent: assign(sos_limit, 5000).
% 0.14/0.35 dependent: assign(max_weight, 60).
% 0.14/0.35 clear(print_given).
% 0.14/0.35
% 0.14/0.35 list(usable).
% 0.14/0.35
% 0.14/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=6.
% 0.14/0.35
% 0.14/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.35 clauses in usable.
% 0.14/0.35
% 0.14/0.35 dependent: set(knuth_bendix).
% 0.14/0.35 dependent: set(para_from).
% 0.14/0.35 dependent: set(para_into).
% 0.14/0.35 dependent: clear(para_from_right).
% 0.14/0.35 dependent: clear(para_into_right).
% 0.14/0.35 dependent: set(para_from_vars).
% 0.14/0.35 dependent: set(eq_units_both_ways).
% 0.14/0.35 dependent: set(dynamic_demod_all).
% 0.14/0.35 dependent: set(dynamic_demod).
% 0.14/0.35 dependent: set(order_eq).
% 0.14/0.35 dependent: set(back_demod).
% 0.14/0.35 dependent: set(lrpo).
% 0.14/0.35 dependent: set(hyper_res).
% 0.14/0.35 dependent: set(unit_deletion).
% 0.14/0.35 dependent: set(factor).
% 0.14/0.35
% 0.14/0.35 There is a clause for symmetry of equality, so it is
% 0.14/0.35 assumed that equality is fully axiomatized; therefore,
% 0.14/0.35 paramodulation is disabled.
% 0.14/0.35
% 0.14/0.35 dependent: clear(para_from).
% 0.14/0.35 dependent: clear(para_into).
% 0.14/0.35
% 0.14/0.35 ------------> process usable:
% 0.14/0.35
% 0.14/0.35 ------------> process sos:
% 0.14/0.35 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] {-} equalish(A,A).
% 0.14/0.35 29 back subsumes 28.
% 0.14/0.35 29 back subsumes 27.
% 0.14/0.35 29 back subsumes 26.
% 0.14/0.35 29 back subsumes 25.
% 0.14/0.35 29 back subsumes 24.
% 0.14/0.35
% 0.14/0.35 ======= 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: 13
% 0.14/0.39 number of clauses initially in problem: 24
% 0.14/0.39 percentage of clauses intially in UL: 54
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 8
% 0.14/0.39 distinct predicate count: 2
% 0.14/0.39 distinct function count: 2
% 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 ===========
% 2.34/2.52
% 2.34/2.52 -------- PROOF --------
% 2.34/2.52 % SZS status Unsatisfiable
% 2.34/2.52 % SZS output start Refutation
% 2.34/2.52
% 2.34/2.52 Model 3 (0.00 seconds, 0 Inserts)
% 2.34/2.52
% 2.34/2.52 Stopped by limit on number of solutions
% 2.34/2.52
% 2.34/2.52 Model 4 (0.00 seconds, 0 Inserts)
% 2.34/2.52
% 2.34/2.52 Stopped by limit on number of solutions
% 2.34/2.52
% 2.34/2.52 Model 5 (0.00 seconds, 0 Inserts)
% 2.34/2.52
% 2.34/2.52 Stopped by limit on number of solutions
% 2.34/2.52
% 2.34/2.52 Model 6 (0.00 seconds, 0 Inserts)
% 2.34/2.52
% 2.34/2.52 Stopped by limit on number of solutions
% 2.34/2.52
% 2.34/2.52 -----> EMPTY CLAUSE at 2.12 sec ----> 1010 [hyper,931,39,40,demod,1007,unit_del,21,21] {-} $F.
% 2.34/2.52
% 2.34/2.52 Length of proof is 14. Level of proof is 7.
% 2.34/2.52
% 2.34/2.52 ---------------- PROOF ----------------
% 2.34/2.52 % SZS status Unsatisfiable
% 2.34/2.52 % SZS output start Refutation
% 2.34/2.52
% 2.34/2.52 7 [] {-} -equalish(f(A),m)| -element(A,m)|equalish(A,m).
% 2.34/2.52 8 [] {-} -equalish(f(A),A)| -element(A,m)|equalish(A,m).
% 2.34/2.52 9 [] {-} element(A,f(A))| -element(A,m)|equalish(A,m).
% 2.34/2.52 10 [] {-} element(f(A),A)| -element(A,m)|equalish(A,m).
% 2.34/2.52 11 [] {-} -element(A,B)| -element(B,A)|equalish(A,B)|equalish(A,m)|element(B,m)|equalish(B,m).
% 2.34/2.52 16 [] {+} -equalish(A,n)|element(A,k)|equalish(A,k).
% 2.34/2.52 17 [] {-} -element(A,k)|equalish(A,n)|equalish(A,m)|equalish(A,k).
% 2.34/2.52 21 [] {+} -equalish(n,k).
% 2.34/2.52 29 [] {+} equalish(A,A).
% 2.34/2.52 33,32 [] {+} equalish(m,k).
% 2.34/2.52 34 [back_demod,17,demod,33,factor_simp] {+} -element(A,k)|equalish(A,n)|equalish(A,k).
% 2.34/2.52 35 [back_demod,11,demod,33,33,33] {+} -element(A,B)| -element(B,A)|equalish(A,B)|equalish(A,k)|element(B,k)|equalish(B,k).
% 2.34/2.52 36 [back_demod,10,demod,33,33] {+} element(f(A),A)| -element(A,k)|equalish(A,k).
% 2.34/2.52 37 [back_demod,9,demod,33,33] {-} element(A,f(A))| -element(A,k)|equalish(A,k).
% 2.34/2.52 38 [back_demod,8,demod,33,33] {+} -equalish(f(A),A)| -element(A,k)|equalish(A,k).
% 2.34/2.52 39 [back_demod,7,demod,33,33,33] {-} -equalish(f(A),k)| -element(A,k)|equalish(A,k).
% 2.34/2.52 40 [hyper,29,16,unit_del,21] {+} element(n,k).
% 2.34/2.52 42 [hyper,40,37,unit_del,21] {+} element(n,f(n)).
% 2.34/2.52 95 [hyper,36,40,unit_del,21] {+} element(f(n),n).
% 2.34/2.52 116 [hyper,35,42,95,unit_del,21,flip.1] {+} equalish(f(n),n)|element(f(n),k)|equalish(f(n),k).
% 2.34/2.52 925 [hyper,116,39,40,unit_del,21] {-} equalish(f(n),n)|element(f(n),k).
% 2.34/2.52 928 [hyper,925,38,40,unit_del,21] {+} element(f(n),k).
% 2.34/2.52 931 [hyper,928,34] {+} equalish(f(n),n)|equalish(f(n),k).
% 2.34/2.52 1007,1006 [hyper,931,38,40,unit_del,21] {-} equalish(f(n),k).
% 2.34/2.52 1010 [hyper,931,39,40,demod,1007,unit_del,21,21] {-} $F.
% 2.34/2.52
% 2.34/2.52 % SZS output end Refutation
% 2.34/2.52 ------------ end of proof -------------
% 2.34/2.52
% 2.34/2.52
% 2.34/2.52 Search stopped by max_proofs option.
% 2.34/2.52
% 2.34/2.52
% 2.34/2.52 Search stopped by max_proofs option.
% 2.34/2.52
% 2.34/2.52 ============ end of search ============
% 2.34/2.52
% 2.34/2.52 ----------- soft-scott stats ----------
% 2.34/2.52
% 2.34/2.52 true clauses given 35 (67.3%)
% 2.34/2.52 false clauses given 17
% 2.34/2.52
% 2.34/2.52 FALSE TRUE
% 2.34/2.52 10 0 2
% 2.34/2.52 14 0 3
% 2.34/2.52 15 0 2
% 2.34/2.52 16 0 6
% 2.34/2.52 17 0 39
% 2.34/2.52 18 0 32
% 2.34/2.52 19 0 3
% 2.34/2.52 20 0 2
% 2.34/2.52 21 0 2
% 2.34/2.52 22 0 6
% 2.34/2.52 23 0 22
% 2.34/2.52 24 0 16
% 2.34/2.52 25 0 14
% 2.34/2.52 26 0 2
% 2.34/2.52 27 0 12
% 2.34/2.52 28 0 22
% 2.34/2.52 29 0 13
% 2.34/2.52 30 0 3
% 2.34/2.52 31 0 6
% 2.34/2.52 32 0 2
% 2.34/2.52 34 0 6
% 2.34/2.52 35 0 8
% 2.34/2.52 36 0 4
% 2.34/2.52 38 0 6
% 2.34/2.52 39 0 5
% 2.34/2.52 41 0 1
% 2.34/2.52 46 0 4
% 2.34/2.52 tot: 0 243 (100.0% true)
% 2.34/2.52
% 2.34/2.52
% 2.34/2.52 Model 6 (0.00 seconds, 0 Inserts)
% 2.34/2.52
% 2.34/2.52 That finishes the proof of the theorem.
% 2.34/2.52
% 2.34/2.52 Process 25487 finished Tue Jul 12 04:51:55 2022
%------------------------------------------------------------------------------