TSTP Solution File: ANA021-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ANA021-2 : TPTP v8.1.0. Released v3.2.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 : Thu Jul 14 19:27:47 EDT 2022
% Result : Unsatisfiable 0.20s 0.40s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ANA021-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 8 04:46:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n020.cluster.edu,
% 0.13/0.36 Fri Jul 8 04:46:43 2022
% 0.13/0.36 The command was "./sos". The process ID is 31479.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/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: 3
% 0.20/0.40 number of clauses initially in problem: 6
% 0.20/0.40 percentage of clauses intially in UL: 50
% 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: 83
% 0.20/0.40 absolute distinct symbol count: 15
% 0.20/0.40 distinct predicate count: 3
% 0.20/0.40 distinct function count: 6
% 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.20/0.40
% 0.20/0.40 -------- PROOF --------
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40 % SZS output start Refutation
% 0.20/0.40
% 0.20/0.40 ----> UNIT CONFLICT at 0.02 sec ----> 67 [binary,66.1,4.1] {+} $F.
% 0.20/0.40
% 0.20/0.40 Length of proof is 5. Level of proof is 4.
% 0.20/0.40
% 0.20/0.40 ---------------- PROOF ----------------
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40 % SZS output start Refutation
% 0.20/0.40
% 0.20/0.40 1 [] {-} -c_less(c_0,A,tc_nat)|A=c_Suc(c_minus(A,c_1,tc_nat)).
% 0.20/0.40 2 [copy,1,flip.2] {+} -c_less(c_0,A,tc_nat)|c_Suc(c_minus(A,c_1,tc_nat))=A.
% 0.20/0.40 3 [] {+} v_x!=c_0.
% 0.20/0.40 4 [] {+} -c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a).
% 0.20/0.40 5 [] {+} c_less(c_0,A,tc_nat)|A=c_0.
% 0.20/0.40 6 [] {-} c_lessequals(c_HOL_Oabs(v_f(c_Suc(A)),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(A)),t_a),t_a),t_a).
% 0.20/0.40 8 [hyper,5,3] {+} c_less(c_0,v_x,tc_nat).
% 0.20/0.40 26 [para_into,6.1.1.1.1,2.2.1] {-} c_lessequals(c_HOL_Oabs(v_f(A),t_a),c_times(v_c,c_HOL_Oabs(v_h(c_Suc(c_minus(A,c_1,tc_nat))),t_a),t_a),t_a)| -c_less(c_0,A,tc_nat).
% 0.20/0.40 47 [para_into,26.1.2.2.1.1,2.2.1,factor_simp] {-} c_lessequals(c_HOL_Oabs(v_f(A),t_a),c_times(v_c,c_HOL_Oabs(v_h(A),t_a),t_a),t_a)| -c_less(c_0,A,tc_nat).
% 0.20/0.40 66 [hyper,8,47] {-} c_lessequals(c_HOL_Oabs(v_f(v_x),t_a),c_times(v_c,c_HOL_Oabs(v_h(v_x),t_a),t_a),t_a).
% 0.20/0.40 67 [binary,66.1,4.1] {+} $F.
% 0.20/0.40
% 0.20/0.40 % SZS output end Refutation
% 0.20/0.40 ------------ end of proof -------------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Search stopped by max_proofs option.
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Search stopped by max_proofs option.
% 0.20/0.40
% 0.20/0.40 ============ end of search ============
% 0.20/0.40
% 0.20/0.40 ----------- soft-scott stats ----------
% 0.20/0.40
% 0.20/0.40 true clauses given 2 (33.3%)
% 0.20/0.40 false clauses given 4
% 0.20/0.40
% 0.20/0.40 FALSE TRUE
% 0.20/0.40 11 0 1
% 0.20/0.40 15 0 5
% 0.20/0.40 17 0 10
% 0.20/0.40 19 0 12
% 0.20/0.40 21 1 11
% 0.20/0.40 25 0 15
% 0.20/0.40 tot: 1 54 (98.2% true)
% 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 That finishes the proof of the theorem.
% 0.20/0.40
% 0.20/0.40 Process 31479 finished Fri Jul 8 04:46:43 2022
%------------------------------------------------------------------------------