%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUN060+1 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 : Mon Jul 18 16:38:29 EDT 2022
% Result : Theorem 1.73s 1.92s
% Output : Refutation 1.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN060+1 : TPTP v8.1.0. Released v7.3.0.
% 0.12/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n020.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 : Thu Jun 2 09:13:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox on n020.cluster.edu,
% 0.19/0.35 Thu Jun 2 09:13:53 2022
% 0.19/0.35 The command was "./sos". The process ID is 9328.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 formula_list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=7.
% 0.19/0.35
% 0.19/0.35 This is a non-Horn set without equality. The strategy
% 0.19/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.19/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: set(factor).
% 0.19/0.35 dependent: set(unit_deletion).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35 51 back subsumes 36.
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.41
% 0.19/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 -------------- Softie stats --------------
% 0.19/0.41
% 0.19/0.41 UPDATE_STOP: 300
% 0.19/0.41 SFINDER_TIME_LIMIT: 2
% 0.19/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.41 number of clauses in intial UL: 49
% 0.19/0.41 number of clauses initially in problem: 71
% 0.19/0.41 percentage of clauses intially in UL: 69
% 0.19/0.41 percentage of distinct symbols occuring in initial UL: 36
% 0.19/0.41 percent of all initial clauses that are short: 100
% 0.19/0.41 absolute distinct symbol count: 25
% 0.19/0.41 distinct predicate count: 5
% 0.19/0.41 distinct function count: 19
% 0.19/0.41 distinct constant count: 1
% 0.19/0.41
% 0.19/0.41 ---------- no more Softie stats ----------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 =========== start of search ===========
% 1.73/1.92
% 1.73/1.92 -------- PROOF --------
% 1.73/1.92 % SZS status Theorem
% 1.73/1.92 % SZS output start Refutation
% 1.73/1.92
% 1.73/1.92 Stopped by limit on insertions
% 1.73/1.92
% 1.73/1.92 Model 2 [ 1 1 245 ] (0.00 seconds, 250000 Inserts)
% 1.73/1.92
% 1.73/1.92 Stopped by limit on insertions
% 1.73/1.92
% 1.73/1.92 Model 3 [ 2 1 244 ] (0.00 seconds, 250000 Inserts)
% 1.73/1.92
% 1.73/1.92 Model 4 [ 2 0 2086 ] (0.00 seconds, 2531 Inserts)
% 1.73/1.92
% 1.73/1.92 Model 5 [ 2 0 1091 ] (0.00 seconds, 1721 Inserts)
% 1.73/1.92
% 1.73/1.92 Stopped by limit on insertions
% 1.73/1.92
% 1.73/1.92 Model 6 [ 2 0 1308 ] (0.00 seconds, 250000 Inserts)
% 1.73/1.92
% 1.73/1.92 Stopped by limit on insertions
% 1.73/1.92
% 1.73/1.92 Stopped by limit on insertions
% 1.73/1.92
% 1.73/1.92 Model 7 [ 20 1 588 ] (0.00 seconds, 250000 Inserts)
% 1.73/1.92
% 1.73/1.92 Model 8 [ 17 1 3912 ] (0.00 seconds, 4996 Inserts)
% 1.73/1.92
% 1.73/1.92 Stopped by limit on insertions
% 1.73/1.92
% 1.73/1.92 Model 9 [ 17 1 2538 ] (0.00 seconds, 250000 Inserts)
% 1.73/1.92
% 1.73/1.92 -----> EMPTY CLAUSE at 1.54 sec ----> 155 [hyper,54,21,80,53,75,75,149,75] {-} $F.
% 1.73/1.92
% 1.73/1.92 Length of proof is 3. Level of proof is 1.
% 1.73/1.92
% 1.73/1.92 ---------------- PROOF ----------------
% 1.73/1.92 % SZS status Theorem
% 1.73/1.92 % SZS output start Refutation
% 1.73/1.92
% 1.73/1.92 4 [] {+} r2(A,B)| -id(B,$f1(A)).
% 1.73/1.92 9 [] {+} -id(A,B)|id(B,A).
% 1.73/1.92 12 [] {+} -id(A,B)| -r1(B)|r1(A).
% 1.73/1.92 21 [] {+} -id(A,B)| -r3(C,D,A)| -r2(E,D)| -r2(F,E)| -r2(G,F)| -r1(H)| -r2(H,G).
% 1.73/1.92 51 [] {-} id(A,A).
% 1.73/1.92 53 [] {-} r2(A,$f4(B,A)).
% 1.73/1.92 54 [] {+} r3(A,$f4(A,B),$f5(A,B)).
% 1.73/1.92 62 [] {-} id($f13(A),A).
% 1.73/1.92 67 [] {+} id($f16(A),$f15(A)).
% 1.73/1.92 68 [] {+} r1($f15(A)).
% 1.73/1.92 75 [hyper,51,4] {-} r2(A,$f1(A)).
% 1.73/1.92 80 [hyper,62,9] {-} id(A,$f13(A)).
% 1.73/1.92 149 [hyper,67,12,68] {+} r1($f16(A)).
% 1.73/1.92 155 [hyper,54,21,80,53,75,75,149,75] {-} $F.
% 1.73/1.92
% 1.73/1.92 % SZS output end Refutation
% 1.73/1.92 ------------ end of proof -------------
% 1.73/1.92
% 1.73/1.92
% 1.73/1.92 Search stopped by max_proofs option.
% 1.73/1.92
% 1.73/1.92
% 1.73/1.92 Search stopped by max_proofs option.
% 1.73/1.92
% 1.73/1.92 ============ end of search ============
% 1.73/1.92
% 1.73/1.92 ----------- soft-scott stats ----------
% 1.73/1.92
% 1.73/1.92 true clauses given 2 (12.5%)
% 1.73/1.92 false clauses given 14
% 1.73/1.92
% 1.73/1.92 FALSE TRUE
% 1.73/1.92 4 0 9
% 1.73/1.92 5 7 3
% 1.73/1.92 6 24 2
% 1.73/1.92 7 19 1
% 1.73/1.92 8 10 2
% 1.73/1.92 9 7 0
% 1.73/1.92 10 4 0
% 1.73/1.92 tot: 71 17 (19.3% true)
% 1.73/1.92
% 1.73/1.92
% 1.73/1.92 Model 9 [ 17 1 2538 ] (0.00 seconds, 250000 Inserts)
% 1.73/1.92
% 1.73/1.92 That finishes the proof of the theorem.
% 1.73/1.92
% 1.73/1.92 Process 9328 finished Thu Jun 2 09:13:54 2022
%------------------------------------------------------------------------------