TSTP Solution File: SWV374+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV374+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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 : Wed Jul 20 21:38:15 EDT 2022
% Result : Theorem 5.01s 5.21s
% Output : Refutation 5.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWV374+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Wed Jun 15 18:20:11 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox on n003.cluster.edu,
% 0.20/0.37 Wed Jun 15 18:20:11 2022
% 0.20/0.37 The command was "./sos". The process ID is 20715.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 formula_list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.20/0.37
% 0.20/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.37 clauses in usable.
% 0.20/0.37
% 0.20/0.37 dependent: set(knuth_bendix).
% 0.20/0.37 dependent: set(para_from).
% 0.20/0.37 dependent: set(para_into).
% 0.20/0.37 dependent: clear(para_from_right).
% 0.20/0.37 dependent: clear(para_into_right).
% 0.20/0.37 dependent: set(para_from_vars).
% 0.20/0.37 dependent: set(eq_units_both_ways).
% 0.20/0.37 dependent: set(dynamic_demod_all).
% 0.20/0.37 dependent: set(dynamic_demod).
% 0.20/0.37 dependent: set(order_eq).
% 0.20/0.37 dependent: set(back_demod).
% 0.20/0.37 dependent: set(lrpo).
% 0.20/0.37 dependent: set(hyper_res).
% 0.20/0.37 dependent: set(unit_deletion).
% 0.20/0.37 dependent: set(factor).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37 Following clause subsumed by 64 during input processing: 0 [copy,64,flip.1] {-} A=A.
% 0.20/0.37 Following clause subsumed by 51 during input processing: 0 [copy,65,flip.1] {-} insert_cpq(triple(A,B,C),D)=triple(insert_pqp(A,D),insert_slb(B,pair(D,bottom)),C).
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Failed to model usable list: disabling FINDER
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 -------------- Softie stats --------------
% 0.20/0.49
% 0.20/0.49 UPDATE_STOP: 300
% 0.20/0.49 SFINDER_TIME_LIMIT: 2
% 0.20/0.49 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.49 number of clauses in intial UL: 33
% 0.20/0.49 number of clauses initially in problem: 62
% 0.20/0.49 percentage of clauses intially in UL: 53
% 0.20/0.49 percentage of distinct symbols occuring in initial UL: 80
% 0.20/0.49 percent of all initial clauses that are short: 100
% 0.20/0.49 absolute distinct symbol count: 31
% 0.20/0.49 distinct predicate count: 10
% 0.20/0.49 distinct function count: 15
% 0.20/0.49 distinct constant count: 6
% 0.20/0.49
% 0.20/0.49 ---------- no more Softie stats ----------
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 =========== start of search ===========
% 1.12/1.34
% 1.12/1.34
% 1.12/1.34 Changing weight limit from 60 to 49.
% 1.12/1.34
% 1.12/1.34 Resetting weight limit to 49 after 135 givens.
% 1.12/1.34
% 1.27/1.46
% 1.27/1.46
% 1.27/1.46 Changing weight limit from 49 to 46.
% 1.27/1.46
% 1.27/1.46 Resetting weight limit to 46 after 140 givens.
% 1.27/1.46
% 1.36/1.62
% 1.36/1.62
% 1.36/1.62 Changing weight limit from 46 to 42.
% 1.36/1.62
% 1.36/1.62 Resetting weight limit to 42 after 145 givens.
% 1.36/1.62
% 1.50/1.75
% 1.50/1.75
% 1.50/1.75 Changing weight limit from 42 to 39.
% 1.50/1.75
% 1.50/1.75 Resetting weight limit to 39 after 150 givens.
% 1.50/1.75
% 1.64/1.85
% 1.64/1.85
% 1.64/1.85 Changing weight limit from 39 to 38.
% 1.64/1.85
% 1.64/1.85 Resetting weight limit to 38 after 155 givens.
% 1.64/1.85
% 1.72/1.91
% 1.72/1.91
% 1.72/1.91 Changing weight limit from 38 to 37.
% 1.72/1.91
% 1.72/1.91 Resetting weight limit to 37 after 160 givens.
% 1.72/1.91
% 1.80/2.02
% 1.80/2.02
% 1.80/2.02 Changing weight limit from 37 to 35.
% 1.80/2.02
% 1.80/2.02 Resetting weight limit to 35 after 165 givens.
% 1.80/2.02
% 1.93/2.12
% 1.93/2.12
% 1.93/2.12 Changing weight limit from 35 to 33.
% 1.93/2.12
% 1.93/2.12 Resetting weight limit to 33 after 170 givens.
% 1.93/2.12
% 1.95/2.21
% 1.95/2.21
% 1.95/2.21 Changing weight limit from 33 to 32.
% 1.95/2.21
% 1.95/2.21 Resetting weight limit to 32 after 175 givens.
% 1.95/2.21
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Changing weight limit from 32 to 29.
% 2.34/2.55
% 2.34/2.55 Resetting weight limit to 29 after 180 givens.
% 2.34/2.55
% 2.56/2.76
% 2.56/2.76
% 2.56/2.76 Changing weight limit from 29 to 28.
% 2.56/2.76
% 2.56/2.76 Resetting weight limit to 28 after 190 givens.
% 2.56/2.76
% 2.56/2.83
% 2.56/2.83
% 2.56/2.83 Changing weight limit from 28 to 27.
% 2.56/2.83
% 2.56/2.83 Resetting weight limit to 27 after 195 givens.
% 2.56/2.83
% 2.71/2.93
% 2.71/2.93
% 2.71/2.93 Changing weight limit from 27 to 26.
% 2.71/2.93
% 2.71/2.93 Resetting weight limit to 26 after 200 givens.
% 2.71/2.93
% 2.81/3.00
% 2.81/3.00
% 2.81/3.00 Changing weight limit from 26 to 25.
% 2.81/3.00
% 2.81/3.00 Resetting weight limit to 25 after 205 givens.
% 2.81/3.00
% 2.85/3.08
% 2.85/3.08
% 2.85/3.08 Changing weight limit from 25 to 24.
% 2.85/3.08
% 2.85/3.08 Resetting weight limit to 24 after 210 givens.
% 2.85/3.08
% 3.01/3.22
% 3.01/3.22
% 3.01/3.22 Changing weight limit from 24 to 23.
% 3.01/3.22
% 3.01/3.22 Resetting weight limit to 23 after 220 givens.
% 3.01/3.22
% 3.19/3.39
% 3.19/3.39
% 3.19/3.39 Changing weight limit from 23 to 22.
% 3.19/3.39
% 3.19/3.39 Resetting weight limit to 22 after 230 givens.
% 3.19/3.39
% 3.57/3.78
% 3.57/3.78
% 3.57/3.78 Changing weight limit from 22 to 21.
% 3.57/3.78
% 3.57/3.78 Resetting weight limit to 21 after 270 givens.
% 3.57/3.78
% 3.98/4.19
% 3.98/4.19
% 3.98/4.19 Changing weight limit from 21 to 20.
% 3.98/4.19
% 3.98/4.19 Modelling stopped after 300 given clauses and 0.00 seconds
% 3.98/4.19
% 3.98/4.19
% 3.98/4.19 Resetting weight limit to 20 after 320 givens.
% 3.98/4.19
% 4.58/4.77
% 4.58/4.77
% 4.58/4.77 Changing weight limit from 20 to 19.
% 4.58/4.77
% 4.58/4.77 Resetting weight limit to 19 after 370 givens.
% 4.58/4.77
% 4.90/5.10
% 4.90/5.10
% 4.90/5.10 Changing weight limit from 19 to 18.
% 4.90/5.10
% 4.90/5.10 Resetting weight limit to 18 after 445 givens.
% 4.90/5.10
% 5.01/5.21
% 5.01/5.21 -------- PROOF --------
% 5.01/5.21 % SZS status Theorem
% 5.01/5.21 % SZS output start Refutation
% 5.01/5.21
% 5.01/5.21 ----> UNIT CONFLICT at 4.81 sec ----> 14238 [binary,14237.1,6.1] {-} $F.
% 5.01/5.21
% 5.01/5.21 Length of proof is 14. Level of proof is 7.
% 5.01/5.21
% 5.01/5.21 ---------------- PROOF ----------------
% 5.01/5.21 % SZS status Theorem
% 5.01/5.21 % SZS output start Refutation
% 5.01/5.21
% 5.01/5.21 4 [] {+} strictly_less_than(A,B)| -less_than(A,B)|less_than(B,A).
% 5.01/5.21 6 [] {+} -contains_slb(create_slb,A).
% 5.01/5.21 7 [] {+} -contains_slb(insert_slb(A,pair(B,C)),D)|contains_slb(A,D)|B=D.
% 5.01/5.21 9 [] {+} contains_slb(insert_slb(A,pair(B,C)),D)|B!=D.
% 5.01/5.21 29 [] {-} -ok(triple(A,B,bad))|$F.
% 5.01/5.21 30 [copy,29,propositional] {+} -ok(triple(A,B,bad)).
% 5.01/5.21 33 [] {+} A=create_slb| -contains_slb(A,findmin_pqp_res(B))| -strictly_less_than(findmin_pqp_res(B),lookup_slb(A,findmin_pqp_res(B)))|findmin_cpq_eff(triple(B,A,C))=triple(B,update_slb(A,findmin_pqp_res(B)),bad).
% 5.01/5.21 35 [] {-} $c2=create_slb| -contains_slb($c2,findmin_pqp_res($c3))| -less_than(lookup_slb($c2,findmin_pqp_res($c3)),findmin_pqp_res($c3)).
% 5.01/5.21 36 [copy,35,flip.1] {+} create_slb=$c2| -contains_slb($c2,findmin_pqp_res($c3))| -less_than(lookup_slb($c2,findmin_pqp_res($c3)),findmin_pqp_res($c3)).
% 5.01/5.21 38 [] {-} less_than(A,B)|less_than(B,A).
% 5.01/5.21 53 [] {-} findmin_cpq_eff(triple(A,create_slb,B))=triple(A,create_slb,bad).
% 5.01/5.21 55 [] {-} A=create_slb|contains_slb(A,findmin_pqp_res(B))|findmin_cpq_eff(triple(B,A,C))=triple(B,update_slb(A,findmin_pqp_res(B)),bad).
% 5.01/5.21 63 [] {-} ok(findmin_cpq_eff(triple($c3,$c2,$c1))).
% 5.01/5.21 64 [] {-} A=A.
% 5.01/5.21 68 [hyper,38,4,factor_simp] {-} less_than(A,B)|strictly_less_than(B,A).
% 5.01/5.21 86 [hyper,64,9] {-} contains_slb(insert_slb(A,pair(B,C)),B).
% 5.01/5.21 218 [para_into,63.1.1.1.2,7.3.1] {-} ok(findmin_cpq_eff(triple($c3,A,$c1)))| -contains_slb(insert_slb(B,pair($c2,C)),A)|contains_slb(B,A).
% 5.01/5.21 234 [para_into,63.1.1,33.4.1,unit_del,30,flip.1] {-} create_slb=$c2| -contains_slb($c2,findmin_pqp_res($c3))| -strictly_less_than(findmin_pqp_res($c3),lookup_slb($c2,findmin_pqp_res($c3))).
% 5.01/5.21 1077 [para_from,55.3.1,63.1.1,unit_del,30,flip.1] {-} create_slb=$c2|contains_slb($c2,findmin_pqp_res($c3)).
% 5.01/5.21 1137 [para_from,1077.1.1,6.1.1] {-} -contains_slb($c2,A)|contains_slb($c2,findmin_pqp_res($c3)).
% 5.01/5.21 13651 [para_into,218.1.1,53.1.1,unit_del,30] {-} -contains_slb(insert_slb(A,pair($c2,B)),create_slb)|contains_slb(A,create_slb).
% 5.01/5.21 13666 [para_into,13651.1.2,1077.1.1,unit_del,86] {-} contains_slb(A,create_slb)|contains_slb($c2,findmin_pqp_res($c3)).
% 5.01/5.21 13681 [hyper,13666,1137,factor_simp] {-} contains_slb($c2,findmin_pqp_res($c3)).
% 5.01/5.21 14134 [hyper,234,13681,68] {-} create_slb=$c2|less_than(lookup_slb($c2,findmin_pqp_res($c3)),findmin_pqp_res($c3)).
% 5.01/5.21 14163,14162 [hyper,14134,36,13681,factor_simp] {-} create_slb=$c2.
% 5.01/5.21 14237 [back_demod,13651,demod,14163,14163,unit_del,86] {-} contains_slb(A,$c2).
% 5.01/5.21 14238 [binary,14237.1,6.1] {-} $F.
% 5.01/5.21
% 5.01/5.21 % SZS output end Refutation
% 5.01/5.21 ------------ end of proof -------------
% 5.01/5.21
% 5.01/5.21
% 5.01/5.21 Search stopped by max_proofs option.
% 5.01/5.21
% 5.01/5.21
% 5.01/5.21 Search stopped by max_proofs option.
% 5.01/5.21
% 5.01/5.21 ============ end of search ============
% 5.01/5.21
% 5.01/5.21 That finishes the proof of the theorem.
% 5.01/5.21
% 5.01/5.21 Process 20715 finished Wed Jun 15 18:20:16 2022
%------------------------------------------------------------------------------