TSTP Solution File: SYN014-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SYN014-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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 21 12:09:11 EDT 2022
% Result : Unsatisfiable 0.19s 0.35s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN014-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n009.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 : Mon Jul 11 23:22:37 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.35
% 0.19/0.35 -------- PROOF --------
% 0.19/0.35 % SZS status Unsatisfiable
% 0.19/0.35 % SZS output start Refutation
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox on n009.cluster.edu,
% 0.19/0.35 Mon Jul 11 23:22:37 2022
% 0.19/0.35 The command was "./sos". The process ID is 474.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=1, max_lits=6.
% 0.19/0.35
% 0.19/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.35 clauses in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(knuth_bendix).
% 0.19/0.35 dependent: set(para_from).
% 0.19/0.35 dependent: set(para_into).
% 0.19/0.35 dependent: clear(para_from_right).
% 0.19/0.35 dependent: clear(para_into_right).
% 0.19/0.35 dependent: set(para_from_vars).
% 0.19/0.35 dependent: set(eq_units_both_ways).
% 0.19/0.35 dependent: set(dynamic_demod_all).
% 0.19/0.35 dependent: set(dynamic_demod).
% 0.19/0.35 dependent: set(order_eq).
% 0.19/0.35 dependent: set(back_demod).
% 0.19/0.35 dependent: set(lrpo).
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: set(unit_deletion).
% 0.19/0.35 dependent: set(factor).
% 0.19/0.35
% 0.19/0.35 There is a clause for symmetry of equality, so it is
% 0.19/0.35 assumed that equality is fully axiomatized; therefore,
% 0.19/0.35 paramodulation is disabled.
% 0.19/0.35
% 0.19/0.35 dependent: clear(para_from).
% 0.19/0.35 dependent: clear(para_into).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] {-} equalish(A,A).
% 0.19/0.35 28 back subsumes 27.
% 0.19/0.35 28 back subsumes 26.
% 0.19/0.35 28 back subsumes 25.
% 0.19/0.35 28 back subsumes 24.
% 0.19/0.35 28 back subsumes 23.
% 0.19/0.35
% 0.19/0.35 ----> UNIT CONFLICT at 0.00 sec ----> 38 [binary,37.1,28.1] {-} $F.
% 0.19/0.35
% 0.19/0.35 Length of proof is 2. Level of proof is 2.
% 0.19/0.35
% 0.19/0.35 ---------------- PROOF ----------------
% 0.19/0.35 % SZS status Unsatisfiable
% 0.19/0.35 % SZS output start Refutation
% 0.19/0.35
% 0.19/0.35 19 [] {-} -equalish(m,n).
% 0.19/0.35 20 [copy,19,flip.1] {-} -equalish(n,m).
% 0.19/0.35 28 [] {-} equalish(A,A).
% 0.19/0.35 32,31 [] {-} equalish(n,k).
% 0.19/0.35 34,33 [] {-} equalish(m,k).
% 0.19/0.35 37 [back_demod,20,demod,32,34] {-} -equalish(k,k).
% 0.19/0.35 38 [binary,37.1,28.1] {-} $F.
% 0.19/0.35
% 0.19/0.35 % SZS output end Refutation
% 0.19/0.35 ------------ end of proof -------------
% 0.19/0.35
% 0.19/0.35
% 0.19/0.35 Search stopped by max_proofs option.
% 0.19/0.35
% 0.19/0.35
% 0.19/0.35 Search stopped by max_proofs option.
% 0.19/0.35
% 0.19/0.35 ============ end of search ============
% 0.19/0.35
% 0.19/0.35 That finishes the proof of the theorem.
% 0.19/0.35
% 0.19/0.35 Process 474 finished Mon Jul 11 23:22:37 2022
%------------------------------------------------------------------------------