TSTP Solution File: LAT382+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT382+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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 1.26s 1.47s
% Output : Refutation 1.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : LAT382+3 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.11 % Command : sos-script %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Wed Jun 29 12:09:58 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.15/0.32 ----- Otter 3.2, August 2001 -----
% 0.15/0.32 The process was started by sandbox on n032.cluster.edu,
% 0.15/0.32 Wed Jun 29 12:09:58 2022
% 0.15/0.32 The command was "./sos". The process ID is 30882.
% 0.15/0.32
% 0.15/0.32 set(prolog_style_variables).
% 0.15/0.32 set(auto).
% 0.15/0.32 dependent: set(auto1).
% 0.15/0.32 dependent: set(process_input).
% 0.15/0.32 dependent: clear(print_kept).
% 0.15/0.32 dependent: clear(print_new_demod).
% 0.15/0.32 dependent: clear(print_back_demod).
% 0.15/0.32 dependent: clear(print_back_sub).
% 0.15/0.32 dependent: set(control_memory).
% 0.15/0.32 dependent: assign(max_mem, 12000).
% 0.15/0.32 dependent: assign(pick_given_ratio, 4).
% 0.15/0.32 dependent: assign(stats_level, 1).
% 0.15/0.32 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.32 dependent: assign(sos_limit, 5000).
% 0.15/0.32 dependent: assign(max_weight, 60).
% 0.15/0.32 clear(print_given).
% 0.15/0.32
% 0.15/0.32 formula_list(usable).
% 0.15/0.32
% 0.15/0.32 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.15/0.32
% 0.15/0.32 This ia a non-Horn set with equality. The strategy will be
% 0.15/0.32 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.15/0.32 unit deletion, with positive clauses in sos and nonpositive
% 0.15/0.32 clauses in usable.
% 0.15/0.32
% 0.15/0.32 dependent: set(knuth_bendix).
% 0.15/0.32 dependent: set(para_from).
% 0.15/0.32 dependent: set(para_into).
% 0.15/0.32 dependent: clear(para_from_right).
% 0.15/0.32 dependent: clear(para_into_right).
% 0.15/0.32 dependent: set(para_from_vars).
% 0.15/0.32 dependent: set(eq_units_both_ways).
% 0.15/0.32 dependent: set(dynamic_demod_all).
% 0.15/0.32 dependent: set(dynamic_demod).
% 0.15/0.32 dependent: set(order_eq).
% 0.15/0.32 dependent: set(back_demod).
% 0.15/0.32 dependent: set(lrpo).
% 0.15/0.32 dependent: set(hyper_res).
% 0.15/0.32 dependent: set(unit_deletion).
% 0.15/0.32 dependent: set(factor).
% 0.15/0.32
% 0.15/0.32 ------------> process usable:
% 0.15/0.32
% 0.15/0.32 ------------> process sos:
% 0.15/0.32 Following clause subsumed by 54 during input processing: 0 [copy,54,flip.1] {-} A=A.
% 0.15/0.32 54 back subsumes 44.
% 0.15/0.32 54 back subsumes 43.
% 0.15/0.32
% 0.15/0.32 ======= end of input processing =======
% 0.15/0.35
% 0.15/0.35 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.35
% 0.15/0.35 Stopped by limit on number of solutions
% 0.15/0.35
% 0.15/0.35
% 0.15/0.35 -------------- Softie stats --------------
% 0.15/0.35
% 0.15/0.35 UPDATE_STOP: 300
% 0.15/0.35 SFINDER_TIME_LIMIT: 2
% 0.15/0.35 SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.35 number of clauses in intial UL: 41
% 0.15/0.35 number of clauses initially in problem: 51
% 0.15/0.35 percentage of clauses intially in UL: 80
% 0.15/0.35 percentage of distinct symbols occuring in initial UL: 100
% 0.15/0.35 percent of all initial clauses that are short: 100
% 0.15/0.35 absolute distinct symbol count: 23
% 0.15/0.35 distinct predicate count: 11
% 0.15/0.35 distinct function count: 8
% 0.15/0.35 distinct constant count: 4
% 0.15/0.35
% 0.15/0.35 ---------- no more Softie stats ----------
% 0.15/0.35
% 0.15/0.35
% 0.15/0.35
% 0.15/0.35 =========== start of search ===========
% 1.26/1.47
% 1.26/1.47 -------- PROOF --------
% 1.26/1.47 % SZS status Theorem
% 1.26/1.47 % SZS output start Refutation
% 1.26/1.47
% 1.26/1.47 Model 2 (0.00 seconds, 0 Inserts)
% 1.26/1.47
% 1.26/1.47 Stopped by limit on number of solutions
% 1.26/1.47
% 1.26/1.47 Stopped by limit on insertions
% 1.26/1.47
% 1.26/1.47 Stopped by limit on insertions
% 1.26/1.47
% 1.26/1.47 Stopped by limit on insertions
% 1.26/1.47
% 1.26/1.47 Stopped by limit on insertions
% 1.26/1.47
% 1.26/1.47 Stopped by limit on insertions
% 1.26/1.47
% 1.26/1.47 Stopped by limit on insertions
% 1.26/1.47
% 1.26/1.47 Stopped by limit on insertions
% 1.26/1.47
% 1.26/1.47 Stopped by limit on insertions
% 1.26/1.47
% 1.26/1.47 ----> UNIT CONFLICT at 1.13 sec ----> 292 [binary,290.1,40.1] {+} $F.
% 1.26/1.47
% 1.26/1.47 Length of proof is 6. Level of proof is 2.
% 1.26/1.47
% 1.26/1.47 ---------------- PROOF ----------------
% 1.26/1.47 % SZS status Theorem
% 1.26/1.47 % SZS output start Refutation
% 1.26/1.47
% 1.26/1.47 1 [] {+} -aSet0(A)| -aElementOf0(B,A)|aElement0(B).
% 1.26/1.47 9 [] {+} -aElement0(A)| -aElement0(B)| -sdtlseqdt0(A,B)| -sdtlseqdt0(B,A)|A=B.
% 1.26/1.47 34 [] {+} -aLowerBoundOfIn0(A,xS,xT)|sdtlseqdt0(A,xu).
% 1.26/1.47 38 [] {+} -aLowerBoundOfIn0(A,xS,xT)|sdtlseqdt0(A,xv).
% 1.26/1.47 39 [] {-} xu!=xv.
% 1.26/1.47 40 [copy,39,flip.1] {+} xv!=xu.
% 1.26/1.47 45 [] {+} aSet0(xT).
% 1.26/1.47 48 [] {-} aElementOf0(xu,xT).
% 1.26/1.47 49 [] {-} aLowerBoundOfIn0(xu,xS,xT).
% 1.26/1.47 51 [] {+} aElementOf0(xv,xT).
% 1.26/1.47 52 [] {-} aLowerBoundOfIn0(xv,xS,xT).
% 1.26/1.47 61 [hyper,51,1,45] {+} aElement0(xv).
% 1.26/1.47 81 [hyper,48,1,45] {+} aElement0(xu).
% 1.26/1.47 86 [hyper,49,38] {-} sdtlseqdt0(xu,xv).
% 1.26/1.47 99 [hyper,52,34] {+} sdtlseqdt0(xv,xu).
% 1.26/1.47 290 [hyper,99,9,81,61,86,flip.1] {-} xv=xu.
% 1.26/1.47 292 [binary,290.1,40.1] {+} $F.
% 1.26/1.47
% 1.26/1.47 % SZS output end Refutation
% 1.26/1.47 ------------ end of proof -------------
% 1.26/1.47
% 1.26/1.47
% 1.26/1.47 Search stopped by max_proofs option.
% 1.26/1.47
% 1.26/1.47
% 1.26/1.47 Search stopped by max_proofs option.
% 1.26/1.47
% 1.26/1.47 ============ end of search ============
% 1.26/1.47
% 1.26/1.47 ----------- soft-scott stats ----------
% 1.26/1.47
% 1.26/1.47 true clauses given 11 (37.9%)
% 1.26/1.47 false clauses given 18
% 1.26/1.47
% 1.26/1.47 FALSE TRUE
% 1.26/1.47 4 0 1
% 1.26/1.47 7 0 2
% 1.26/1.47 8 1 2
% 1.26/1.47 9 0 2
% 1.26/1.47 10 2 4
% 1.26/1.47 11 3 1
% 1.26/1.47 12 4 2
% 1.26/1.47 13 5 1
% 1.26/1.47 14 6 2
% 1.26/1.47 15 0 7
% 1.26/1.47 16 19 9
% 1.26/1.47 17 5 7
% 1.26/1.47 18 29 5
% 1.26/1.47 19 0 4
% 1.26/1.47 20 17 0
% 1.26/1.47 21 14 36
% 1.26/1.47 22 0 1
% 1.26/1.47 23 8 8
% 1.26/1.47 25 0 1
% 1.26/1.47 26 2 1
% 1.26/1.47 28 0 1
% 1.26/1.47 tot: 115 97 (45.8% true)
% 1.26/1.47
% 1.26/1.47
% 1.26/1.47 Model 2 (0.00 seconds, 0 Inserts)
% 1.26/1.47
% 1.26/1.47 That finishes the proof of the theorem.
% 1.26/1.47
% 1.26/1.47 Process 30882 finished Wed Jun 29 12:09:59 2022
%------------------------------------------------------------------------------