TSTP Solution File: SWW469+5 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWW469+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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 21 01:26:54 EDT 2022
% Result : Theorem 1.45s 1.67s
% Output : Refutation 1.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWW469+5 : TPTP v8.1.0. Released v5.3.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n021.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 4 20:59:04 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.40 ----- Otter 3.2, August 2001 -----
% 0.14/0.40 The process was started by sandbox2 on n021.cluster.edu,
% 0.14/0.40 Sat Jun 4 20:59:04 2022
% 0.14/0.40 The command was "./sos". The process ID is 16513.
% 0.14/0.40
% 0.14/0.40 set(prolog_style_variables).
% 0.14/0.40 set(auto).
% 0.14/0.40 dependent: set(auto1).
% 0.14/0.40 dependent: set(process_input).
% 0.14/0.40 dependent: clear(print_kept).
% 0.14/0.40 dependent: clear(print_new_demod).
% 0.14/0.40 dependent: clear(print_back_demod).
% 0.14/0.40 dependent: clear(print_back_sub).
% 0.14/0.40 dependent: set(control_memory).
% 0.14/0.40 dependent: assign(max_mem, 12000).
% 0.14/0.40 dependent: assign(pick_given_ratio, 4).
% 0.14/0.40 dependent: assign(stats_level, 1).
% 0.14/0.40 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.40 dependent: assign(sos_limit, 5000).
% 0.14/0.40 dependent: assign(max_weight, 60).
% 0.14/0.40 clear(print_given).
% 0.14/0.40
% 0.14/0.40 formula_list(usable).
% 0.14/0.40
% 0.14/0.40 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.14/0.40
% 0.14/0.40 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.40 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.40 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.40 clauses in usable.
% 0.14/0.40
% 0.14/0.40 dependent: set(knuth_bendix).
% 0.14/0.40 dependent: set(para_from).
% 0.14/0.40 dependent: set(para_into).
% 0.14/0.40 dependent: clear(para_from_right).
% 0.14/0.40 dependent: clear(para_into_right).
% 0.14/0.40 dependent: set(para_from_vars).
% 0.14/0.40 dependent: set(eq_units_both_ways).
% 0.14/0.40 dependent: set(dynamic_demod_all).
% 0.14/0.40 dependent: set(dynamic_demod).
% 0.14/0.40 dependent: set(order_eq).
% 0.14/0.40 dependent: set(back_demod).
% 0.14/0.40 dependent: set(lrpo).
% 0.14/0.40 dependent: set(hyper_res).
% 0.14/0.40 dependent: set(unit_deletion).
% 0.14/0.40 dependent: set(factor).
% 0.14/0.40
% 0.14/0.40 ------------> process usable:
% 0.14/0.40 Following clause subsumed by 10 during input processing: 0 [] {-} -cl_HOL_Oequal(A)|fequal(A)=equal_equal(A).
% 0.14/0.40
% 0.14/0.40 ------------> process sos:
% 0.14/0.40 Following clause subsumed by 87 during input processing: 0 [] {-} hBOOL(induct_true).
% 0.14/0.40 97 back subsumes 77.
% 0.14/0.40 Following clause subsumed by 99 during input processing: 0 [copy,99,flip.1] {-} A=A.
% 0.14/0.40 Following clause subsumed by 88 during input processing: 0 [copy,100,flip.1] {-} hAPP(fun(A,bool),fun(A,bool),collect(A),B)=ti(fun(A,bool),B).
% 0.14/0.40 Following clause subsumed by 98 during input processing: 0 [copy,101,flip.1] {-} ti(state,A)=ti(state,$c3).
% 0.14/0.40
% 0.14/0.40 ======= end of input processing =======
% 1.45/1.64
% 1.45/1.64 Stopped by limit on insertions
% 1.45/1.64
% 1.45/1.64
% 1.45/1.64 Failed to model usable list: disabling FINDER
% 1.45/1.64
% 1.45/1.64
% 1.45/1.64
% 1.45/1.64 -------------- Softie stats --------------
% 1.45/1.64
% 1.45/1.64 UPDATE_STOP: 300
% 1.45/1.64 SFINDER_TIME_LIMIT: 2
% 1.45/1.64 SHORT_CLAUSE_CUTOFF: 4
% 1.45/1.64 number of clauses in intial UL: 44
% 1.45/1.64 number of clauses initially in problem: 97
% 1.45/1.64 percentage of clauses intially in UL: 45
% 1.45/1.64 percentage of distinct symbols occuring in initial UL: 89
% 1.45/1.64 percent of all initial clauses that are short: 98
% 1.45/1.64 absolute distinct symbol count: 38
% 1.45/1.64 distinct predicate count: 4
% 1.45/1.64 distinct function count: 25
% 1.45/1.64 distinct constant count: 9
% 1.45/1.64
% 1.45/1.64 ---------- no more Softie stats ----------
% 1.45/1.64
% 1.45/1.64
% 1.45/1.64
% 1.45/1.64 =========== start of search ===========
% 1.45/1.64
% 1.45/1.64
% 1.45/1.64 Changing weight limit from 60 to 101.
% 1.45/1.64
% 1.45/1.64 Resetting weight limit to 101 after 5 givens.
% 1.45/1.64
% 1.45/1.67
% 1.45/1.67 -------- PROOF --------
% 1.45/1.67 % SZS status Theorem
% 1.45/1.67 % SZS output start Refutation
% 1.45/1.67
% 1.45/1.67 -----> EMPTY CLAUSE at 1.25 sec ----> 1203 [para_from,98.1.1,4.2.1,unit_del,97,101] {-} $F.
% 1.45/1.67
% 1.45/1.67 Length of proof is 1. Level of proof is 1.
% 1.45/1.67
% 1.45/1.67 ---------------- PROOF ----------------
% 1.45/1.67 % SZS status Theorem
% 1.45/1.67 % SZS output start Refutation
% 1.45/1.67
% 1.45/1.67 4 [] {+} -hBOOL(hoare_1883395792gleton)|ti(state,$c2)!=ti(state,$c1).
% 1.45/1.67 97 [] {-} hBOOL(hoare_1883395792gleton).
% 1.45/1.67 98 [] {-} ti(state,A)=ti(state,$c3).
% 1.45/1.67 101 [copy,98,flip.1] {-} ti(state,$c3)=ti(state,A).
% 1.45/1.67 1203 [para_from,98.1.1,4.2.1,unit_del,97,101] {-} $F.
% 1.45/1.67
% 1.45/1.67 % SZS output end Refutation
% 1.45/1.67 ------------ end of proof -------------
% 1.45/1.67
% 1.45/1.67
% 1.45/1.67 Search stopped by max_proofs option.
% 1.45/1.67
% 1.45/1.67
% 1.45/1.67 Search stopped by max_proofs option.
% 1.45/1.67
% 1.45/1.67 ============ end of search ============
% 1.45/1.67
% 1.45/1.67 That finishes the proof of the theorem.
% 1.45/1.67
% 1.45/1.67 Process 16513 finished Sat Jun 4 20:59:05 2022
%------------------------------------------------------------------------------