TSTP Solution File: NUM837+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM837+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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 : Mon Jul 18 14:22:31 EDT 2022
% Result : Theorem 0.18s 0.41s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM837+1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.12 % Command : sos-script %s
% 0.11/0.33 % Computer : n003.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jul 7 15:12:27 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n003.cluster.edu,
% 0.11/0.34 Thu Jul 7 15:12:27 2022
% 0.11/0.34 The command was "./sos". The process ID is 30009.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 formula_list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.11/0.34
% 0.11/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.34 clauses in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(knuth_bendix).
% 0.11/0.34 dependent: set(para_from).
% 0.11/0.34 dependent: set(para_into).
% 0.11/0.34 dependent: clear(para_from_right).
% 0.11/0.34 dependent: clear(para_into_right).
% 0.11/0.34 dependent: set(para_from_vars).
% 0.11/0.34 dependent: set(eq_units_both_ways).
% 0.11/0.34 dependent: set(dynamic_demod_all).
% 0.11/0.34 dependent: set(dynamic_demod).
% 0.11/0.34 dependent: set(order_eq).
% 0.11/0.34 dependent: set(back_demod).
% 0.11/0.34 dependent: set(lrpo).
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: set(unit_deletion).
% 0.11/0.34 dependent: set(factor).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34 Following clause subsumed by 29 during input processing: 0 [] {-} vsucc(A)!=vsucc(B)|A=B.
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34 Following clause subsumed by 37 during input processing: 0 [demod,43] {-} vplus(A,v1)=vplus(v1,A).
% 0.11/0.34 Following clause subsumed by 37 during input processing: 0 [copy,37,flip.1] {-} vplus(A,B)=vplus(B,A).
% 0.11/0.34 Following clause subsumed by 50 during input processing: 0 [copy,50,flip.1] {-} A=A.
% 0.11/0.34 Following clause subsumed by 47 during input processing: 0 [copy,51,flip.1] {-} vplus(A,vplus(v1,B))=vplus(v1,vplus(A,B)).
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Failed to model usable list: disabling FINDER
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 -------------- Softie stats --------------
% 0.18/0.41
% 0.18/0.41 UPDATE_STOP: 300
% 0.18/0.41 SFINDER_TIME_LIMIT: 2
% 0.18/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.41 number of clauses in intial UL: 24
% 0.18/0.41 number of clauses initially in problem: 37
% 0.18/0.41 percentage of clauses intially in UL: 64
% 0.18/0.41 percentage of distinct symbols occuring in initial UL: 62
% 0.18/0.41 percent of all initial clauses that are short: 100
% 0.18/0.41 absolute distinct symbol count: 16
% 0.18/0.41 distinct predicate count: 5
% 0.18/0.41 distinct function count: 7
% 0.18/0.41 distinct constant count: 4
% 0.18/0.41
% 0.18/0.41 ---------- no more Softie stats ----------
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 =========== start of search ===========
% 0.18/0.41
% 0.18/0.41 -------- PROOF --------
% 0.18/0.41 % SZS status Theorem
% 0.18/0.41 % SZS output start Refutation
% 0.18/0.41
% 0.18/0.41 ----> UNIT CONFLICT at 0.04 sec ----> 64 [binary,62.1,2.1] {-} $F.
% 0.18/0.41
% 0.18/0.41 Length of proof is 3. Level of proof is 2.
% 0.18/0.41
% 0.18/0.41 ---------------- PROOF ----------------
% 0.18/0.41 % SZS status Theorem
% 0.18/0.41 % SZS output start Refutation
% 0.18/0.41
% 0.18/0.41 1 [] {-} vd269!=vplus(vd268,A).
% 0.18/0.41 2 [copy,1,flip.1] {+} vplus(vd268,A)!=vd269.
% 0.18/0.41 16 [] {-} -less(A,B)|B=vplus(A,$f1(B,A)).
% 0.18/0.41 17 [copy,16,flip.2] {+} -less(A,B)|vplus(A,$f1(B,A))=B.
% 0.18/0.41 33 [] {-} less(vd268,vd269).
% 0.18/0.41 62 [hyper,33,17] {-} vplus(vd268,$f1(vd269,vd268))=vd269.
% 0.18/0.41 64 [binary,62.1,2.1] {-} $F.
% 0.18/0.41
% 0.18/0.41 % SZS output end Refutation
% 0.18/0.41 ------------ end of proof -------------
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Search stopped by max_proofs option.
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Search stopped by max_proofs option.
% 0.18/0.41
% 0.18/0.41 ============ end of search ============
% 0.18/0.41
% 0.18/0.41 That finishes the proof of the theorem.
% 0.18/0.41
% 0.18/0.41 Process 30009 finished Thu Jul 7 15:12:27 2022
%------------------------------------------------------------------------------