TSTP Solution File: SWV232+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV232+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:37:25 EDT 2022
% Result : Theorem 0.85s 1.04s
% Output : Refutation 0.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV232+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.04/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 02:25:35 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.85/1.04
% 0.85/1.04 -------- PROOF --------
% 0.85/1.04 % SZS status Unsatisfiable
% 0.85/1.04 % SZS output start Refutation
% 0.85/1.04 ----- Otter 3.2, August 2001 -----
% 0.85/1.04 The process was started by sandbox2 on n023.cluster.edu,
% 0.85/1.04 Thu Jun 16 02:25:35 2022
% 0.85/1.04 The command was "./sos". The process ID is 18621.
% 0.85/1.04
% 0.85/1.04 set(prolog_style_variables).
% 0.85/1.04 set(auto).
% 0.85/1.04 dependent: set(auto1).
% 0.85/1.04 dependent: set(process_input).
% 0.85/1.04 dependent: clear(print_kept).
% 0.85/1.04 dependent: clear(print_new_demod).
% 0.85/1.04 dependent: clear(print_back_demod).
% 0.85/1.04 dependent: clear(print_back_sub).
% 0.85/1.04 dependent: set(control_memory).
% 0.85/1.04 dependent: assign(max_mem, 12000).
% 0.85/1.04 dependent: assign(pick_given_ratio, 4).
% 0.85/1.04 dependent: assign(stats_level, 1).
% 0.85/1.04 dependent: assign(pick_semantic_ratio, 3).
% 0.85/1.04 dependent: assign(sos_limit, 5000).
% 0.85/1.04 dependent: assign(max_weight, 60).
% 0.85/1.04 clear(print_given).
% 0.85/1.04
% 0.85/1.04 formula_list(usable).
% 0.85/1.04
% 0.85/1.04 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.85/1.04
% 0.85/1.04 This ia a non-Horn set with equality. The strategy will be
% 0.85/1.04 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.85/1.04 unit deletion, with positive clauses in sos and nonpositive
% 0.85/1.04 clauses in usable.
% 0.85/1.04
% 0.85/1.04 dependent: set(knuth_bendix).
% 0.85/1.04 dependent: set(para_from).
% 0.85/1.04 dependent: set(para_into).
% 0.85/1.04 dependent: clear(para_from_right).
% 0.85/1.04 dependent: clear(para_into_right).
% 0.85/1.04 dependent: set(para_from_vars).
% 0.85/1.04 dependent: set(eq_units_both_ways).
% 0.85/1.04 dependent: set(dynamic_demod_all).
% 0.85/1.04 dependent: set(dynamic_demod).
% 0.85/1.04 dependent: set(order_eq).
% 0.85/1.04 dependent: set(back_demod).
% 0.85/1.04 dependent: set(lrpo).
% 0.85/1.04 dependent: set(hyper_res).
% 0.85/1.04 dependent: set(unit_deletion).
% 0.85/1.04 dependent: set(factor).
% 0.85/1.04
% 0.85/1.04 ------------> process usable:
% 0.85/1.04
% 0.85/1.04 ------------> process sos:
% 0.85/1.04 Following clause subsumed by 927 during input processing: 0 [demod,916,919] {-} gt($c1,tptp_minus_1).
% 0.85/1.04 Following clause subsumed by 927 during input processing: 0 [demod,922] {-} gt($c1,tptp_minus_1).
% 0.85/1.04
% 0.85/1.04 ----> UNIT CONFLICT at 0.67 sec ----> 935 [binary,934.1,2.1] {-} $F.
% 0.85/1.04
% 0.85/1.04 Length of proof is 2. Level of proof is 2.
% 0.85/1.04
% 0.85/1.04 ---------------- PROOF ----------------
% 0.85/1.04 % SZS status Theorem
% 0.85/1.04 % SZS output start Refutation
% 0.85/1.04
% 0.85/1.04 2 [] {-} -gt(A,A).
% 0.85/1.04 914,913 [] {-} n0=$c1.
% 0.85/1.04 916,915 [] {-} n1=$c2.
% 0.85/1.04 917 [] {-} n1=$c1.
% 0.85/1.04 919,918 [copy,917,demod,916] {-} $c2=$c1.
% 0.85/1.04 933 [] {-} gt(n1,n0).
% 0.85/1.04 934 [copy,933,demod,916,919,914] {-} gt($c1,$c1).
% 0.85/1.04 935 [binary,934.1,2.1] {-} $F.
% 0.85/1.04
% 0.85/1.04 % SZS output end Refutation
% 0.85/1.04 ------------ end of proof -------------
% 0.85/1.04
% 0.85/1.04
% 0.85/1.04 Search stopped by max_proofs option.
% 0.85/1.04
% 0.85/1.04
% 0.85/1.04 Search stopped by max_proofs option.
% 0.85/1.04
% 0.85/1.04 ============ end of search ============
% 0.85/1.04
% 0.85/1.04 That finishes the proof of the theorem.
% 0.85/1.04
% 0.85/1.04 Process 18621 finished Thu Jun 16 02:25:35 2022
%------------------------------------------------------------------------------