TSTP Solution File: SWV488+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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 : Wed Jul 20 21:38:50 EDT 2022
% Result : Theorem 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n007.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 : Thu Jun 16 00:20:26 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.37 ----- Otter 3.2, August 2001 -----
% 0.19/0.37 The process was started by sandbox on n007.cluster.edu,
% 0.19/0.37 Thu Jun 16 00:20:26 2022
% 0.19/0.37 The command was "./sos". The process ID is 10694.
% 0.19/0.37
% 0.19/0.37 set(prolog_style_variables).
% 0.19/0.37 set(auto).
% 0.19/0.37 dependent: set(auto1).
% 0.19/0.37 dependent: set(process_input).
% 0.19/0.37 dependent: clear(print_kept).
% 0.19/0.37 dependent: clear(print_new_demod).
% 0.19/0.37 dependent: clear(print_back_demod).
% 0.19/0.37 dependent: clear(print_back_sub).
% 0.19/0.37 dependent: set(control_memory).
% 0.19/0.37 dependent: assign(max_mem, 12000).
% 0.19/0.37 dependent: assign(pick_given_ratio, 4).
% 0.19/0.37 dependent: assign(stats_level, 1).
% 0.19/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.37 dependent: assign(sos_limit, 5000).
% 0.19/0.37 dependent: assign(max_weight, 60).
% 0.19/0.37 clear(print_given).
% 0.19/0.37
% 0.19/0.37 formula_list(usable).
% 0.19/0.37
% 0.19/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.19/0.37
% 0.19/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.37 clauses in usable.
% 0.19/0.37
% 0.19/0.37 dependent: set(knuth_bendix).
% 0.19/0.37 dependent: set(para_from).
% 0.19/0.37 dependent: set(para_into).
% 0.19/0.37 dependent: clear(para_from_right).
% 0.19/0.37 dependent: clear(para_into_right).
% 0.19/0.37 dependent: set(para_from_vars).
% 0.19/0.37 dependent: set(eq_units_both_ways).
% 0.19/0.37 dependent: set(dynamic_demod_all).
% 0.19/0.37 dependent: set(dynamic_demod).
% 0.19/0.37 dependent: set(order_eq).
% 0.19/0.37 dependent: set(back_demod).
% 0.19/0.37 dependent: set(lrpo).
% 0.19/0.37 dependent: set(hyper_res).
% 0.19/0.37 dependent: set(unit_deletion).
% 0.19/0.37 dependent: set(factor).
% 0.19/0.37
% 0.19/0.37 ------------> process usable:
% 0.19/0.37
% 0.19/0.37 ------------> process sos:
% 0.19/0.37 Following clause subsumed by 66 during input processing: 0 [copy,66,flip.1] {-} plus(A,B)=plus(B,A).
% 0.19/0.37 Following clause subsumed by 77 during input processing: 0 [copy,77,flip.1] {-} A=A.
% 0.19/0.37
% 0.19/0.37 ======= end of input processing =======
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Failed to model usable list: disabling FINDER
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 -------------- Softie stats --------------
% 0.19/0.45
% 0.19/0.45 UPDATE_STOP: 300
% 0.19/0.45 SFINDER_TIME_LIMIT: 2
% 0.19/0.45 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.45 number of clauses in intial UL: 62
% 0.19/0.45 number of clauses initially in problem: 75
% 0.19/0.45 percentage of clauses intially in UL: 82
% 0.19/0.45 percentage of distinct symbols occuring in initial UL: 84
% 0.19/0.45 percent of all initial clauses that are short: 100
% 0.19/0.45 absolute distinct symbol count: 13
% 0.19/0.45 distinct predicate count: 3
% 0.19/0.45 distinct function count: 3
% 0.19/0.45 distinct constant count: 7
% 0.19/0.45
% 0.19/0.45 ---------- no more Softie stats ----------
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 =========== start of search ===========
% 0.19/0.46
% 0.19/0.46 -------- PROOF --------
% 0.19/0.46 % SZS status Theorem
% 0.19/0.46 % SZS output start Refutation
% 0.19/0.46
% 0.19/0.46 ----> UNIT CONFLICT at 0.08 sec ----> 191 [binary,189.1,12.1] {-} $F.
% 0.19/0.46
% 0.19/0.46 Length of proof is 7. Level of proof is 3.
% 0.19/0.46
% 0.19/0.46 ---------------- PROOF ----------------
% 0.19/0.46 % SZS status Theorem
% 0.19/0.46 % SZS output start Refutation
% 0.19/0.46
% 0.19/0.46 2 [] {+} int_leq(A,B)| -int_less(A,B).
% 0.19/0.46 12 [] {+} real_zero!=real_one.
% 0.19/0.46 14 [] {-} -int_leq(int_one,A)| -int_leq(A,n)| -int_leq(int_one,B)| -int_leq(B,n)| -int_leq(int_one,C)| -int_leq(C,B)|a(C,C)=real_one.
% 0.19/0.46 15 [copy,14,factor_simp,factor_simp] {+} -int_leq(int_one,A)| -int_leq(A,n)| -int_leq(int_one,B)| -int_leq(B,A)|a(B,B)=real_one.
% 0.19/0.46 29 [factor,15.1.3] {+} -int_leq(int_one,A)| -int_leq(A,n)| -int_leq(A,A)|a(A,A)=real_one.
% 0.19/0.46 64 [] {-} int_less(A,B)|int_leq(B,A).
% 0.19/0.46 69 [] {-} int_leq(int_one,$c1).
% 0.19/0.46 71 [] {-} int_leq($c2,n).
% 0.19/0.46 73,72 [] {-} $c2=$c1.
% 0.19/0.46 74 [] {-} a($c2,$c1)=real_zero.
% 0.19/0.46 76,75 [copy,74,demod,73] {-} a($c1,$c1)=real_zero.
% 0.19/0.46 78 [back_demod,71,demod,73] {-} int_leq($c1,n).
% 0.19/0.46 84 [hyper,64,2] {-} int_leq(A,B)|int_leq(B,A).
% 0.19/0.46 85 [factor,84.1.2] {-} int_leq(A,A).
% 0.19/0.46 189 [hyper,85,29,69,78,demod,76] {-} real_zero=real_one.
% 0.19/0.46 191 [binary,189.1,12.1] {-} $F.
% 0.19/0.46
% 0.19/0.46 % SZS output end Refutation
% 0.19/0.46 ------------ end of proof -------------
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 Search stopped by max_proofs option.
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 Search stopped by max_proofs option.
% 0.19/0.46
% 0.19/0.46 ============ end of search ============
% 0.19/0.46
% 0.19/0.46 That finishes the proof of the theorem.
% 0.19/0.46
% 0.19/0.46 Process 10694 finished Thu Jun 16 00:20:26 2022
%------------------------------------------------------------------------------