TSTP Solution File: SYN580-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN580-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:16 EDT 2022
% Result : Unsatisfiable 0.63s 0.81s
% Output : Refutation 0.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN580-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n019.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 : Tue Jul 12 05:46:08 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 sandbox2 on n019.cluster.edu,
% 0.12/0.35 Tue Jul 12 05:46:08 2022
% 0.12/0.35 The command was "./sos". The process ID is 18837.
% 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 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 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 21 back subsumes 17.
% 0.12/0.35 22 back subsumes 18.
% 0.12/0.35 23 back subsumes 19.
% 0.12/0.35 24 back subsumes 20.
% 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: 16
% 0.12/0.39 number of clauses initially in problem: 23
% 0.12/0.39 percentage of clauses intially in UL: 69
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 93
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 15
% 0.12/0.39 distinct predicate count: 7
% 0.12/0.39 distinct function count: 3
% 0.12/0.39 distinct constant count: 5
% 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.63/0.81
% 0.63/0.81 -------- PROOF --------
% 0.63/0.81 % SZS status Unsatisfiable
% 0.63/0.81 % SZS output start Refutation
% 0.63/0.81
% 0.63/0.81 Model 3 (0.00 seconds, 0 Inserts)
% 0.63/0.81
% 0.63/0.81 Stopped by limit on number of solutions
% 0.63/0.81
% 0.63/0.81 Model 4 (0.00 seconds, 0 Inserts)
% 0.63/0.81
% 0.63/0.81 Stopped by limit on number of solutions
% 0.63/0.81
% 0.63/0.81 Model 5 (0.00 seconds, 0 Inserts)
% 0.63/0.81
% 0.63/0.81 Stopped by limit on number of solutions
% 0.63/0.81
% 0.63/0.81 Stopped by limit on insertions
% 0.63/0.81
% 0.63/0.81 Model 6 [ 3 1 615 ] (0.00 seconds, 250000 Inserts)
% 0.63/0.81
% 0.63/0.81 Stopped by limit on insertions
% 0.63/0.81
% 0.63/0.81 Model 7 [ 3 0 432 ] (0.00 seconds, 250000 Inserts)
% 0.63/0.81
% 0.63/0.81 Stopped by limit on insertions
% 0.63/0.81
% 0.63/0.81 Model 8 [ 6 1 316 ] (0.00 seconds, 250000 Inserts)
% 0.63/0.81
% 0.63/0.81 Stopped by limit on insertions
% 0.63/0.81
% 0.63/0.81 Model 9 [ 6 1 420 ] (0.00 seconds, 250000 Inserts)
% 0.63/0.81
% 0.63/0.81 ----> UNIT CONFLICT at 0.44 sec ----> 46 [binary,45.1,1.1] {-} $F.
% 0.63/0.81
% 0.63/0.81 Length of proof is 5. Level of proof is 4.
% 0.63/0.81
% 0.63/0.81 ---------------- PROOF ----------------
% 0.63/0.81 % SZS status Unsatisfiable
% 0.63/0.81 % SZS output start Refutation
% 0.63/0.81
% 0.63/0.81 1 [] {+} -p8(c12,c13,c14).
% 0.63/0.81 8 [] {+} p2(A,B)| -p2(C,A)| -p2(C,B).
% 0.63/0.81 9 [] {+} p8(c12,A,B)| -p11(B,c16)| -p9(c12,A).
% 0.63/0.81 11 [] {+} p9(c12,f6(A))|p8(c12,B,f3(A))| -p9(c12,B).
% 0.63/0.81 15 [] {+} p8(c12,A,f3(B))| -p9(c12,A)| -p8(c12,f6(B),B).
% 0.63/0.81 16 [] {+} p8(A,B,C)| -p2(D,C)| -p4(E,B)| -p7(F,A)| -p8(F,E,D).
% 0.63/0.81 22 [] {+} p7(A,A).
% 0.63/0.81 23 [] {+} p4(A,A).
% 0.63/0.81 24 [] {+} p2(A,A).
% 0.63/0.81 25 [] {+} p11(c15,c16).
% 0.63/0.81 26 [] {+} p9(c12,c13).
% 0.63/0.81 27 [] {+} p2(c14,f3(c15)).
% 0.63/0.81 28 [hyper,26,11] {+} p9(c12,f6(A))|p8(c12,c13,f3(A)).
% 0.63/0.81 31 [hyper,27,8,24] {+} p2(f3(c15),c14).
% 0.63/0.81 40 [hyper,28,9,25] {-} p8(c12,c13,f3(A))|p8(c12,f6(A),c15).
% 0.63/0.81 43 [hyper,40,15,26,factor_simp] {+} p8(c12,c13,f3(c15)).
% 0.63/0.81 45 [hyper,43,16,31,23,22] {-} p8(c12,c13,c14).
% 0.63/0.81 46 [binary,45.1,1.1] {-} $F.
% 0.63/0.81
% 0.63/0.81 % SZS output end Refutation
% 0.63/0.81 ------------ end of proof -------------
% 0.63/0.81
% 0.63/0.81
% 0.63/0.81 Search stopped by max_proofs option.
% 0.63/0.81
% 0.63/0.81
% 0.63/0.81 Search stopped by max_proofs option.
% 0.63/0.81
% 0.63/0.81 ============ end of search ============
% 0.63/0.81
% 0.63/0.81 ----------- soft-scott stats ----------
% 0.63/0.81
% 0.63/0.81 true clauses given 5 (35.7%)
% 0.63/0.81 false clauses given 9
% 0.63/0.81
% 0.63/0.81 FALSE TRUE
% 0.63/0.81 6 0 5
% 0.63/0.81 8 0 1
% 0.63/0.81 11 0 1
% 0.63/0.81 14 0 1
% 0.63/0.81 15 0 1
% 0.63/0.81 tot: 0 9 (100.0% true)
% 0.63/0.81
% 0.63/0.81
% 0.63/0.81 Model 9 [ 6 1 420 ] (0.00 seconds, 250000 Inserts)
% 0.63/0.81
% 0.63/0.81 That finishes the proof of the theorem.
% 0.63/0.81
% 0.63/0.81 Process 18837 finished Tue Jul 12 05:46:08 2022
%------------------------------------------------------------------------------