%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYO691-1.001 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:50:24 EDT 2022
% Result : Unsatisfiable 2.15s 2.36s
% Output : Refutation 2.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO691-1.001 : TPTP v8.1.0. Released v7.3.0.
% 0.12/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n011.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 : Sat Jul 9 13:18:10 EDT 2022
% 0.21/0.34 % CPUTime :
% 0.21/0.36 ----- Otter 3.2, August 2001 -----
% 0.21/0.36 The process was started by sandbox on n011.cluster.edu,
% 0.21/0.36 Sat Jul 9 13:18:10 2022
% 0.21/0.36 The command was "./sos". The process ID is 31917.
% 0.21/0.36
% 0.21/0.36 set(prolog_style_variables).
% 0.21/0.36 set(auto).
% 0.21/0.36 dependent: set(auto1).
% 0.21/0.36 dependent: set(process_input).
% 0.21/0.36 dependent: clear(print_kept).
% 0.21/0.36 dependent: clear(print_new_demod).
% 0.21/0.36 dependent: clear(print_back_demod).
% 0.21/0.36 dependent: clear(print_back_sub).
% 0.21/0.36 dependent: set(control_memory).
% 0.21/0.36 dependent: assign(max_mem, 12000).
% 0.21/0.36 dependent: assign(pick_given_ratio, 4).
% 0.21/0.36 dependent: assign(stats_level, 1).
% 0.21/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.36 dependent: assign(sos_limit, 5000).
% 0.21/0.36 dependent: assign(max_weight, 60).
% 0.21/0.36 clear(print_given).
% 0.21/0.36
% 0.21/0.36 list(usable).
% 0.21/0.36
% 0.21/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.21/0.36
% 0.21/0.36 This is a Horn set without equality. The strategy will
% 0.21/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.21/0.36 in usable.
% 0.21/0.36
% 0.21/0.36 dependent: set(hyper_res).
% 0.21/0.36 dependent: clear(order_hyper).
% 0.21/0.36
% 0.21/0.36 ------------> process usable:
% 0.21/0.36
% 0.21/0.36 ------------> process sos:
% 0.21/0.36
% 0.21/0.36 ======= end of input processing =======
% 0.21/0.38
% 0.21/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.38
% 0.21/0.38 Stopped by limit on number of solutions
% 0.21/0.38
% 0.21/0.38
% 0.21/0.38 -------------- Softie stats --------------
% 0.21/0.38
% 0.21/0.38 UPDATE_STOP: 300
% 0.21/0.38 SFINDER_TIME_LIMIT: 2
% 0.21/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.38 number of clauses in intial UL: 5
% 0.21/0.38 number of clauses initially in problem: 7
% 0.21/0.38 percentage of clauses intially in UL: 71
% 0.21/0.38 percentage of distinct symbols occuring in initial UL: 85
% 0.21/0.38 percent of all initial clauses that are short: 100
% 0.21/0.38 absolute distinct symbol count: 7
% 0.21/0.38 distinct predicate count: 3
% 0.21/0.38 distinct function count: 2
% 0.21/0.38 distinct constant count: 2
% 0.21/0.38
% 0.21/0.38 ---------- no more Softie stats ----------
% 0.21/0.38
% 0.21/0.38
% 0.21/0.38
% 0.21/0.38 =========== start of search ===========
% 2.15/2.36
% 2.15/2.36 -------- PROOF --------
% 2.15/2.36 % SZS status Unsatisfiable
% 2.15/2.36 % SZS output start Refutation
% 2.15/2.36
% 2.15/2.36 Model 2 (0.00 seconds, 0 Inserts)
% 2.15/2.36
% 2.15/2.36 Stopped by limit on number of solutions
% 2.15/2.36
% 2.15/2.36 ----> UNIT CONFLICT at 1.97 sec ----> 1412 [binary,1411.1,1.1] {+} $F.
% 2.15/2.36
% 2.15/2.36 Length of proof is 9. Level of proof is 6.
% 2.15/2.36
% 2.15/2.36 ---------------- PROOF ----------------
% 2.15/2.36 % SZS status Unsatisfiable
% 2.15/2.36 % SZS output start Refutation
% 2.15/2.36
% 2.15/2.36 1 [] {+} -seq(succ(succ(succ(succ(succ(zero))))),A,A).
% 2.15/2.36 2 [] {+} -top(A,B)|step(A,B).
% 2.15/2.36 3 [] {+} -step(A,B)|step(f(A,C),f(B,C)).
% 2.15/2.36 5 [] {+} -seq(A,B,C)| -step(C,D)|seq(succ(A),B,D).
% 2.15/2.36 6 [] {+} top(f(f(f(A,a),B),f(C,a)),f(f(C,f(f(B,a),a)),A)).
% 2.15/2.36 7 [] {+} seq(zero,A,A).
% 2.15/2.36 8 [hyper,6,2] {-} step(f(f(f(A,a),B),f(C,a)),f(f(C,f(f(B,a),a)),A)).
% 2.15/2.36 9 [hyper,8,5,7] {-} seq(succ(zero),f(f(f(A,a),B),f(C,a)),f(f(C,f(f(B,a),a)),A)).
% 2.15/2.36 11 [hyper,8,3] {-} step(f(f(f(f(A,a),B),f(C,a)),D),f(f(f(C,f(f(B,a),a)),A),D)).
% 2.15/2.36 17 [hyper,11,5,9] {-} seq(succ(succ(zero)),f(f(f(A,a),B),f(f(f(C,a),D),a)),f(f(f(f(B,a),f(f(D,a),a)),C),A)).
% 2.15/2.36 20 [hyper,11,3] {-} step(f(f(f(f(f(A,a),B),f(C,a)),D),E),f(f(f(f(C,f(f(B,a),a)),A),D),E)).
% 2.15/2.36 53 [hyper,20,3] {-} step(f(f(f(f(f(f(A,a),B),f(C,a)),D),E),F),f(f(f(f(f(C,f(f(B,a),a)),A),D),E),F)).
% 2.15/2.36 74 [hyper,17,5,20] {-} seq(succ(succ(succ(zero))),f(f(f(A,a),f(B,a)),f(f(f(C,a),D),a)),f(f(f(f(f(D,a),f(f(a,a),a)),B),C),A)).
% 2.15/2.36 297 [hyper,74,5,53] {-} seq(succ(succ(succ(succ(zero)))),f(f(f(A,a),f(B,a)),f(f(f(C,a),f(D,a)),a)),f(f(f(f(f(f(a,a),f(f(a,a),a)),D),B),C),A)).
% 2.15/2.36 1411 [hyper,297,5,53] {-} seq(succ(succ(succ(succ(succ(zero))))),f(f(f(A,a),f(B,a)),f(f(f(C,a),f(f(D,a),a)),a)),f(f(f(f(f(D,f(f(f(f(a,a),a),a),a)),a),B),C),A)).
% 2.15/2.36 1412 [binary,1411.1,1.1] {+} $F.
% 2.15/2.36
% 2.15/2.36 % SZS output end Refutation
% 2.15/2.36 ------------ end of proof -------------
% 2.15/2.36
% 2.15/2.36
% 2.15/2.36 Search stopped by max_proofs option.
% 2.15/2.36
% 2.15/2.36
% 2.15/2.36 Search stopped by max_proofs option.
% 2.15/2.36
% 2.15/2.36 ============ end of search ============
% 2.15/2.36
% 2.15/2.36 ----------- soft-scott stats ----------
% 2.15/2.36
% 2.15/2.36 true clauses given 1 (0.7%)
% 2.15/2.36 false clauses given 149
% 2.15/2.36
% 2.15/2.36 FALSE TRUE
% 2.15/2.36 39 0 1
% 2.15/2.36 40 2 1
% 2.15/2.36 41 32 0
% 2.15/2.36 42 32 0
% 2.15/2.36 43 87 0
% 2.15/2.36 44 13 0
% 2.15/2.36 46 76 0
% 2.15/2.36 47 30 0
% 2.15/2.36 48 8 0
% 2.15/2.36 50 85 0
% 2.15/2.36 51 39 0
% 2.15/2.36 52 12 0
% 2.15/2.36 54 160 0
% 2.15/2.36 55 111 0
% 2.15/2.36 56 42 0
% 2.15/2.36 58 224 0
% 2.15/2.36 59 223 0
% 2.15/2.36 60 76 0
% 2.15/2.36 tot: 1252 2 (0.2% true)
% 2.15/2.36
% 2.15/2.36
% 2.15/2.36 Model 2 (0.00 seconds, 0 Inserts)
% 2.15/2.36
% 2.15/2.36 That finishes the proof of the theorem.
% 2.15/2.36
% 2.15/2.36 Process 31917 finished Sat Jul 9 13:18:12 2022
%------------------------------------------------------------------------------