%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL674+1.005 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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 : Sun Jul 17 14:32:00 EDT 2022
% Result : Theorem 1.02s 1.19s
% Output : Refutation 1.02s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL674+1.005 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.13/0.32 % Computer : n016.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Sat Jul 2 14:25:14 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.17/0.34 ----- Otter 3.2, August 2001 -----
% 0.17/0.34 The process was started by sandbox on n016.cluster.edu,
% 0.17/0.34 Sat Jul 2 14:25:14 2022
% 0.17/0.34 The command was "./sos". The process ID is 10003.
% 0.17/0.34
% 0.17/0.34 set(prolog_style_variables).
% 0.17/0.34 set(auto).
% 0.17/0.34 dependent: set(auto1).
% 0.17/0.34 dependent: set(process_input).
% 0.17/0.34 dependent: clear(print_kept).
% 0.17/0.34 dependent: clear(print_new_demod).
% 0.17/0.34 dependent: clear(print_back_demod).
% 0.17/0.34 dependent: clear(print_back_sub).
% 0.17/0.34 dependent: set(control_memory).
% 0.17/0.34 dependent: assign(max_mem, 12000).
% 0.17/0.34 dependent: assign(pick_given_ratio, 4).
% 0.17/0.34 dependent: assign(stats_level, 1).
% 0.17/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.17/0.34 dependent: assign(sos_limit, 5000).
% 0.17/0.34 dependent: assign(max_weight, 60).
% 0.17/0.34 clear(print_given).
% 0.17/0.34
% 0.17/0.34 formula_list(usable).
% 0.17/0.34
% 0.17/0.34 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.17/0.34
% 0.17/0.34 This is a non-Horn set without equality. The strategy
% 0.17/0.34 will be ordered hyper_res, ur_res, unit deletion, and
% 0.17/0.34 factoring, with satellites in sos and nuclei in usable.
% 0.17/0.34
% 0.17/0.34 dependent: set(hyper_res).
% 0.17/0.34 dependent: set(factor).
% 0.17/0.34 dependent: set(unit_deletion).
% 0.17/0.34
% 0.17/0.34 ------------> process usable:
% 0.17/0.34 Following clause subsumed by 2 during input processing: 0 [] {-} -r1($c1,A)| -r1(A,B)| -p3(B)| -p102(B)|p3(A)| -p102(A).
% 0.17/0.34
% 0.17/0.34 ------------> process sos:
% 0.17/0.34
% 0.17/0.34 ======= end of input processing =======
% 0.17/0.38
% 0.17/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.38
% 0.17/0.38 Stopped by limit on number of solutions
% 0.17/0.38
% 0.17/0.38
% 0.17/0.38 -------------- Softie stats --------------
% 0.17/0.38
% 0.17/0.38 UPDATE_STOP: 300
% 0.17/0.38 SFINDER_TIME_LIMIT: 2
% 0.17/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.38 number of clauses in intial UL: 60
% 0.17/0.38 number of clauses initially in problem: 62
% 0.17/0.38 percentage of clauses intially in UL: 96
% 0.17/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.17/0.38 percent of all initial clauses that are short: 100
% 0.17/0.38 absolute distinct symbol count: 25
% 0.17/0.38 distinct predicate count: 14
% 0.17/0.38 distinct function count: 10
% 0.17/0.38 distinct constant count: 1
% 0.17/0.38
% 0.17/0.38 ---------- no more Softie stats ----------
% 0.17/0.38
% 0.17/0.38
% 0.17/0.38
% 0.17/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.17/0.38
% 0.17/0.38 Stopped by limit on number of solutions
% 0.17/0.38
% 0.17/0.38 =========== start of search ===========
% 1.02/1.19
% 1.02/1.19 -------- PROOF --------
% 1.02/1.19 % SZS status Theorem
% 1.02/1.19 % SZS output start Refutation
% 1.02/1.19
% 1.02/1.19 Stopped by limit on insertions
% 1.02/1.19
% 1.02/1.19 Model 3 [ 1 1 1685 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.19
% 1.02/1.19 Stopped by limit on insertions
% 1.02/1.19
% 1.02/1.19 Model 4 [ 1 0 151 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.19
% 1.02/1.19 Stopped by limit on insertions
% 1.02/1.19
% 1.02/1.19 Model 5 [ 1 0 210 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.19
% 1.02/1.19 Stopped by limit on insertions
% 1.02/1.19
% 1.02/1.19 Model 6 [ 1 0 173 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.19
% 1.02/1.19 Stopped by limit on insertions
% 1.02/1.19
% 1.02/1.19 Model 7 [ 1 1 410 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.19
% 1.02/1.19 Stopped by limit on insertions
% 1.02/1.19
% 1.02/1.19 Model 8 [ 2 1 522 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.19
% 1.02/1.19 Stopped by limit on insertions
% 1.02/1.19
% 1.02/1.19 Model 9 [ 2 0 178 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.19
% 1.02/1.19 Stopped by limit on insertions
% 1.02/1.19
% 1.02/1.19 Model 10 [ 5 0 244 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.19
% 1.02/1.19 Stopped by limit on insertions
% 1.02/1.19
% 1.02/1.19 Model 11 [ 1 0 232 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.19
% 1.02/1.19 Stopped by limit on insertions
% 1.02/1.19
% 1.02/1.20 Model 12 [ 2 0 653 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.20
% 1.02/1.20 Stopped by limit on insertions
% 1.02/1.20
% 1.02/1.20 Model 13 [ 1 0 533 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.20
% 1.02/1.20 ----> UNIT CONFLICT at 0.83 sec ----> 121 [binary,120.1,60.1] {+} $F.
% 1.02/1.20
% 1.02/1.20 Length of proof is 8. Level of proof is 7.
% 1.02/1.20
% 1.02/1.20 ---------------- PROOF ----------------
% 1.02/1.20 % SZS status Theorem
% 1.02/1.20 % SZS output start Refutation
% 1.02/1.20
% 1.02/1.20 1 [] {+} -r1(A,B)| -r1(B,C)|r1(A,C).
% 1.02/1.20 2 [] {+} -r1($c1,A)|p3(A).
% 1.02/1.20 27 [] {+} -r1($c1,A)|r1(A,$f7(A))|p102(A)| -p101(A).
% 1.02/1.20 28 [] {+} -r1($c1,A)| -p3($f7(A))|p102(A)| -p101(A).
% 1.02/1.20 39 [] {+} -r1($c1,A)|r1(A,$f10(A))|p101(A)| -p100(A).
% 1.02/1.20 41 [] {+} -r1($c1,A)| -p102($f10(A))|p101(A)| -p100(A).
% 1.02/1.20 42 [] {+} -r1($c1,A)|p101($f10(A))|p101(A)| -p100(A).
% 1.02/1.20 60 [] {+} -p101($c1).
% 1.02/1.20 61 [] {+} r1(A,A).
% 1.02/1.20 62 [] {+} p100($c1).
% 1.02/1.20 64 [hyper,62,42,61,unit_del,60] {+} p101($f10($c1)).
% 1.02/1.20 66 [hyper,62,39,61,unit_del,60] {+} r1($c1,$f10($c1)).
% 1.02/1.20 74 [hyper,66,27,64] {+} r1($f10($c1),$f7($f10($c1)))|p102($f10($c1)).
% 1.02/1.20 97 [hyper,74,41,61,62,unit_del,60] {+} r1($f10($c1),$f7($f10($c1))).
% 1.02/1.20 98 [hyper,97,1,66] {+} r1($c1,$f7($f10($c1))).
% 1.02/1.20 105 [hyper,98,2] {+} p3($f7($f10($c1))).
% 1.02/1.20 116 [hyper,105,28,66,64] {+} p102($f10($c1)).
% 1.02/1.20 120 [hyper,116,41,61,62] {-} p101($c1).
% 1.02/1.20 121 [binary,120.1,60.1] {+} $F.
% 1.02/1.20
% 1.02/1.20 % SZS output end Refutation
% 1.02/1.20 ------------ end of proof -------------
% 1.02/1.20
% 1.02/1.20
% 1.02/1.20 Search stopped by max_proofs option.
% 1.02/1.20
% 1.02/1.20
% 1.02/1.20 Search stopped by max_proofs option.
% 1.02/1.20
% 1.02/1.20 ============ end of search ============
% 1.02/1.20
% 1.02/1.20 ----------- soft-scott stats ----------
% 1.02/1.20
% 1.02/1.20 true clauses given 27 (64.3%)
% 1.02/1.20 false clauses given 15
% 1.02/1.20
% 1.02/1.20 FALSE TRUE
% 1.02/1.20 5 0 1
% 1.02/1.20 6 0 1
% 1.02/1.20 9 0 5
% 1.02/1.20 12 0 4
% 1.02/1.20 14 0 3
% 1.02/1.20 17 0 2
% 1.02/1.20 tot: 0 16 (100.0% true)
% 1.02/1.20
% 1.02/1.20
% 1.02/1.20 Model 13 [ 1 0 533 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.20
% 1.02/1.20 That finishes the proof of the theorem.
% 1.02/1.20
% 1.02/1.20 Process 10003 finished Sat Jul 2 14:25:15 2022
%------------------------------------------------------------------------------