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