TSTP Solution File: RNG050+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : RNG050+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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 : Mon Jul 18 20:41:00 EDT 2022
% Result : Theorem 1.28s 1.47s
% Output : Refutation 1.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG050+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 15:59:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.38 ----- Otter 3.2, August 2001 -----
% 0.12/0.38 The process was started by sandbox on n023.cluster.edu,
% 0.12/0.38 Mon May 30 15:59:12 2022
% 0.12/0.38 The command was "./sos". The process ID is 27363.
% 0.12/0.38
% 0.12/0.38 set(prolog_style_variables).
% 0.12/0.38 set(auto).
% 0.12/0.38 dependent: set(auto1).
% 0.12/0.38 dependent: set(process_input).
% 0.12/0.38 dependent: clear(print_kept).
% 0.12/0.38 dependent: clear(print_new_demod).
% 0.12/0.38 dependent: clear(print_back_demod).
% 0.12/0.38 dependent: clear(print_back_sub).
% 0.12/0.38 dependent: set(control_memory).
% 0.12/0.38 dependent: assign(max_mem, 12000).
% 0.12/0.38 dependent: assign(pick_given_ratio, 4).
% 0.12/0.38 dependent: assign(stats_level, 1).
% 0.12/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.38 dependent: assign(sos_limit, 5000).
% 0.12/0.38 dependent: assign(max_weight, 60).
% 0.12/0.38 clear(print_given).
% 0.12/0.38
% 0.12/0.38 formula_list(usable).
% 0.12/0.38
% 0.12/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.12/0.38
% 0.12/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.38 clauses in usable.
% 0.12/0.38
% 0.12/0.38 dependent: set(knuth_bendix).
% 0.12/0.38 dependent: set(para_from).
% 0.12/0.38 dependent: set(para_into).
% 0.12/0.38 dependent: clear(para_from_right).
% 0.12/0.38 dependent: clear(para_into_right).
% 0.12/0.38 dependent: set(para_from_vars).
% 0.12/0.38 dependent: set(eq_units_both_ways).
% 0.12/0.38 dependent: set(dynamic_demod_all).
% 0.12/0.38 dependent: set(dynamic_demod).
% 0.12/0.38 dependent: set(order_eq).
% 0.12/0.38 dependent: set(back_demod).
% 0.12/0.38 dependent: set(lrpo).
% 0.12/0.38 dependent: set(hyper_res).
% 0.12/0.38 dependent: set(unit_deletion).
% 0.12/0.38 dependent: set(factor).
% 0.12/0.38
% 0.12/0.38 ------------> process usable:
% 0.12/0.38
% 0.12/0.38 ------------> process sos:
% 0.12/0.38 Following clause subsumed by 150 during input processing: 0 [copy,150,flip.1] {-} A=A.
% 0.12/0.38 150 back subsumes 107.
% 0.12/0.38 150 back subsumes 104.
% 0.12/0.38 150 back subsumes 86.
% 0.12/0.38 150 back subsumes 70.
% 0.12/0.38 150 back subsumes 66.
% 0.12/0.38 150 back subsumes 60.
% 0.12/0.38
% 0.12/0.38 ======= end of input processing =======
% 0.46/0.67
% 0.46/0.67 Model 1 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 -------------- Softie stats --------------
% 0.46/0.67
% 0.46/0.67 UPDATE_STOP: 300
% 0.46/0.67 SFINDER_TIME_LIMIT: 2
% 0.46/0.67 SHORT_CLAUSE_CUTOFF: 4
% 0.46/0.67 number of clauses in intial UL: 127
% 0.46/0.67 number of clauses initially in problem: 134
% 0.46/0.67 percentage of clauses intially in UL: 94
% 0.46/0.67 percentage of distinct symbols occuring in initial UL: 100
% 0.46/0.67 percent of all initial clauses that are short: 100
% 0.46/0.67 absolute distinct symbol count: 19
% 0.46/0.67 distinct predicate count: 6
% 0.46/0.67 distinct function count: 10
% 0.46/0.67 distinct constant count: 3
% 0.46/0.67
% 0.46/0.67 ---------- no more Softie stats ----------
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 =========== start of search ===========
% 1.28/1.47
% 1.28/1.47 -------- PROOF --------
% 1.28/1.47 % SZS status Theorem
% 1.28/1.47 % SZS output start Refutation
% 1.28/1.47
% 1.28/1.47 Stopped by limit on insertions
% 1.28/1.47
% 1.28/1.47 Stopped by limit on insertions
% 1.28/1.47
% 1.28/1.47 Model 2 [ 2 3 24454 ] (0.00 seconds, 250000 Inserts)
% 1.28/1.47
% 1.28/1.47 Stopped by limit on insertions
% 1.28/1.47
% 1.28/1.47 Model 3 [ 2 1 9358 ] (0.00 seconds, 250000 Inserts)
% 1.28/1.47
% 1.28/1.47 -----> EMPTY CLAUSE at 1.08 sec ----> 224 [hyper,145,41,145,unit_del,187,187] {-} $F.
% 1.28/1.47
% 1.28/1.47 Length of proof is 4. Level of proof is 3.
% 1.28/1.47
% 1.28/1.47 ---------------- PROOF ----------------
% 1.28/1.47 % SZS status Theorem
% 1.28/1.47 % SZS output start Refutation
% 1.28/1.47
% 1.28/1.47 41 [] {+} -aScalar0(A)| -aScalar0(B)|sdtlseqdt0(A,B)|sdtlseqdt0(B,A).
% 1.28/1.47 55 [] {+} -aVector0(A)| -aVector0(B)|aDimensionOf0(A)!=aDimensionOf0(B)|aDimensionOf0(B)!=sz00|sdtasasdt0(A,B)=sz0z00.
% 1.28/1.47 59 [] {+} -sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)).
% 1.28/1.47 109 [factor,55.1.2] {+} -aVector0(A)|aDimensionOf0(A)!=aDimensionOf0(A)|aDimensionOf0(A)!=sz00|sdtasasdt0(A,A)=sz0z00.
% 1.28/1.47 145 [] {+} aScalar0(sz0z00).
% 1.28/1.47 146 [] {-} aVector0(xs).
% 1.28/1.47 147 [] {-} aDimensionOf0(xs)=sz00|sdtlseqdt0(sz0z00,sdtasasdt0(xs,xs)).
% 1.28/1.47 149,148 [copy,147,unit_del,59] {+} aDimensionOf0(xs)=sz00.
% 1.28/1.47 150 [] {+} A=A.
% 1.28/1.47 184,183 [para_from,148.1.1,109.3.1,demod,149,149,unit_del,146,150,150] {-} sdtasasdt0(xs,xs)=sz0z00.
% 1.28/1.47 187 [back_demod,59,demod,184] {-} -sdtlseqdt0(sz0z00,sz0z00).
% 1.28/1.47 224 [hyper,145,41,145,unit_del,187,187] {-} $F.
% 1.28/1.47
% 1.28/1.47 % SZS output end Refutation
% 1.28/1.47 ------------ end of proof -------------
% 1.28/1.47
% 1.28/1.47
% 1.28/1.47 Search stopped by max_proofs option.
% 1.28/1.47
% 1.28/1.47
% 1.28/1.47 Search stopped by max_proofs option.
% 1.28/1.47
% 1.28/1.47 ============ end of search ============
% 1.28/1.47
% 1.28/1.47 ----------- soft-scott stats ----------
% 1.28/1.47
% 1.28/1.47 true clauses given 1 (20.0%)
% 1.28/1.47 false clauses given 4
% 1.28/1.47
% 1.28/1.47 FALSE TRUE
% 1.28/1.47 3 1 1
% 1.28/1.47 4 1 2
% 1.28/1.47 5 2 0
% 1.28/1.47 6 0 1
% 1.28/1.47 7 0 1
% 1.28/1.47 8 0 1
% 1.28/1.47 9 0 2
% 1.28/1.47 10 1 1
% 1.28/1.47 11 1 5
% 1.28/1.47 12 1 1
% 1.28/1.47 13 0 2
% 1.28/1.47 14 0 1
% 1.28/1.47 15 0 3
% 1.28/1.47 16 0 2
% 1.28/1.47 18 0 1
% 1.28/1.47 19 1 2
% 1.28/1.47 20 0 4
% 1.28/1.47 21 0 2
% 1.28/1.47 22 0 2
% 1.28/1.47 23 0 1
% 1.28/1.47 24 0 1
% 1.28/1.47 25 0 1
% 1.28/1.47 26 0 1
% 1.28/1.47 27 0 1
% 1.28/1.47 28 0 1
% 1.28/1.47 29 0 2
% 1.28/1.47 33 0 1
% 1.28/1.47 tot: 8 43 (84.3% true)
% 1.28/1.47
% 1.28/1.47
% 1.28/1.47 Model 3 [ 2 1 9358 ] (0.00 seconds, 250000 Inserts)
% 1.28/1.47
% 1.28/1.47 That finishes the proof of the theorem.
% 1.28/1.47
% 1.28/1.47 Process 27363 finished Mon May 30 15:59:13 2022
%------------------------------------------------------------------------------