TSTP Solution File: COM018+4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM018+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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 8.80s 9.05s
% Output : Refutation 8.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM018+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n007.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 : Thu Jun 16 17:26:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.20/3.38 ----- Otter 3.2, August 2001 -----
% 3.20/3.38 The process was started by sandbox on n007.cluster.edu,
% 3.20/3.38 Thu Jun 16 17:26:41 2022
% 3.20/3.38 The command was "./sos". The process ID is 23568.
% 3.20/3.38
% 3.20/3.38 set(prolog_style_variables).
% 3.20/3.38 set(auto).
% 3.20/3.38 dependent: set(auto1).
% 3.20/3.38 dependent: set(process_input).
% 3.20/3.38 dependent: clear(print_kept).
% 3.20/3.38 dependent: clear(print_new_demod).
% 3.20/3.38 dependent: clear(print_back_demod).
% 3.20/3.38 dependent: clear(print_back_sub).
% 3.20/3.38 dependent: set(control_memory).
% 3.20/3.38 dependent: assign(max_mem, 12000).
% 3.20/3.38 dependent: assign(pick_given_ratio, 4).
% 3.20/3.38 dependent: assign(stats_level, 1).
% 3.20/3.38 dependent: assign(pick_semantic_ratio, 3).
% 3.20/3.38 dependent: assign(sos_limit, 5000).
% 3.20/3.38 dependent: assign(max_weight, 60).
% 3.20/3.38 clear(print_given).
% 3.20/3.38
% 3.20/3.38 formula_list(usable).
% 3.20/3.38
% 3.20/3.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=13.
% 3.20/3.38
% 3.20/3.38 This ia a non-Horn set with equality. The strategy will be
% 3.20/3.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 3.20/3.38 unit deletion, with positive clauses in sos and nonpositive
% 3.20/3.38 clauses in usable.
% 3.20/3.38
% 3.20/3.38 dependent: set(knuth_bendix).
% 3.20/3.38 dependent: set(para_from).
% 3.20/3.38 dependent: set(para_into).
% 3.20/3.38 dependent: clear(para_from_right).
% 3.20/3.38 dependent: clear(para_into_right).
% 3.20/3.38 dependent: set(para_from_vars).
% 3.20/3.38 dependent: set(eq_units_both_ways).
% 3.20/3.38 dependent: set(dynamic_demod_all).
% 3.20/3.38 dependent: set(dynamic_demod).
% 3.20/3.38 dependent: set(order_eq).
% 3.20/3.38 dependent: set(back_demod).
% 3.20/3.38 dependent: set(lrpo).
% 3.20/3.38 dependent: set(hyper_res).
% 3.20/3.38 dependent: set(unit_deletion).
% 3.20/3.38 dependent: set(factor).
% 3.20/3.38
% 3.20/3.38 ------------> process usable:
% 3.20/3.38 790 back subsumes 660.
% 3.20/3.38 793 back subsumes 663.
% 3.20/3.38 796 back subsumes 666.
% 3.20/3.38 799 back subsumes 669.
% 3.20/3.38 802 back subsumes 672.
% 3.20/3.38 805 back subsumes 675.
% 3.20/3.38 808 back subsumes 678.
% 3.20/3.38 811 back subsumes 681.
% 3.20/3.38 814 back subsumes 684.
% 3.20/3.38 817 back subsumes 687.
% 3.20/3.38 820 back subsumes 690.
% 3.20/3.38 900 back subsumes 867.
% 3.20/3.38 903 back subsumes 870.
% 3.20/3.38 906 back subsumes 873.
% 3.20/3.38 909 back subsumes 876.
% 3.20/3.38 912 back subsumes 879.
% 3.20/3.38 915 back subsumes 882.
% 3.20/3.38 918 back subsumes 885.
% 3.20/3.38 921 back subsumes 888.
% 3.20/3.38 924 back subsumes 891.
% 3.20/3.38 927 back subsumes 894.
% 3.20/3.38 930 back subsumes 897.
% 3.20/3.38 1094 back subsumes 975.
% 3.20/3.38 1097 back subsumes 978.
% 3.20/3.38 1100 back subsumes 981.
% 3.20/3.38 1103 back subsumes 984.
% 3.20/3.38 1106 back subsumes 987.
% 3.20/3.38 1109 back subsumes 990.
% 3.20/3.38 1112 back subsumes 993.
% 3.20/3.38 1115 back subsumes 996.
% 3.20/3.38 1118 back subsumes 999.
% 3.20/3.38
% 3.20/3.38 ------------> process sos:
% 3.20/3.38 Following clause subsumed by 1413 during input processing: 0 [copy,1413,flip.1] {-} A=A.
% 3.20/3.38 1413 back subsumes 549.
% 3.20/3.38
% 3.20/3.38 ======= end of input processing =======
% 3.32/3.50
% 3.32/3.50 Model 1 (0.00 seconds, 0 Inserts)
% 3.32/3.50
% 3.32/3.50 Stopped by limit on number of solutions
% 3.32/3.50
% 3.32/3.50
% 3.32/3.50 -------------- Softie stats --------------
% 3.32/3.50
% 3.32/3.50 UPDATE_STOP: 300
% 3.32/3.50 SFINDER_TIME_LIMIT: 2
% 3.32/3.50 SHORT_CLAUSE_CUTOFF: 4
% 3.32/3.50 number of clauses in intial UL: 1125
% 3.32/3.50 number of clauses initially in problem: 1165
% 3.32/3.50 percentage of clauses intially in UL: 96
% 3.32/3.50 percentage of distinct symbols occuring in initial UL: 77
% 3.32/3.50 percent of all initial clauses that are short: 100
% 3.32/3.50 absolute distinct symbol count: 44
% 3.32/3.50 distinct predicate count: 11
% 3.32/3.50 distinct function count: 20
% 3.32/3.50 distinct constant count: 13
% 3.32/3.50
% 3.32/3.50 ---------- no more Softie stats ----------
% 3.32/3.50
% 3.32/3.50
% 3.32/3.50
% 3.32/3.50 Model 2 (0.00 seconds, 0 Inserts)
% 3.32/3.50
% 3.32/3.50 Stopped by limit on number of solutions
% 3.32/3.50
% 3.32/3.50 =========== start of search ===========
% 8.80/9.05
% 8.80/9.05 -------- PROOF --------
% 8.80/9.05 % SZS status Theorem
% 8.80/9.05 % SZS output start Refutation
% 8.80/9.05
% 8.80/9.05 Stopped by limit on insertions
% 8.80/9.05
% 8.80/9.05 Stopped by limit on insertions
% 8.80/9.05
% 8.80/9.05 Stopped by limit on insertions
% 8.80/9.05
% 8.80/9.05 Model 3 [ 1 6 37321 ] (0.00 seconds, 250000 Inserts)
% 8.80/9.05
% 8.80/9.05 Stopped by limit on insertions
% 8.80/9.05
% 8.80/9.05 Model 4 [ 1 5 30735 ] (0.00 seconds, 250000 Inserts)
% 8.80/9.05
% 8.80/9.05 Stopped by limit on insertions
% 8.80/9.05
% 8.80/9.05 Model 5 [ 1 6 34463 ] (0.00 seconds, 250000 Inserts)
% 8.80/9.05
% 8.80/9.05 Stopped by limit on insertions
% 8.80/9.05
% 8.80/9.05 Model 6 [ 2 1 1742 ] (0.00 seconds, 250000 Inserts)
% 8.80/9.05
% 8.80/9.05 Model 7 (0.00 seconds, 250000 Inserts)
% 8.80/9.05
% 8.80/9.05 Stopped by limit on number of solutions
% 8.80/9.05
% 8.80/9.05 Stopped by limit on insertions
% 8.80/9.05
% 8.80/9.05 Model 8 [ 2 4 11863 ] (0.00 seconds, 250000 Inserts)
% 8.80/9.05
% 8.80/9.05 ----> UNIT CONFLICT at 8.65 sec ----> 1435 [binary,1434.1,542.1] {+} $F.
% 8.80/9.05
% 8.80/9.05 Length of proof is 1. Level of proof is 1.
% 8.80/9.05
% 8.80/9.05 ---------------- PROOF ----------------
% 8.80/9.05 % SZS status Theorem
% 8.80/9.05 % SZS output start Refutation
% 8.80/9.05
% 8.80/9.05 39 [] {+} -aRewritingSystem0(A)| -isTerminating0(A)| -aElement0(B)|aNormalFormOfIn0($f13(A,B),B,A).
% 8.80/9.05 542 [] {+} -aNormalFormOfIn0(A,xw,xR).
% 8.80/9.05 1366 [] {+} aRewritingSystem0(xR).
% 8.80/9.05 1368 [] {+} isTerminating0(xR).
% 8.80/9.05 1394 [] {+} aElement0(xw).
% 8.80/9.05 1434 [hyper,1394,39,1366,1368] {-} aNormalFormOfIn0($f13(xR,xw),xw,xR).
% 8.80/9.05 1435 [binary,1434.1,542.1] {+} $F.
% 8.80/9.05
% 8.80/9.05 % SZS output end Refutation
% 8.80/9.05 ------------ end of proof -------------
% 8.80/9.05
% 8.80/9.05
% 8.80/9.05 Search stopped by max_proofs option.
% 8.80/9.05
% 8.80/9.05
% 8.80/9.05 Search stopped by max_proofs option.
% 8.80/9.05
% 8.80/9.05 ============ end of search ============
% 8.80/9.05
% 8.80/9.05 ----------- soft-scott stats ----------
% 8.80/9.05
% 8.80/9.05 true clauses given 1 (10.0%)
% 8.80/9.05 false clauses given 9
% 8.80/9.05
% 8.80/9.05 FALSE TRUE
% 8.80/9.05 3 0 1
% 8.80/9.05 4 3 6
% 8.80/9.05 5 0 3
% 8.80/9.05 6 3 4
% 8.80/9.05 7 1 3
% 8.80/9.05 8 2 4
% 8.80/9.05 9 1 3
% 8.80/9.05 11 2 6
% 8.80/9.05 16 0 3
% 8.80/9.05 18 0 2
% 8.80/9.05 20 0 3
% 8.80/9.05 tot: 12 38 (76.0% true)
% 8.80/9.05
% 8.80/9.05
% 8.80/9.05 Model 8 [ 2 4 11863 ] (0.00 seconds, 250000 Inserts)
% 8.80/9.05
% 8.80/9.05 That finishes the proof of the theorem.
% 8.80/9.05
% 8.80/9.05 Process 23568 finished Thu Jun 16 17:26:50 2022
%------------------------------------------------------------------------------