TSTP Solution File: ALG175+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ALG175+1 : TPTP v8.1.0. Released v2.7.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 14 18:01:12 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : ALG175+1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.32 % Computer : n021.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Wed Jun 8 20:38:52 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.35
% 0.12/0.35 -------- PROOF --------
% 0.12/0.35 % SZS status Unsatisfiable
% 0.12/0.35 % SZS output start Refutation
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n021.cluster.edu,
% 0.12/0.35 Wed Jun 8 20:38:52 2022
% 0.12/0.35 The command was "./sos". The process ID is 8570.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 396 during input processing: 0 [demod,442,354] {-} e4=e4.
% 0.12/0.35 Following clause subsumed by 459 during input processing: 0 [copy,392,flip.1] {-} e2=e2.
% 0.12/0.35 Following clause subsumed by 459 during input processing: 0 [copy,396,flip.1] {-} e4=e4.
% 0.12/0.35
% 0.12/0.35 ----> UNIT CONFLICT at 0.01 sec ----> 508 [binary,506.1,216.1] {-} $F.
% 0.12/0.35
% 0.12/0.35 Length of proof is 13. Level of proof is 5.
% 0.12/0.35
% 0.12/0.35 ---------------- PROOF ----------------
% 0.12/0.35 % SZS status Theorem
% 0.12/0.35 % SZS output start Refutation
% 0.12/0.35
% 0.12/0.35 205 [] {-} e0!=e3.
% 0.12/0.35 206 [copy,205,flip.1] {-} e3!=e0.
% 0.12/0.35 211 [] {-} e1!=e3.
% 0.12/0.35 212 [copy,211,flip.1] {-} e3!=e1.
% 0.12/0.35 215 [] {-} e2!=e3.
% 0.12/0.35 216 [copy,215,flip.1] {-} e3!=e2.
% 0.12/0.35 219 [] {-} e3!=e4.
% 0.12/0.35 220 [copy,219,flip.1] {-} e4!=e3.
% 0.12/0.35 282 [] {-} op(e3,e0)=e3|op(e3,e1)=e3|op(e3,e2)=e3|op(e3,e3)=e3|op(e3,e4)=e3.
% 0.12/0.35 316 [] {-} op(op(e0,e2),op(e2,e0))=e2.
% 0.12/0.35 346 [] {-} e0=op(op(e3,e1),e3).
% 0.12/0.35 348,347 [copy,346,flip.1] {-} op(op(e3,e1),e3)=e0.
% 0.12/0.35 349 [] {-} e2=op(e3,op(op(e3,e1),e3)).
% 0.12/0.35 351,350 [copy,349,demod,348,flip.1] {-} op(e3,e0)=e2.
% 0.12/0.35 352 [] {-} e4=op(e3,e1).
% 0.12/0.35 354,353 [copy,352,flip.1] {-} op(e3,e1)=e4.
% 0.12/0.35 385 [] {-} op(e3,op(e3,e0))=e0.
% 0.12/0.35 387,386 [copy,385,demod,351] {-} op(e3,e2)=e0.
% 0.12/0.35 388 [] {-} op(e3,op(e3,e1))=e1.
% 0.12/0.35 390,389 [copy,388,demod,354] {-} op(e3,e4)=e1.
% 0.12/0.35 437 [] {-} op(op(e3,e0),e0)=e3.
% 0.12/0.35 439,438 [copy,437,demod,351] {-} op(e2,e0)=e3.
% 0.12/0.35 443 [] {-} op(op(e3,e2),e2)=e3.
% 0.12/0.36 445,444 [copy,443,demod,387] {-} op(e0,e2)=e3.
% 0.12/0.36 465,464 [back_demod,282,demod,351,354,387,390,unit_del,216,220,206,212] {-} op(e3,e3)=e3.
% 0.12/0.36 506 [back_demod,316,demod,445,439,465] {-} e3=e2.
% 0.12/0.36 508 [binary,506.1,216.1] {-} $F.
% 0.12/0.36
% 0.12/0.36 % SZS output end Refutation
% 0.12/0.36 ------------ end of proof -------------
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 Search stopped by max_proofs option.
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 Search stopped by max_proofs option.
% 0.12/0.36
% 0.12/0.36 ============ end of search ============
% 0.12/0.36
% 0.12/0.36 That finishes the proof of the theorem.
% 0.12/0.36
% 0.12/0.36 Process 8570 finished Wed Jun 8 20:38:52 2022
%------------------------------------------------------------------------------