TSTP Solution File: SWV864-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV864-1 : TPTP v8.1.0. Released v4.1.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 : Wed Jul 20 21:40:29 EDT 2022
% Result : Unsatisfiable 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV864-1 : TPTP v8.1.0. Released v4.1.0.
% 0.13/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 10:16:58 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox on n021.cluster.edu,
% 0.20/0.37 Wed Jun 15 10:16:59 2022
% 0.20/0.37 The command was "./sos". The process ID is 955.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.20/0.37
% 0.20/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.37 clauses in usable.
% 0.20/0.37
% 0.20/0.37 dependent: set(knuth_bendix).
% 0.20/0.37 dependent: set(para_from).
% 0.20/0.37 dependent: set(para_into).
% 0.20/0.37 dependent: clear(para_from_right).
% 0.20/0.37 dependent: clear(para_into_right).
% 0.20/0.37 dependent: set(para_from_vars).
% 0.20/0.37 dependent: set(eq_units_both_ways).
% 0.20/0.37 dependent: set(dynamic_demod_all).
% 0.20/0.37 dependent: set(dynamic_demod).
% 0.20/0.37 dependent: set(order_eq).
% 0.20/0.37 dependent: set(back_demod).
% 0.20/0.37 dependent: set(lrpo).
% 0.20/0.37 dependent: set(hyper_res).
% 0.20/0.37 dependent: set(unit_deletion).
% 0.20/0.37 dependent: set(factor).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37 Following clause subsumed by 10 during input processing: 0 [flip.1] {-} c_Com_Ocom_OSemi(A,B)!=c_Com_Ocom_OSKIP.
% 0.20/0.37 Following clause subsumed by 20 during input processing: 0 [] {-} c_Natural_Oevalc(A,B,C)| -c_Natural_Oevaln(A,B,D,C).
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37 Following clause subsumed by 36 during input processing: 0 [copy,32,flip.1] {-} v_x=v_x.
% 0.20/0.37 34 back subsumes 33.
% 0.20/0.37 Following clause subsumed by 36 during input processing: 0 [copy,36,flip.1] {-} A=A.
% 0.20/0.37 36 back subsumes 32.
% 0.20/0.37 36 back subsumes 25.
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Failed to model usable list: disabling FINDER
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 -------------- Softie stats --------------
% 0.20/0.48
% 0.20/0.48 UPDATE_STOP: 300
% 0.20/0.48 SFINDER_TIME_LIMIT: 2
% 0.20/0.48 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.48 number of clauses in intial UL: 22
% 0.20/0.48 number of clauses initially in problem: 29
% 0.20/0.48 percentage of clauses intially in UL: 75
% 0.20/0.48 percentage of distinct symbols occuring in initial UL: 95
% 0.20/0.48 percent of all initial clauses that are short: 100
% 0.20/0.48 absolute distinct symbol count: 20
% 0.20/0.48 distinct predicate count: 3
% 0.20/0.48 distinct function count: 8
% 0.20/0.48 distinct constant count: 9
% 0.20/0.48
% 0.20/0.48 ---------- no more Softie stats ----------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 =========== start of search ===========
% 0.20/0.48
% 0.20/0.48 -------- PROOF --------
% 0.20/0.48 % SZS status Unsatisfiable
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 ----> UNIT CONFLICT at 0.09 sec ----> 328 [binary,326.1,163.1] {-} $F.
% 0.20/0.48
% 0.20/0.48 Length of proof is 5. Level of proof is 3.
% 0.20/0.48
% 0.20/0.48 ---------------- PROOF ----------------
% 0.20/0.48 % SZS status Unsatisfiable
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 12 [] {+} A=B| -c_Natural_Oevalc(C,D,A)| -c_Natural_Oevalc(C,D,B).
% 0.20/0.48 15 [] {+} v_sko__Hoare__Mirabelle__Xsingle__stateE__1(A)!=A| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 0.20/0.48 21 [] {+} -c_Natural_Oevalc(v_c,v_x,v_xa).
% 0.20/0.48 22 [] {-} A!=v_xb(A)|A=v_xa.
% 0.20/0.48 23 [copy,22,flip.1] {+} v_xb(A)!=A|A=v_xa.
% 0.20/0.48 34 [] {-} c_Hoare__Mirabelle_Ostate__not__singleton.
% 0.20/0.48 35 [] {-} A=v_xa|c_Natural_Oevalc(v_c,v_x,v_xb(A)).
% 0.20/0.48 56 [hyper,35,15,34] {-} c_Natural_Oevalc(v_c,v_x,v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa))).
% 0.20/0.48 162 [para_into,56.1.3,35.1.1,unit_del,21] {-} c_Natural_Oevalc(v_c,v_x,v_xb(v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa)))).
% 0.20/0.48 163 [para_into,56.1.3,23.2.1,unit_del,21] {-} v_xb(v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa)))!=v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa)).
% 0.20/0.48 326 [hyper,162,12,56,flip.1] {-} v_xb(v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa)))=v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa)).
% 0.20/0.48 328 [binary,326.1,163.1] {-} $F.
% 0.20/0.48
% 0.20/0.48 % SZS output end Refutation
% 0.20/0.48 ------------ end of proof -------------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.49 Search stopped by max_proofs option.
% 0.20/0.49
% 0.20/0.49 ============ end of search ============
% 0.20/0.49
% 0.20/0.49 That finishes the proof of the theorem.
% 0.20/0.49
% 0.20/0.49 Process 955 finished Wed Jun 15 10:16:59 2022
%------------------------------------------------------------------------------