%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:11:53 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 11 20:43:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n023.cluster.edu,
% 0.12/0.35 Mon Jul 11 20:43:39 2022
% 0.12/0.35 The command was "./sos". The process ID is 18860.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 5
% 0.12/0.39 number of clauses initially in problem: 7
% 0.12/0.39 percentage of clauses intially in UL: 71
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 3
% 0.12/0.39 distinct predicate count: 2
% 0.12/0.39 distinct function count: 1
% 0.12/0.39 distinct constant count: 0
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.19/0.52
% 0.19/0.52 -------- PROOF --------
% 0.19/0.52 % SZS status Theorem
% 0.19/0.52 % SZS output start Refutation
% 0.19/0.52
% 0.19/0.52 Model 3 [ 2 1 146 ] (0.00 seconds, 4242 Inserts)
% 0.19/0.52
% 0.19/0.52 Model 4 [ 4 1 99 ] (0.00 seconds, 15108 Inserts)
% 0.19/0.52
% 0.19/0.52 Model 5 [ 4 1 493 ] (0.00 seconds, 15099 Inserts)
% 0.19/0.52
% 0.19/0.52 Model 6 [ 18 0 730 ] (0.00 seconds, 2011 Inserts)
% 0.19/0.52
% 0.19/0.52 Model 7 [ 6 0 204 ] (0.00 seconds, 7271 Inserts)
% 0.19/0.52
% 0.19/0.52 -----> EMPTY CLAUSE at 0.14 sec ----> 77 [hyper,66,5,66] {-} $F.
% 0.19/0.52
% 0.19/0.52 Length of proof is 8. Level of proof is 8.
% 0.19/0.52
% 0.19/0.52 ---------------- PROOF ----------------
% 0.19/0.52 % SZS status Theorem
% 0.19/0.52 % SZS output start Refutation
% 0.19/0.52
% 0.19/0.52 1 [] {+} -big_f(A,B)| -big_f(A,$f1(A,B))|big_g(B,$f1(A,B)).
% 0.19/0.52 2 [] {+} -big_f(A,B)|big_f(A,$f1(A,B))| -big_g(B,$f1(A,B)).
% 0.19/0.52 3 [] {+} -big_f(A,B)| -big_f($f1(A,B),$f1(A,B))|big_g($f1(A,B),$f1(A,B)).
% 0.19/0.52 4 [] {+} big_f(A,B)| -big_g($f1(A,B),$f1(A,B)).
% 0.19/0.52 5 [] {+} -big_g(A,B)| -big_g($f1(A,B),$f1(A,B)).
% 0.19/0.52 6 [] {+} big_f(A,B)|big_f($f1(A,B),$f1(A,B)).
% 0.19/0.52 7 [] {-} big_g(A,B)|big_g($f1(A,B),$f1(A,B)).
% 0.19/0.52 15 [hyper,7,4] {-} big_g(A,B)|big_f(A,B).
% 0.19/0.52 18 [hyper,15,2,6] {+} big_f(A,$f1(B,A))|big_f(B,$f1(B,A))|big_f($f1(B,A),$f1(B,A)).
% 0.19/0.52 19 [factor,18.1.2] {+} big_f(A,$f1(A,A))|big_f($f1(A,A),$f1(A,A)).
% 0.19/0.52 25 [hyper,19,1,6,factor_simp] {+} big_f($f1(A,A),$f1(A,A))|big_g(A,$f1(A,A)).
% 0.19/0.52 31 [hyper,25,5,15] {+} big_f($f1(A,A),$f1(A,A))|big_f($f1(A,$f1(A,A)),$f1(A,$f1(A,A))).
% 0.19/0.52 44 [hyper,31,3,19,factor_simp] {+} big_f($f1(A,A),$f1(A,A))|big_g($f1(A,$f1(A,A)),$f1(A,$f1(A,A))).
% 0.19/0.52 63 [hyper,44,5,25,factor_simp] {-} big_f($f1(A,A),$f1(A,A)).
% 0.19/0.52 66 [hyper,63,3,63] {-} big_g($f1($f1(A,A),$f1(A,A)),$f1($f1(A,A),$f1(A,A))).
% 0.19/0.52 77 [hyper,66,5,66] {-} $F.
% 0.19/0.52
% 0.19/0.52 % SZS output end Refutation
% 0.19/0.52 ------------ end of proof -------------
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Search stopped by max_proofs option.
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Search stopped by max_proofs option.
% 0.19/0.52
% 0.19/0.52 ============ end of search ============
% 0.19/0.52
% 0.19/0.52 ----------- soft-scott stats ----------
% 0.19/0.52
% 0.19/0.52 true clauses given 3 (20.0%)
% 0.19/0.52 false clauses given 12
% 0.19/0.52
% 0.19/0.52 FALSE TRUE
% 0.19/0.52 14 0 1
% 0.19/0.52 17 0 1
% 0.19/0.52 18 0 1
% 0.19/0.52 21 0 1
% 0.19/0.52 23 1 1
% 0.19/0.52 26 1 0
% 0.19/0.52 27 0 2
% 0.19/0.52 29 1 1
% 0.19/0.52 33 0 1
% 0.19/0.52 34 0 1
% 0.19/0.52 37 0 1
% 0.19/0.52 41 1 0
% 0.19/0.52 47 1 0
% 0.19/0.52 50 0 1
% 0.19/0.52 53 0 1
% 0.19/0.52 54 0 1
% 0.19/0.52 57 0 1
% 0.19/0.52 tot: 5 15 (75.0% true)
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Model 7 [ 6 -1 204 ] (0.00 seconds, 7271 Inserts)
% 0.19/0.52
% 0.19/0.52 That finishes the proof of the theorem.
% 0.19/0.52
% 0.19/0.52 Process 18860 finished Mon Jul 11 20:43:40 2022
%------------------------------------------------------------------------------