%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN582-1 : TPTP v8.1.0. Released v2.5.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 12:14:17 EDT 2022
% Result : Unsatisfiable 0.76s 0.95s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN582-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 23:51:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox2 on n011.cluster.edu,
% 0.20/0.36 Mon Jul 11 23:51:58 2022
% 0.20/0.36 The command was "./sos". The process ID is 29273.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.20/0.36
% 0.20/0.36 This is a non-Horn set without equality. The strategy
% 0.20/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.20/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 24 back subsumes 18.
% 0.20/0.36 25 back subsumes 19.
% 0.20/0.36 26 back subsumes 20.
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 20
% 0.20/0.40 number of clauses initially in problem: 28
% 0.20/0.40 percentage of clauses intially in UL: 71
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 17
% 0.20/0.40 distinct predicate count: 6
% 0.20/0.40 distinct function count: 5
% 0.20/0.40 distinct constant count: 6
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.76/0.95
% 0.76/0.95 -------- PROOF --------
% 0.76/0.95 % SZS status Unsatisfiable
% 0.76/0.95 % SZS output start Refutation
% 0.76/0.95
% 0.76/0.95 Model 3 (0.00 seconds, 0 Inserts)
% 0.76/0.95
% 0.76/0.95 Stopped by limit on number of solutions
% 0.76/0.95
% 0.76/0.95 Stopped by limit on insertions
% 0.76/0.95
% 0.76/0.95 Model 4 [ 2 1 1113 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 Model 5 (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 Stopped by limit on number of solutions
% 0.76/0.95
% 0.76/0.95 Stopped by limit on insertions
% 0.76/0.95
% 0.76/0.95 Model 6 [ 6 0 480 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 Stopped by limit on insertions
% 0.76/0.95
% 0.76/0.95 Model 7 [ 2 1 537 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 Stopped by limit on insertions
% 0.76/0.95
% 0.76/0.95 Model 8 [ 1 1 604 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 ----> UNIT CONFLICT at 0.56 sec ----> 281 [binary,280.1,1.1] {+} $F.
% 0.76/0.95
% 0.76/0.95 Length of proof is 3. Level of proof is 3.
% 0.76/0.95
% 0.76/0.95 ---------------- PROOF ----------------
% 0.76/0.95 % SZS status Unsatisfiable
% 0.76/0.95 % SZS output start Refutation
% 0.76/0.95
% 0.76/0.95 1 [] {+} -p11(f4(f6(c15,c18)),c16).
% 0.76/0.95 6 [] {+} p2(f4(A),f4(B))| -p2(A,B).
% 0.76/0.95 13 [] {+} p11(A,B)| -p2(C,A)| -p2(D,B)| -p11(C,D).
% 0.76/0.95 15 [] {+} p2(f6(A,B),f6(C,D))| -p2(B,D)| -p5(A,C).
% 0.76/0.95 25 [] {+} p2(A,A).
% 0.76/0.95 26 [] {+} p5(A,A).
% 0.76/0.95 28 [] {+} p2(c13,c18).
% 0.76/0.95 30 [] {-} p11(f4(f6(c15,c13)),c16).
% 0.76/0.95 34 [hyper,28,15,26] {+} p2(f6(A,c13),f6(A,c18)).
% 0.76/0.95 70 [hyper,34,6] {+} p2(f4(f6(A,c13)),f4(f6(A,c18))).
% 0.76/0.95 280 [hyper,70,13,25,30] {-} p11(f4(f6(c15,c18)),c16).
% 0.76/0.95 281 [binary,280.1,1.1] {+} $F.
% 0.76/0.95
% 0.76/0.95 % SZS output end Refutation
% 0.76/0.95 ------------ end of proof -------------
% 0.76/0.95
% 0.76/0.95
% 0.76/0.95 Search stopped by max_proofs option.
% 0.76/0.95
% 0.76/0.95
% 0.76/0.95 Search stopped by max_proofs option.
% 0.76/0.95
% 0.76/0.95 ============ end of search ============
% 0.76/0.95
% 0.76/0.95 ----------- soft-scott stats ----------
% 0.76/0.95
% 0.76/0.95 true clauses given 32 (33.3%)
% 0.76/0.95 false clauses given 64
% 0.76/0.95
% 0.76/0.95 FALSE TRUE
% 0.76/0.95 6 0 2
% 0.76/0.95 7 0 12
% 0.76/0.95 8 0 2
% 0.76/0.95 9 0 21
% 0.76/0.95 10 0 9
% 0.76/0.95 11 0 3
% 0.76/0.95 12 34 16
% 0.76/0.95 13 0 2
% 0.76/0.95 14 31 10
% 0.76/0.95 15 0 1
% 0.76/0.95 16 12 0
% 0.76/0.95 tot: 77 78 (50.3% true)
% 0.76/0.95
% 0.76/0.95
% 0.76/0.95 Model 8 [ 1 1 604 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.95
% 0.76/0.95 That finishes the proof of the theorem.
% 0.76/0.95
% 0.76/0.95 Process 29273 finished Mon Jul 11 23:51:58 2022
%------------------------------------------------------------------------------