TSTP Solution File: SWC391+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWC391+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:47 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC391+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n010.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 : Sun Jun 12 16:00:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.51
% 0.20/0.51 -------- PROOF --------
% 0.20/0.51 % SZS status Unsatisfiable
% 0.20/0.51 % SZS output start Refutation
% 0.20/0.51 ----- Otter 3.2, August 2001 -----
% 0.20/0.51 The process was started by sandbox2 on n010.cluster.edu,
% 0.20/0.51 Sun Jun 12 16:00:55 2022
% 0.20/0.51 The command was "./sos". The process ID is 11336.
% 0.20/0.51
% 0.20/0.51 set(prolog_style_variables).
% 0.20/0.51 set(auto).
% 0.20/0.51 dependent: set(auto1).
% 0.20/0.51 dependent: set(process_input).
% 0.20/0.51 dependent: clear(print_kept).
% 0.20/0.51 dependent: clear(print_new_demod).
% 0.20/0.51 dependent: clear(print_back_demod).
% 0.20/0.51 dependent: clear(print_back_sub).
% 0.20/0.51 dependent: set(control_memory).
% 0.20/0.51 dependent: assign(max_mem, 12000).
% 0.20/0.51 dependent: assign(pick_given_ratio, 4).
% 0.20/0.51 dependent: assign(stats_level, 1).
% 0.20/0.51 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.51 dependent: assign(sos_limit, 5000).
% 0.20/0.51 dependent: assign(max_weight, 60).
% 0.20/0.51 clear(print_given).
% 0.20/0.51
% 0.20/0.51 formula_list(usable).
% 0.20/0.51
% 0.20/0.51 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.20/0.51
% 0.20/0.51 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.51 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.51 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.51 clauses in usable.
% 0.20/0.51
% 0.20/0.51 dependent: set(knuth_bendix).
% 0.20/0.51 dependent: set(para_from).
% 0.20/0.51 dependent: set(para_into).
% 0.20/0.51 dependent: clear(para_from_right).
% 0.20/0.51 dependent: clear(para_into_right).
% 0.20/0.51 dependent: set(para_from_vars).
% 0.20/0.51 dependent: set(eq_units_both_ways).
% 0.20/0.51 dependent: set(dynamic_demod_all).
% 0.20/0.51 dependent: set(dynamic_demod).
% 0.20/0.51 dependent: set(order_eq).
% 0.20/0.51 dependent: set(back_demod).
% 0.20/0.51 dependent: set(lrpo).
% 0.20/0.51 dependent: set(hyper_res).
% 0.20/0.51 dependent: set(unit_deletion).
% 0.20/0.51 dependent: set(factor).
% 0.20/0.51
% 0.20/0.51 ------------> process usable:
% 0.20/0.51 Following clause subsumed by 177 during input processing: 0 [] {-} -ssItem(A)| -ssItem(B)|lt(A,B)|A=B| -leq(A,B).
% 0.20/0.51 301 back subsumes 257.
% 0.20/0.51
% 0.20/0.51 ------------> process sos:
% 0.20/0.51
% 0.20/0.51 ----> UNIT CONFLICT at 0.14 sec ----> 458 [binary,457.1,455.1] {-} $F.
% 0.20/0.51
% 0.20/0.51 Length of proof is 3. Level of proof is 2.
% 0.20/0.51
% 0.20/0.51 ---------------- PROOF ----------------
% 0.20/0.51 % SZS status Theorem
% 0.20/0.51 % SZS output start Refutation
% 0.20/0.51
% 0.20/0.51 182 [] {-} -memberP($c6,$c3).
% 0.20/0.51 447,446 [] {-} $c6=$c4.
% 0.20/0.51 449,448 [] {-} $c7=$c5.
% 0.20/0.51 450 [] {-} $c4=$c5.
% 0.20/0.51 452,451 [copy,450,flip.1] {-} $c5=$c4.
% 0.20/0.51 454 [] {-} memberP($c7,$c3).
% 0.20/0.51 455 [copy,454,demod,449,452] {-} memberP($c4,$c3).
% 0.20/0.51 457 [back_demod,182,demod,447] {-} -memberP($c4,$c3).
% 0.20/0.51 458 [binary,457.1,455.1] {-} $F.
% 0.20/0.51
% 0.20/0.51 % SZS output end Refutation
% 0.20/0.51 ------------ end of proof -------------
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 Search stopped by max_proofs option.
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 Search stopped by max_proofs option.
% 0.20/0.51
% 0.20/0.51 ============ end of search ============
% 0.20/0.51
% 0.20/0.51 That finishes the proof of the theorem.
% 0.20/0.51
% 0.20/0.51 Process 11336 finished Sun Jun 12 16:00:55 2022
%------------------------------------------------------------------------------