TSTP Solution File: LAT382+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT382+1 : 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 : Sun Jul 17 06:48:20 EDT 2022
% Result : Theorem 0.68s 0.86s
% Output : Refutation 0.68s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT382+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/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 : Tue Jun 28 18:56:07 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox2 on n007.cluster.edu,
% 0.19/0.36 Tue Jun 28 18:56:07 2022
% 0.19/0.36 The command was "./sos". The process ID is 4970.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 formula_list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.19/0.36
% 0.19/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36 clauses in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(knuth_bendix).
% 0.19/0.36 dependent: set(para_from).
% 0.19/0.36 dependent: set(para_into).
% 0.19/0.36 dependent: clear(para_from_right).
% 0.19/0.36 dependent: clear(para_into_right).
% 0.19/0.36 dependent: set(para_from_vars).
% 0.19/0.36 dependent: set(eq_units_both_ways).
% 0.19/0.36 dependent: set(dynamic_demod_all).
% 0.19/0.36 dependent: set(dynamic_demod).
% 0.19/0.36 dependent: set(order_eq).
% 0.19/0.36 dependent: set(back_demod).
% 0.19/0.36 dependent: set(lrpo).
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 Following clause subsumed by 40 during input processing: 0 [copy,40,flip.1] {-} A=A.
% 0.19/0.36 40 back subsumes 35.
% 0.19/0.36 40 back subsumes 34.
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.41
% 0.19/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 -------------- Softie stats --------------
% 0.19/0.41
% 0.19/0.41 UPDATE_STOP: 300
% 0.19/0.41 SFINDER_TIME_LIMIT: 2
% 0.19/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.41 number of clauses in intial UL: 32
% 0.19/0.41 number of clauses initially in problem: 37
% 0.19/0.41 percentage of clauses intially in UL: 86
% 0.19/0.41 percentage of distinct symbols occuring in initial UL: 90
% 0.19/0.41 percent of all initial clauses that are short: 100
% 0.19/0.41 absolute distinct symbol count: 21
% 0.19/0.41 distinct predicate count: 11
% 0.19/0.41 distinct function count: 6
% 0.19/0.41 distinct constant count: 4
% 0.19/0.41
% 0.19/0.41 ---------- no more Softie stats ----------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 =========== start of search ===========
% 0.68/0.86
% 0.68/0.86 -------- PROOF --------
% 0.68/0.86 % SZS status Theorem
% 0.68/0.86 % SZS output start Refutation
% 0.68/0.86
% 0.68/0.86 Model 2 (0.00 seconds, 0 Inserts)
% 0.68/0.86
% 0.68/0.86 Stopped by limit on number of solutions
% 0.68/0.86
% 0.68/0.86 Model 3 (0.00 seconds, 0 Inserts)
% 0.68/0.86
% 0.68/0.86 Stopped by limit on number of solutions
% 0.68/0.86
% 0.68/0.86 Model 4 (0.00 seconds, 0 Inserts)
% 0.68/0.86
% 0.68/0.86 Stopped by limit on number of solutions
% 0.68/0.86
% 0.68/0.86 Stopped by limit on insertions
% 0.68/0.86
% 0.68/0.86 Model 5 [ 1 1 2405 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 Model 6 (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 Stopped by limit on number of solutions
% 0.68/0.86
% 0.68/0.86 Stopped by limit on insertions
% 0.68/0.86
% 0.68/0.86 Model 7 [ 2 1 898 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 Stopped by limit on insertions
% 0.68/0.86
% 0.68/0.86 Model 8 [ 2 1 294 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 Stopped by limit on insertions
% 0.68/0.86
% 0.68/0.86 Model 9 [ 1 1 3507 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 ----> UNIT CONFLICT at 0.47 sec ----> 167 [binary,165.1,31.1] {-} $F.
% 0.68/0.86
% 0.68/0.86 Length of proof is 10. Level of proof is 3.
% 0.68/0.86
% 0.68/0.86 ---------------- PROOF ----------------
% 0.68/0.86 % SZS status Theorem
% 0.68/0.86 % SZS output start Refutation
% 0.68/0.86
% 0.68/0.86 1 [] {+} -aSet0(A)| -aElementOf0(B,A)|aElement0(B).
% 0.68/0.86 9 [] {+} -aElement0(A)| -aElement0(B)| -sdtlseqdt0(A,B)| -sdtlseqdt0(B,A)|A=B.
% 0.68/0.86 19 [] {+} -aSet0(A)| -aSubsetOf0(B,A)| -aInfimumOfIn0(C,B,A)|aElementOf0(C,A).
% 0.68/0.86 20 [] {+} -aSet0(A)| -aSubsetOf0(B,A)| -aInfimumOfIn0(C,B,A)|aLowerBoundOfIn0(C,B,A).
% 0.68/0.86 21 [] {+} -aSet0(A)| -aSubsetOf0(B,A)| -aInfimumOfIn0(C,B,A)| -aLowerBoundOfIn0(D,B,A)|sdtlseqdt0(D,C).
% 0.68/0.86 30 [] {-} xu!=xv.
% 0.68/0.86 31 [copy,30,flip.1] {+} xv!=xu.
% 0.68/0.86 36 [] {+} aSet0(xT).
% 0.68/0.86 37 [] {+} aSubsetOf0(xS,xT).
% 0.68/0.86 38 [] {+} aInfimumOfIn0(xu,xS,xT).
% 0.68/0.86 39 [] {+} aInfimumOfIn0(xv,xS,xT).
% 0.68/0.86 51 [hyper,37,20,36,39] {+} aLowerBoundOfIn0(xv,xS,xT).
% 0.68/0.86 52 [hyper,37,19,36,39] {+} aElementOf0(xv,xT).
% 0.68/0.86 59 [hyper,52,1,36] {+} aElement0(xv).
% 0.68/0.86 69 [hyper,38,20,36,37] {+} aLowerBoundOfIn0(xu,xS,xT).
% 0.68/0.86 70 [hyper,38,19,36,37] {+} aElementOf0(xu,xT).
% 0.68/0.86 78 [hyper,70,1,36] {+} aElement0(xu).
% 0.68/0.86 107 [hyper,51,21,36,37,38] {+} sdtlseqdt0(xv,xu).
% 0.68/0.86 130 [hyper,69,21,36,37,39] {+} sdtlseqdt0(xu,xv).
% 0.68/0.86 165 [hyper,130,9,59,78,107] {-} xv=xu.
% 0.68/0.86 167 [binary,165.1,31.1] {-} $F.
% 0.68/0.86
% 0.68/0.86 % SZS output end Refutation
% 0.68/0.86 ------------ end of proof -------------
% 0.68/0.86
% 0.68/0.86
% 0.68/0.86 Search stopped by max_proofs option.
% 0.68/0.86
% 0.68/0.86
% 0.68/0.86 Search stopped by max_proofs option.
% 0.68/0.86
% 0.68/0.86 ============ end of search ============
% 0.68/0.86
% 0.68/0.86 ----------- soft-scott stats ----------
% 0.68/0.86
% 0.68/0.86 true clauses given 13 (52.0%)
% 0.68/0.86 false clauses given 12
% 0.68/0.86
% 0.68/0.86 FALSE TRUE
% 0.68/0.86 5 0 1
% 0.68/0.86 6 0 1
% 0.68/0.86 8 0 2
% 0.68/0.86 10 0 2
% 0.68/0.86 11 0 2
% 0.68/0.86 12 0 4
% 0.68/0.86 13 2 4
% 0.68/0.86 14 0 12
% 0.68/0.86 15 0 7
% 0.68/0.86 16 0 14
% 0.68/0.86 17 0 17
% 0.68/0.86 18 0 5
% 0.68/0.86 19 5 0
% 0.68/0.86 20 4 0
% 0.68/0.86 21 0 6
% 0.68/0.86 22 0 1
% 0.68/0.86 24 0 6
% 0.68/0.86 25 0 7
% 0.68/0.86 26 0 1
% 0.68/0.86 28 0 1
% 0.68/0.86 tot: 11 93 (89.4% true)
% 0.68/0.86
% 0.68/0.86
% 0.68/0.86 Model 9 [ 1 1 3507 ] (0.00 seconds, 250000 Inserts)
% 0.68/0.86
% 0.68/0.86 That finishes the proof of the theorem.
% 0.68/0.86
% 0.68/0.86 Process 4970 finished Tue Jun 28 18:56:07 2022
%------------------------------------------------------------------------------