TSTP Solution File: COM016+4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM016+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:30 EDT 2022
% Result : Theorem 9.37s 9.58s
% Output : Refutation 9.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM016+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.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:31:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.08/3.28 ----- Otter 3.2, August 2001 -----
% 3.08/3.28 The process was started by sandbox2 on n014.cluster.edu,
% 3.08/3.28 Thu Jun 16 17:31:05 2022
% 3.08/3.28 The command was "./sos". The process ID is 23921.
% 3.08/3.28
% 3.08/3.28 set(prolog_style_variables).
% 3.08/3.28 set(auto).
% 3.08/3.28 dependent: set(auto1).
% 3.08/3.28 dependent: set(process_input).
% 3.08/3.28 dependent: clear(print_kept).
% 3.08/3.28 dependent: clear(print_new_demod).
% 3.08/3.28 dependent: clear(print_back_demod).
% 3.08/3.28 dependent: clear(print_back_sub).
% 3.08/3.28 dependent: set(control_memory).
% 3.08/3.28 dependent: assign(max_mem, 12000).
% 3.08/3.28 dependent: assign(pick_given_ratio, 4).
% 3.08/3.28 dependent: assign(stats_level, 1).
% 3.08/3.28 dependent: assign(pick_semantic_ratio, 3).
% 3.08/3.28 dependent: assign(sos_limit, 5000).
% 3.08/3.28 dependent: assign(max_weight, 60).
% 3.08/3.28 clear(print_given).
% 3.08/3.28
% 3.08/3.28 formula_list(usable).
% 3.08/3.28
% 3.08/3.28 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=13.
% 3.08/3.28
% 3.08/3.28 This ia a non-Horn set with equality. The strategy will be
% 3.08/3.28 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 3.08/3.28 unit deletion, with positive clauses in sos and nonpositive
% 3.08/3.28 clauses in usable.
% 3.08/3.28
% 3.08/3.28 dependent: set(knuth_bendix).
% 3.08/3.28 dependent: set(para_from).
% 3.08/3.28 dependent: set(para_into).
% 3.08/3.28 dependent: clear(para_from_right).
% 3.08/3.28 dependent: clear(para_into_right).
% 3.08/3.28 dependent: set(para_from_vars).
% 3.08/3.28 dependent: set(eq_units_both_ways).
% 3.08/3.28 dependent: set(dynamic_demod_all).
% 3.08/3.28 dependent: set(dynamic_demod).
% 3.08/3.28 dependent: set(order_eq).
% 3.08/3.28 dependent: set(back_demod).
% 3.08/3.28 dependent: set(lrpo).
% 3.08/3.28 dependent: set(hyper_res).
% 3.08/3.28 dependent: set(unit_deletion).
% 3.08/3.28 dependent: set(factor).
% 3.08/3.28
% 3.08/3.28 ------------> process usable:
% 3.08/3.28 789 back subsumes 659.
% 3.08/3.28 792 back subsumes 662.
% 3.08/3.28 795 back subsumes 665.
% 3.08/3.28 798 back subsumes 668.
% 3.08/3.28 801 back subsumes 671.
% 3.08/3.28 804 back subsumes 674.
% 3.08/3.28 807 back subsumes 677.
% 3.08/3.28 810 back subsumes 680.
% 3.08/3.28 813 back subsumes 683.
% 3.08/3.28 816 back subsumes 686.
% 3.08/3.28 819 back subsumes 689.
% 3.08/3.28 899 back subsumes 866.
% 3.08/3.28 902 back subsumes 869.
% 3.08/3.28 905 back subsumes 872.
% 3.08/3.28 908 back subsumes 875.
% 3.08/3.28 911 back subsumes 878.
% 3.08/3.28 914 back subsumes 881.
% 3.08/3.28 917 back subsumes 884.
% 3.08/3.28 920 back subsumes 887.
% 3.08/3.28 923 back subsumes 890.
% 3.08/3.28 926 back subsumes 893.
% 3.08/3.28 929 back subsumes 896.
% 3.08/3.28 1093 back subsumes 974.
% 3.08/3.28 1096 back subsumes 977.
% 3.08/3.28 1099 back subsumes 980.
% 3.08/3.28 1102 back subsumes 983.
% 3.08/3.28 1105 back subsumes 986.
% 3.08/3.28 1108 back subsumes 989.
% 3.08/3.28 1111 back subsumes 992.
% 3.08/3.28 1114 back subsumes 995.
% 3.08/3.28 1117 back subsumes 998.
% 3.08/3.28
% 3.08/3.28 ------------> process sos:
% 3.08/3.28 Following clause subsumed by 1379 during input processing: 0 [copy,1379,flip.1] {-} A=A.
% 3.08/3.28 1379 back subsumes 548.
% 3.08/3.28
% 3.08/3.28 ======= end of input processing =======
% 3.31/3.50
% 3.31/3.50 Model 1 (0.00 seconds, 0 Inserts)
% 3.31/3.50
% 3.31/3.50 Stopped by limit on number of solutions
% 3.31/3.50
% 3.31/3.50
% 3.31/3.50 -------------- Softie stats --------------
% 3.31/3.50
% 3.31/3.50 UPDATE_STOP: 300
% 3.31/3.50 SFINDER_TIME_LIMIT: 2
% 3.31/3.50 SHORT_CLAUSE_CUTOFF: 4
% 3.31/3.50 number of clauses in intial UL: 1124
% 3.31/3.50 number of clauses initially in problem: 1139
% 3.31/3.50 percentage of clauses intially in UL: 98
% 3.31/3.50 percentage of distinct symbols occuring in initial UL: 91
% 3.31/3.50 percent of all initial clauses that are short: 100
% 3.31/3.50 absolute distinct symbol count: 36
% 3.31/3.50 distinct predicate count: 11
% 3.31/3.50 distinct function count: 19
% 3.31/3.50 distinct constant count: 6
% 3.31/3.50
% 3.31/3.50 ---------- no more Softie stats ----------
% 3.31/3.50
% 3.31/3.50
% 3.31/3.50
% 3.31/3.50 Stopped by limit on insertions
% 3.31/3.50
% 3.31/3.50 =========== start of search ===========
% 9.37/9.58
% 9.37/9.58 -------- PROOF --------
% 9.37/9.58 % SZS status Theorem
% 9.37/9.58 % SZS output start Refutation
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Model 2 (0.00 seconds, 0 Inserts)
% 9.37/9.58
% 9.37/9.58 Stopped by limit on number of solutions
% 9.37/9.58
% 9.37/9.58 Model 3 (0.00 seconds, 0 Inserts)
% 9.37/9.58
% 9.37/9.58 Stopped by limit on number of solutions
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Model 4 [ 2 1 592 ] (0.00 seconds, 250000 Inserts)
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Model 5 [ 1 1 5439 ] (0.00 seconds, 250000 Inserts)
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Model 6 [ 5 1 590 ] (0.00 seconds, 250000 Inserts)
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Model 7 [ 4 2 4564 ] (0.00 seconds, 250000 Inserts)
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Stopped by limit on insertions
% 9.37/9.58
% 9.37/9.58 Model 8 [ 5 2 622 ] (0.00 seconds, 250000 Inserts)
% 9.37/9.58
% 9.37/9.58 -----> EMPTY CLAUSE at 9.19 sec ----> 1526 [hyper,1491,537,1369,1379] {-} $F.
% 9.37/9.58
% 9.37/9.58 Length of proof is 2. Level of proof is 2.
% 9.37/9.58
% 9.37/9.58 ---------------- PROOF ----------------
% 9.37/9.58 % SZS status Theorem
% 9.37/9.58 % SZS output start Refutation
% 9.37/9.58
% 9.37/9.58 537 [] {+} -aElement0(A)| -aReductOfIn0(A,xa,xR)|A!=xb.
% 9.37/9.58 540 [] {+} -aElement0(A)| -aReductOfIn0(A,xa,xR)| -sdtmndtplgtdt0(A,xR,xb).
% 9.37/9.58 1369 [] {+} aElement0(xb).
% 9.37/9.58 1371 [] {+} aReductOfIn0(xb,xa,xR)|aElement0($c1).
% 9.37/9.58 1372 [] {-} aReductOfIn0(xb,xa,xR)|aReductOfIn0($c1,xa,xR).
% 9.37/9.58 1373 [] {+} aReductOfIn0(xb,xa,xR)|sdtmndtplgtdt0($c1,xR,xb).
% 9.37/9.58 1379 [] {+} A=A.
% 9.37/9.58 1421 [hyper,1379,537,1369,1372] {+} aReductOfIn0($c1,xa,xR).
% 9.37/9.58 1491 [hyper,1421,540,1371,1373,factor_simp] {+} aReductOfIn0(xb,xa,xR).
% 9.37/9.58 1526 [hyper,1491,537,1369,1379] {-} $F.
% 9.37/9.58
% 9.37/9.58 % SZS output end Refutation
% 9.37/9.58 ------------ end of proof -------------
% 9.37/9.58
% 9.37/9.58
% 9.37/9.58 Search stopped by max_proofs option.
% 9.37/9.58
% 9.37/9.58
% 9.37/9.58 Search stopped by max_proofs option.
% 9.37/9.58
% 9.37/9.58 ============ end of search ============
% 9.37/9.58
% 9.37/9.58 ----------- soft-scott stats ----------
% 9.37/9.58
% 9.37/9.58 true clauses given 5 (25.0%)
% 9.37/9.58 false clauses given 15
% 9.37/9.58
% 9.37/9.58 FALSE TRUE
% 9.37/9.58 3 0 1
% 9.37/9.58 4 5 1
% 9.37/9.58 5 3 3
% 9.37/9.58 6 4 2
% 9.37/9.58 7 0 3
% 9.37/9.58 8 1 5
% 9.37/9.58 9 0 1
% 9.37/9.58 10 0 1
% 9.37/9.58 11 0 3
% 9.37/9.58 13 1 2
% 9.37/9.58 15 0 4
% 9.37/9.58 16 0 12
% 9.37/9.58 18 4 9
% 9.37/9.58 20 0 11
% 9.37/9.58 22 0 1
% 9.37/9.58 23 0 6
% 9.37/9.58 tot: 18 65 (78.3% true)
% 9.37/9.58
% 9.37/9.58
% 9.37/9.58 Model 8 [ 5 2 622 ] (0.00 seconds, 250000 Inserts)
% 9.37/9.58
% 9.37/9.58 That finishes the proof of the theorem.
% 9.37/9.58
% 9.37/9.58 Process 23921 finished Thu Jun 16 17:31:14 2022
%------------------------------------------------------------------------------