TSTP Solution File: COM018+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM018+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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 : Fri Jul 15 01:43:31 EDT 2022
% Result : Theorem 0.75s 0.93s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : COM018+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.11/0.32 % Computer : n032.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Thu Jun 16 18:06:00 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n032.cluster.edu,
% 0.11/0.34 Thu Jun 16 18:06:00 2022
% 0.11/0.34 The command was "./sos". The process ID is 26390.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 formula_list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.11/0.34
% 0.11/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.34 clauses in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(knuth_bendix).
% 0.11/0.34 dependent: set(para_from).
% 0.11/0.34 dependent: set(para_into).
% 0.11/0.34 dependent: clear(para_from_right).
% 0.11/0.34 dependent: clear(para_into_right).
% 0.11/0.34 dependent: set(para_from_vars).
% 0.11/0.34 dependent: set(eq_units_both_ways).
% 0.11/0.34 dependent: set(dynamic_demod_all).
% 0.11/0.34 dependent: set(dynamic_demod).
% 0.11/0.34 dependent: set(order_eq).
% 0.11/0.34 dependent: set(back_demod).
% 0.11/0.34 dependent: set(lrpo).
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: set(unit_deletion).
% 0.11/0.34 dependent: set(factor).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34 Following clause subsumed by 103 during input processing: 0 [copy,103,flip.1] {-} A=A.
% 0.11/0.34 103 back subsumes 50.
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.16/0.37
% 0.16/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.16/0.37
% 0.16/0.37 Stopped by limit on number of solutions
% 0.16/0.37
% 0.16/0.37
% 0.16/0.37 -------------- Softie stats --------------
% 0.16/0.37
% 0.16/0.37 UPDATE_STOP: 300
% 0.16/0.37 SFINDER_TIME_LIMIT: 2
% 0.16/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.16/0.37 number of clauses in intial UL: 84
% 0.16/0.37 number of clauses initially in problem: 102
% 0.16/0.37 percentage of clauses intially in UL: 82
% 0.16/0.37 percentage of distinct symbols occuring in initial UL: 87
% 0.16/0.37 percent of all initial clauses that are short: 100
% 0.16/0.37 absolute distinct symbol count: 32
% 0.16/0.37 distinct predicate count: 11
% 0.16/0.37 distinct function count: 14
% 0.16/0.37 distinct constant count: 7
% 0.16/0.37
% 0.16/0.37 ---------- no more Softie stats ----------
% 0.16/0.37
% 0.16/0.37
% 0.16/0.37
% 0.16/0.37 =========== start of search ===========
% 0.75/0.93
% 0.75/0.93 -------- PROOF --------
% 0.75/0.93 % SZS status Theorem
% 0.75/0.93 % SZS output start Refutation
% 0.75/0.93
% 0.75/0.93 Stopped by limit on insertions
% 0.75/0.93
% 0.75/0.93 Model 2 (0.00 seconds, 0 Inserts)
% 0.75/0.93
% 0.75/0.93 Stopped by limit on number of solutions
% 0.75/0.93
% 0.75/0.93 Model 3 (0.00 seconds, 0 Inserts)
% 0.75/0.93
% 0.75/0.93 Stopped by limit on number of solutions
% 0.75/0.93
% 0.75/0.93 Stopped by limit on insertions
% 0.75/0.93
% 0.75/0.93 Model 4 [ 1 0 886 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.93
% 0.75/0.93 Model 5 (0.00 seconds, 250000 Inserts)
% 0.75/0.93
% 0.75/0.93 Stopped by limit on number of solutions
% 0.75/0.93
% 0.75/0.93 Model 6 (0.00 seconds, 250000 Inserts)
% 0.75/0.93
% 0.75/0.93 Stopped by limit on number of solutions
% 0.75/0.93
% 0.75/0.93 Stopped by limit on insertions
% 0.75/0.93
% 0.75/0.93 Model 7 [ 1 2 6728 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.93
% 0.75/0.93 Stopped by limit on insertions
% 0.75/0.93
% 0.75/0.93 Model 8 [ 2 0 2017 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.93
% 0.75/0.93 Model 9 (0.00 seconds, 250000 Inserts)
% 0.75/0.93
% 0.75/0.93 Stopped by limit on number of solutions
% 0.75/0.93
% 0.75/0.93 Stopped by limit on insertions
% 0.75/0.93
% 0.75/0.93 Model 10 [ 3 1 508 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.93
% 0.75/0.93 Stopped by limit on insertions
% 0.75/0.93
% 0.75/0.93 ----> UNIT CONFLICT at 0.58 sec ----> 137 [binary,136.1,43.1] {+} $F.
% 0.75/0.93
% 0.75/0.93 Length of proof is 1. Level of proof is 1.
% 0.75/0.93
% 0.75/0.93 ---------------- PROOF ----------------
% 0.75/0.93 % SZS status Theorem
% 0.75/0.93 % SZS output start Refutation
% 0.75/0.93
% 0.75/0.93 39 [] {+} -aRewritingSystem0(A)| -isTerminating0(A)| -aElement0(B)|aNormalFormOfIn0($f13(A,B),B,A).
% 0.75/0.93 43 [] {+} -aNormalFormOfIn0(A,xw,xR).
% 0.75/0.93 86 [] {+} aRewritingSystem0(xR).
% 0.75/0.93 88 [] {-} isTerminating0(xR).
% 0.75/0.93 100 [] {-} aElement0(xw).
% 0.75/0.93 136 [hyper,100,39,86,88] {-} aNormalFormOfIn0($f13(xR,xw),xw,xR).
% 0.75/0.93 137 [binary,136.1,43.1] {+} $F.
% 0.75/0.93
% 0.75/0.93 % SZS output end Refutation
% 0.75/0.93 ------------ end of proof -------------
% 0.75/0.93
% 0.75/0.93
% 0.75/0.93 Search stopped by max_proofs option.
% 0.75/0.93
% 0.75/0.93
% 0.75/0.93 Search stopped by max_proofs option.
% 0.75/0.93
% 0.75/0.93 ============ end of search ============
% 0.75/0.93
% 0.75/0.93 ----------- soft-scott stats ----------
% 0.75/0.93
% 0.75/0.93 true clauses given 1 (8.3%)
% 0.75/0.93 false clauses given 11
% 0.75/0.93
% 0.75/0.93 FALSE TRUE
% 0.75/0.93 3 1 1
% 0.75/0.93 4 2 5
% 0.75/0.93 5 3 0
% 0.75/0.93 6 5 1
% 0.75/0.93 7 0 1
% 0.75/0.93 8 0 3
% 0.75/0.93 9 1 0
% 0.75/0.93 11 0 3
% 0.75/0.93 16 0 9
% 0.75/0.93 18 0 3
% 0.75/0.93 tot: 12 26 (68.4% true)
% 0.75/0.93
% 0.75/0.93
% 0.75/0.93 Model 10 [ 3 -4 508 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.93
% 0.75/0.93 That finishes the proof of the theorem.
% 0.75/0.93
% 0.75/0.93 Process 26390 finished Thu Jun 16 18:06:00 2022
%------------------------------------------------------------------------------