TSTP Solution File: SWC209-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWC209-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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 : Tue Jul 19 21:59:55 EDT 2022
% Result : Unsatisfiable 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC209-1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 12 05:05:41 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.43
% 0.20/0.43 -------- PROOF --------
% 0.20/0.43 % SZS status Unsatisfiable
% 0.20/0.43 % SZS output start Refutation
% 0.20/0.43 ----- Otter 3.2, August 2001 -----
% 0.20/0.43 The process was started by sandbox on n012.cluster.edu,
% 0.20/0.43 Sun Jun 12 05:05:41 2022
% 0.20/0.43 The command was "./sos". The process ID is 17746.
% 0.20/0.43
% 0.20/0.43 set(prolog_style_variables).
% 0.20/0.43 set(auto).
% 0.20/0.43 dependent: set(auto1).
% 0.20/0.43 dependent: set(process_input).
% 0.20/0.43 dependent: clear(print_kept).
% 0.20/0.43 dependent: clear(print_new_demod).
% 0.20/0.43 dependent: clear(print_back_demod).
% 0.20/0.43 dependent: clear(print_back_sub).
% 0.20/0.43 dependent: set(control_memory).
% 0.20/0.43 dependent: assign(max_mem, 12000).
% 0.20/0.43 dependent: assign(pick_given_ratio, 4).
% 0.20/0.43 dependent: assign(stats_level, 1).
% 0.20/0.43 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.43 dependent: assign(sos_limit, 5000).
% 0.20/0.43 dependent: assign(max_weight, 60).
% 0.20/0.43 clear(print_given).
% 0.20/0.43
% 0.20/0.43 list(usable).
% 0.20/0.43
% 0.20/0.43 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.20/0.43
% 0.20/0.43 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.43 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.43 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.43 clauses in usable.
% 0.20/0.43
% 0.20/0.43 dependent: set(knuth_bendix).
% 0.20/0.43 dependent: set(para_from).
% 0.20/0.43 dependent: set(para_into).
% 0.20/0.43 dependent: clear(para_from_right).
% 0.20/0.43 dependent: clear(para_into_right).
% 0.20/0.43 dependent: set(para_from_vars).
% 0.20/0.43 dependent: set(eq_units_both_ways).
% 0.20/0.43 dependent: set(dynamic_demod_all).
% 0.20/0.43 dependent: set(dynamic_demod).
% 0.20/0.43 dependent: set(order_eq).
% 0.20/0.43 dependent: set(back_demod).
% 0.20/0.43 dependent: set(lrpo).
% 0.20/0.43 dependent: set(hyper_res).
% 0.20/0.43 dependent: set(unit_deletion).
% 0.20/0.43 dependent: set(factor).
% 0.20/0.43
% 0.20/0.43 ------------> process usable:
% 0.20/0.43 Following clause subsumed by 23 during input processing: 0 [] {-} -ssList(A)|ssList(tl(A))|nil=A.
% 0.20/0.43 Following clause subsumed by 24 during input processing: 0 [] {-} -ssList(A)|ssItem(hd(A))|nil=A.
% 0.20/0.43 Following clause subsumed by 67 during input processing: 0 [] {-} -leq(A,B)| -ssItem(B)| -ssItem(A)|lt(A,B)|A=B.
% 0.20/0.43 136 back subsumes 135.
% 0.20/0.43 146 back subsumes 140.
% 0.20/0.43
% 0.20/0.43 ------------> process sos:
% 0.20/0.43
% 0.20/0.43 ----> UNIT CONFLICT at 0.07 sec ----> 443 [binary,442.1,437.1] {-} $F.
% 0.20/0.43
% 0.20/0.43 Length of proof is 6. Level of proof is 3.
% 0.20/0.43
% 0.20/0.43 ---------------- PROOF ----------------
% 0.20/0.43 % SZS status Unsatisfiable
% 0.20/0.43 % SZS output start Refutation
% 0.20/0.43
% 0.20/0.43 131 [] {-} -neq(sk1,nil).
% 0.20/0.43 419 [] {-} sk2=sk4.
% 0.20/0.43 421,420 [copy,419,flip.1] {-} sk4=sk2.
% 0.20/0.43 422 [] {-} sk1=sk3.
% 0.20/0.43 424,423 [copy,422,flip.1] {-} sk3=sk1.
% 0.20/0.43 425 [] {-} neq(sk2,nil).
% 0.20/0.43 426 [] {-} nil=sk4|neq(sk3,nil).
% 0.20/0.43 428,427 [copy,426,demod,421,424,unit_del,131,flip.1] {-} sk2=nil.
% 0.20/0.43 431 [] {-} nil=sk3|neq(sk3,nil).
% 0.20/0.43 433,432 [copy,431,demod,424,424,unit_del,131,flip.1] {-} sk1=nil.
% 0.20/0.43 437 [back_demod,425,demod,428] {-} neq(nil,nil).
% 0.20/0.43 442 [back_demod,131,demod,433] {-} -neq(nil,nil).
% 0.20/0.43 443 [binary,442.1,437.1] {-} $F.
% 0.20/0.43
% 0.20/0.43 % SZS output end Refutation
% 0.20/0.43 ------------ end of proof -------------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Search stopped by max_proofs option.
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Search stopped by max_proofs option.
% 0.20/0.43
% 0.20/0.43 ============ end of search ============
% 0.20/0.43
% 0.20/0.43 That finishes the proof of the theorem.
% 0.20/0.43
% 0.20/0.43 Process 17746 finished Sun Jun 12 05:05:41 2022
%------------------------------------------------------------------------------