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