TSTP Solution File: SWV226+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV226+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:23 EDT 2022
% Result : Theorem 0.83s 1.03s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV226+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 18:41:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.83/1.03
% 0.83/1.03 -------- PROOF --------
% 0.83/1.03 % SZS status Unsatisfiable
% 0.83/1.03 % SZS output start Refutation
% 0.83/1.03 ----- Otter 3.2, August 2001 -----
% 0.83/1.03 The process was started by sandbox on n014.cluster.edu,
% 0.83/1.03 Wed Jun 15 18:41:50 2022
% 0.83/1.03 The command was "./sos". The process ID is 30332.
% 0.83/1.03
% 0.83/1.03 set(prolog_style_variables).
% 0.83/1.03 set(auto).
% 0.83/1.03 dependent: set(auto1).
% 0.83/1.03 dependent: set(process_input).
% 0.83/1.03 dependent: clear(print_kept).
% 0.83/1.03 dependent: clear(print_new_demod).
% 0.83/1.03 dependent: clear(print_back_demod).
% 0.83/1.03 dependent: clear(print_back_sub).
% 0.83/1.03 dependent: set(control_memory).
% 0.83/1.03 dependent: assign(max_mem, 12000).
% 0.83/1.03 dependent: assign(pick_given_ratio, 4).
% 0.83/1.03 dependent: assign(stats_level, 1).
% 0.83/1.03 dependent: assign(pick_semantic_ratio, 3).
% 0.83/1.03 dependent: assign(sos_limit, 5000).
% 0.83/1.03 dependent: assign(max_weight, 60).
% 0.83/1.03 clear(print_given).
% 0.83/1.03
% 0.83/1.03 formula_list(usable).
% 0.83/1.03
% 0.83/1.03 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.83/1.03
% 0.83/1.03 This ia a non-Horn set with equality. The strategy will be
% 0.83/1.03 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.83/1.03 unit deletion, with positive clauses in sos and nonpositive
% 0.83/1.03 clauses in usable.
% 0.83/1.03
% 0.83/1.03 dependent: set(knuth_bendix).
% 0.83/1.03 dependent: set(para_from).
% 0.83/1.03 dependent: set(para_into).
% 0.83/1.03 dependent: clear(para_from_right).
% 0.83/1.03 dependent: clear(para_into_right).
% 0.83/1.03 dependent: set(para_from_vars).
% 0.83/1.03 dependent: set(eq_units_both_ways).
% 0.83/1.03 dependent: set(dynamic_demod_all).
% 0.83/1.03 dependent: set(dynamic_demod).
% 0.83/1.03 dependent: set(order_eq).
% 0.83/1.03 dependent: set(back_demod).
% 0.83/1.03 dependent: set(lrpo).
% 0.83/1.03 dependent: set(hyper_res).
% 0.83/1.03 dependent: set(unit_deletion).
% 0.83/1.03 dependent: set(factor).
% 0.83/1.03
% 0.83/1.03 ------------> process usable:
% 0.83/1.03
% 0.83/1.03 ------------> process sos:
% 0.83/1.03 Following clause subsumed by 956 during input processing: 0 [demod,948] {-} gt($c1,tptp_minus_1).
% 0.83/1.03 Following clause subsumed by 961 during input processing: 0 [demod,948] {-} gt($c1,n0).
% 0.83/1.03
% 0.83/1.03 ----> UNIT CONFLICT at 0.66 sec ----> 969 [binary,968.1,2.1] {-} $F.
% 0.83/1.03
% 0.83/1.03 Length of proof is 3. Level of proof is 3.
% 0.83/1.03
% 0.83/1.03 ---------------- PROOF ----------------
% 0.83/1.03 % SZS status Theorem
% 0.83/1.03 % SZS output start Refutation
% 0.83/1.03
% 0.83/1.03 2 [] {-} -gt(A,A).
% 0.83/1.03 942,941 [] {-} n1=$c2.
% 0.83/1.03 943 [] {-} n1=$c1.
% 0.83/1.03 945,944 [copy,943,demod,942] {-} $c2=$c1.
% 0.83/1.03 946 [] {-} n2=$c2.
% 0.83/1.03 948,947 [copy,946,demod,945] {-} n2=$c1.
% 0.83/1.03 967 [] {-} gt(n2,n1).
% 0.83/1.03 968 [copy,967,demod,948,942,945] {-} gt($c1,$c1).
% 0.83/1.03 969 [binary,968.1,2.1] {-} $F.
% 0.83/1.03
% 0.83/1.03 % SZS output end Refutation
% 0.83/1.03 ------------ end of proof -------------
% 0.83/1.03
% 0.83/1.03
% 0.83/1.03 Search stopped by max_proofs option.
% 0.83/1.03
% 0.83/1.03
% 0.83/1.03 Search stopped by max_proofs option.
% 0.83/1.03
% 0.83/1.03 ============ end of search ============
% 0.83/1.03
% 0.83/1.03 That finishes the proof of the theorem.
% 0.83/1.03
% 0.83/1.03 Process 30332 finished Wed Jun 15 18:41:51 2022
%------------------------------------------------------------------------------