TSTP Solution File: ANA025-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ANA025-2 : TPTP v8.1.0. Released v3.2.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 : Thu Jul 14 19:27:50 EDT 2022
% Result : Unsatisfiable 0.70s 0.91s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ANA025-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : sos-script %s
% 0.11/0.34 % Computer : n016.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 600
% 0.11/0.34 % DateTime : Fri Jul 8 06:59:08 EDT 2022
% 0.11/0.34 % CPUTime :
% 0.11/0.36 ----- Otter 3.2, August 2001 -----
% 0.11/0.36 The process was started by sandbox2 on n016.cluster.edu,
% 0.11/0.36 Fri Jul 8 06:59:08 2022
% 0.11/0.36 The command was "./sos". The process ID is 6192.
% 0.11/0.36
% 0.11/0.36 set(prolog_style_variables).
% 0.11/0.36 set(auto).
% 0.11/0.36 dependent: set(auto1).
% 0.11/0.36 dependent: set(process_input).
% 0.11/0.36 dependent: clear(print_kept).
% 0.11/0.36 dependent: clear(print_new_demod).
% 0.11/0.36 dependent: clear(print_back_demod).
% 0.11/0.36 dependent: clear(print_back_sub).
% 0.11/0.36 dependent: set(control_memory).
% 0.11/0.36 dependent: assign(max_mem, 12000).
% 0.11/0.36 dependent: assign(pick_given_ratio, 4).
% 0.11/0.36 dependent: assign(stats_level, 1).
% 0.11/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.36 dependent: assign(sos_limit, 5000).
% 0.11/0.36 dependent: assign(max_weight, 60).
% 0.11/0.36 clear(print_given).
% 0.11/0.36
% 0.11/0.36 list(usable).
% 0.11/0.36
% 0.11/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.11/0.36
% 0.11/0.36 This is a non-Horn set without equality. The strategy
% 0.11/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.11/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.11/0.36
% 0.11/0.36 dependent: set(hyper_res).
% 0.11/0.36 dependent: set(factor).
% 0.11/0.36 dependent: set(unit_deletion).
% 0.11/0.36
% 0.11/0.36 ------------> process usable:
% 0.11/0.36
% 0.11/0.36 ------------> process sos:
% 0.11/0.36
% 0.11/0.36 ======= end of input processing =======
% 0.19/0.52
% 0.19/0.52 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 -------------- Softie stats --------------
% 0.19/0.52
% 0.19/0.52 UPDATE_STOP: 300
% 0.19/0.52 SFINDER_TIME_LIMIT: 2
% 0.19/0.52 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.52 number of clauses in intial UL: 12
% 0.19/0.52 number of clauses initially in problem: 13
% 0.19/0.52 percentage of clauses intially in UL: 92
% 0.19/0.52 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.52 percent of all initial clauses that are short: 100
% 0.19/0.52 absolute distinct symbol count: 16
% 0.19/0.52 distinct predicate count: 7
% 0.19/0.52 distinct function count: 6
% 0.19/0.52 distinct constant count: 3
% 0.19/0.52
% 0.19/0.52 ---------- no more Softie stats ----------
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Stopped by limit on insertions
% 0.19/0.52
% 0.19/0.52 =========== start of search ===========
% 0.70/0.91
% 0.70/0.91 -------- PROOF --------
% 0.70/0.91 % SZS status Unsatisfiable
% 0.70/0.91 % SZS output start Refutation
% 0.70/0.91
% 0.70/0.91 Stopped by limit on insertions
% 0.70/0.91
% 0.70/0.91 Stopped by limit on insertions
% 0.70/0.91
% 0.70/0.91 Model 2 [ 2 3 102604 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.91
% 0.70/0.91 Stopped by limit on insertions
% 0.70/0.91
% 0.70/0.91 Model 3 [ 2 2 30002 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.91
% 0.70/0.91 Stopped by limit on insertions
% 0.70/0.91
% 0.70/0.91 ----> UNIT CONFLICT at 0.53 sec ----> 529 [binary,528.1,6.1] {-} $F.
% 0.70/0.91
% 0.70/0.91 Length of proof is 10. Level of proof is 7.
% 0.70/0.91
% 0.70/0.91 ---------------- PROOF ----------------
% 0.70/0.91 % SZS status Unsatisfiable
% 0.70/0.91 % SZS output start Refutation
% 0.70/0.91
% 0.70/0.91 1 [] {+} -class_OrderedGroup_Olordered__ab__group__abs(A)|c_lessequals(c_0,c_HOL_Oabs(B,A),A).
% 0.70/0.91 2 [] {+} -class_Orderings_Olinorder(A)|c_less(B,C,A)|c_lessequals(C,B,A).
% 0.70/0.91 3 [] {+} -class_Orderings_Olinorder(A)| -c_lessequals(B,C,A)| -c_lessequals(D,C,A)|c_lessequals(c_Orderings_Omax(D,B,A),C,A).
% 0.70/0.91 4 [] {+} -class_Orderings_Oorder(A)| -c_lessequals(B,C,A)| -c_lessequals(D,B,A)|c_lessequals(D,C,A).
% 0.70/0.91 5 [] {+} -class_Orderings_Oorder(A)| -c_less(B,C,A)|c_lessequals(B,C,A).
% 0.70/0.91 6 [] {+} -c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b).
% 0.70/0.91 7 [] {+} -c_lessequals(c_Orderings_Omax(c_minus(v_k(v_x),v_g(v_x),t_b),c_0,t_b),c_HOL_Oabs(c_minus(v_f(v_x),v_g(v_x),t_b),t_b),t_b).
% 0.70/0.91 8 [] {+} -class_LOrder_Ojoin__semilorder(A)|class_Orderings_Oorder(A).
% 0.70/0.91 9 [] {+} -class_OrderedGroup_Olordered__ab__group__abs(A)|class_LOrder_Ojoin__semilorder(A).
% 0.70/0.91 10 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_Orderings_Olinorder(A).
% 0.70/0.91 11 [] {+} -class_Ring__and__Field_Oordered__idom(A)|class_OrderedGroup_Olordered__ab__group__abs(A).
% 0.70/0.91 13 [] {-} class_Ring__and__Field_Oordered__idom(t_b).
% 0.70/0.91 14 [hyper,13,11] {-} class_OrderedGroup_Olordered__ab__group__abs(t_b).
% 0.70/0.91 15 [hyper,13,10] {+} class_Orderings_Olinorder(t_b).
% 0.70/0.91 16 [hyper,14,9] {+} class_LOrder_Ojoin__semilorder(t_b).
% 0.70/0.91 17 [hyper,14,1] {-} c_lessequals(c_0,c_HOL_Oabs(A,t_b),t_b).
% 0.70/0.91 18 [hyper,15,2] {+} c_less(A,B,t_b)|c_lessequals(B,A,t_b).
% 0.70/0.91 19 [hyper,16,8] {+} class_Orderings_Oorder(t_b).
% 0.70/0.91 25 [hyper,18,4,19,17] {+} c_less(c_0,A,t_b)|c_lessequals(A,c_HOL_Oabs(B,t_b),t_b).
% 0.70/0.91 366 [hyper,25,3,15,17] {-} c_less(c_0,A,t_b)|c_lessequals(c_Orderings_Omax(A,c_0,t_b),c_HOL_Oabs(B,t_b),t_b).
% 0.70/0.91 484 [hyper,366,7] {-} c_less(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b).
% 0.70/0.91 528 [hyper,484,5,19] {-} c_lessequals(c_0,c_minus(v_k(v_x),v_g(v_x),t_b),t_b).
% 0.70/0.91 529 [binary,528.1,6.1] {-} $F.
% 0.70/0.91
% 0.70/0.91 % SZS output end Refutation
% 0.70/0.91 ------------ end of proof -------------
% 0.70/0.91
% 0.70/0.91
% 0.70/0.91 Search stopped by max_proofs option.
% 0.70/0.91
% 0.70/0.91
% 0.70/0.91 Search stopped by max_proofs option.
% 0.70/0.91
% 0.70/0.91 ============ end of search ============
% 0.70/0.91
% 0.70/0.91 ----------- soft-scott stats ----------
% 0.70/0.91
% 0.70/0.91 true clauses given 10 (35.7%)
% 0.70/0.91 false clauses given 18
% 0.70/0.91
% 0.70/0.91 FALSE TRUE
% 0.70/0.91 11 0 1
% 0.70/0.91 12 0 1
% 0.70/0.91 13 1 6
% 0.70/0.91 14 0 4
% 0.70/0.91 15 0 11
% 0.70/0.91 16 5 10
% 0.70/0.91 17 6 10
% 0.70/0.91 18 13 22
% 0.70/0.91 19 12 21
% 0.70/0.91 20 16 7
% 0.70/0.91 21 29 20
% 0.70/0.91 22 23 22
% 0.70/0.91 23 13 21
% 0.70/0.91 24 28 12
% 0.70/0.91 25 23 11
% 0.70/0.91 26 20 2
% 0.70/0.91 27 27 5
% 0.70/0.91 28 10 2
% 0.70/0.91 29 6 8
% 0.70/0.91 30 6 0
% 0.70/0.91 31 2 2
% 0.70/0.91 33 4 1
% 0.70/0.91 tot: 244 199 (44.9% true)
% 0.70/0.91
% 0.70/0.91
% 0.70/0.91 Model 3 [ 2 -8 30002 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.91
% 0.70/0.91 That finishes the proof of the theorem.
% 0.70/0.91
% 0.70/0.91 Process 6192 finished Fri Jul 8 06:59:08 2022
%------------------------------------------------------------------------------