TSTP Solution File: GEO118+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO118+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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 : Sat Jul 16 06:18:16 EDT 2022
% Result : Theorem 2.72s 2.92s
% Output : Refutation 2.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO118+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n010.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.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Sat Jun 18 03:10:23 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.13/0.38 ----- Otter 3.2, August 2001 -----
% 0.13/0.38 The process was started by sandbox2 on n010.cluster.edu,
% 0.13/0.38 Sat Jun 18 03:10:23 2022
% 0.13/0.38 The command was "./sos". The process ID is 17687.
% 0.13/0.38
% 0.13/0.38 set(prolog_style_variables).
% 0.13/0.38 set(auto).
% 0.13/0.38 dependent: set(auto1).
% 0.13/0.38 dependent: set(process_input).
% 0.13/0.38 dependent: clear(print_kept).
% 0.13/0.38 dependent: clear(print_new_demod).
% 0.13/0.38 dependent: clear(print_back_demod).
% 0.13/0.38 dependent: clear(print_back_sub).
% 0.13/0.38 dependent: set(control_memory).
% 0.13/0.38 dependent: assign(max_mem, 12000).
% 0.13/0.38 dependent: assign(pick_given_ratio, 4).
% 0.13/0.38 dependent: assign(stats_level, 1).
% 0.13/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.38 dependent: assign(sos_limit, 5000).
% 0.13/0.38 dependent: assign(max_weight, 60).
% 0.13/0.38 clear(print_given).
% 0.13/0.38
% 0.13/0.38 formula_list(usable).
% 0.13/0.38
% 0.13/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 0.13/0.38
% 0.13/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.38 clauses in usable.
% 0.13/0.38
% 0.13/0.38 dependent: set(knuth_bendix).
% 0.13/0.38 dependent: set(para_from).
% 0.13/0.38 dependent: set(para_into).
% 0.13/0.38 dependent: clear(para_from_right).
% 0.13/0.38 dependent: clear(para_into_right).
% 0.13/0.38 dependent: set(para_from_vars).
% 0.13/0.38 dependent: set(eq_units_both_ways).
% 0.13/0.38 dependent: set(dynamic_demod_all).
% 0.13/0.38 dependent: set(dynamic_demod).
% 0.13/0.38 dependent: set(order_eq).
% 0.13/0.38 dependent: set(back_demod).
% 0.13/0.38 dependent: set(lrpo).
% 0.13/0.38 dependent: set(hyper_res).
% 0.13/0.38 dependent: set(unit_deletion).
% 0.13/0.38 dependent: set(factor).
% 0.13/0.38
% 0.13/0.38 ------------> process usable:
% 0.13/0.38
% 0.13/0.38 ------------> process sos:
% 0.13/0.38 Following clause subsumed by 115 during input processing: 0 [copy,115,flip.1] {-} A=A.
% 0.13/0.38 115 back subsumes 103.
% 0.13/0.38 115 back subsumes 102.
% 0.13/0.38 115 back subsumes 101.
% 0.13/0.38 115 back subsumes 98.
% 0.13/0.38 115 back subsumes 97.
% 0.13/0.38 115 back subsumes 91.
% 0.13/0.38 115 back subsumes 90.
% 0.13/0.38
% 0.13/0.38 ======= end of input processing =======
% 0.90/1.10
% 0.90/1.10 Model 1 (0.00 seconds, 0 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on number of solutions
% 0.90/1.10
% 0.90/1.10
% 0.90/1.10 -------------- Softie stats --------------
% 0.90/1.10
% 0.90/1.10 UPDATE_STOP: 300
% 0.90/1.10 SFINDER_TIME_LIMIT: 2
% 0.90/1.10 SHORT_CLAUSE_CUTOFF: 4
% 0.90/1.10 number of clauses in intial UL: 91
% 0.90/1.10 number of clauses initially in problem: 107
% 0.90/1.10 percentage of clauses intially in UL: 85
% 0.90/1.10 percentage of distinct symbols occuring in initial UL: 86
% 0.90/1.10 percent of all initial clauses that are short: 100
% 0.90/1.10 absolute distinct symbol count: 43
% 0.90/1.10 distinct predicate count: 14
% 0.90/1.10 distinct function count: 26
% 0.90/1.10 distinct constant count: 3
% 0.90/1.10
% 0.90/1.10 ---------- no more Softie stats ----------
% 0.90/1.10
% 0.90/1.10
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 =========== start of search ===========
% 2.72/2.92
% 2.72/2.92 -------- PROOF --------
% 2.72/2.92 % SZS status Theorem
% 2.72/2.92 % SZS output start Refutation
% 2.72/2.92
% 2.72/2.92 Stopped by limit on insertions
% 2.72/2.92
% 2.72/2.92 Model 2 [ 4 16 106292 ] (0.00 seconds, 250000 Inserts)
% 2.72/2.92
% 2.72/2.92 Stopped by limit on insertions
% 2.72/2.92
% 2.72/2.92 Model 3 [ 4 23 131489 ] (0.00 seconds, 250000 Inserts)
% 2.72/2.92
% 2.72/2.92 Stopped by limit on insertions
% 2.72/2.92
% 2.72/2.92 Model 4 [ 10 7 41950 ] (0.00 seconds, 250000 Inserts)
% 2.72/2.92
% 2.72/2.92 Stopped by limit on insertions
% 2.72/2.92
% 2.72/2.92 Model 5 [ 8 9 55316 ] (0.00 seconds, 250000 Inserts)
% 2.72/2.92
% 2.72/2.92 Stopped by limit on insertions
% 2.72/2.92
% 2.72/2.92 Model 6 [ 10 7 50243 ] (0.00 seconds, 250000 Inserts)
% 2.72/2.92
% 2.72/2.92 -----> EMPTY CLAUSE at 2.51 sec ----> 1344 [hyper,1053,42,115] {-} $F.
% 2.72/2.92
% 2.72/2.92 Length of proof is 2. Level of proof is 2.
% 2.72/2.92
% 2.72/2.92 ---------------- PROOF ----------------
% 2.72/2.92 % SZS status Theorem
% 2.72/2.92 % SZS output start Refutation
% 2.72/2.92
% 2.72/2.92 42 [] {+} -between_c(A,B,C,D)|B!=D.
% 2.72/2.92 53 [] {+} between_o(A,B,C,D)| -ordered_by(A,D,C)| -ordered_by(A,C,B).
% 2.72/2.92 72 [] {+} -between_o(A,B,C,D)|between_c($f18(B,C,D,A),B,C,D).
% 2.72/2.92 113 [] {+} ordered_by($c3,$c2,$c1).
% 2.72/2.92 114 [] {+} ordered_by($c3,$c1,$c2).
% 2.72/2.92 115 [] {+} A=A.
% 2.72/2.92 826 [hyper,114,53,113] {-} between_o($c3,$c2,$c1,$c2).
% 2.72/2.92 1053 [hyper,826,72] {-} between_c($f18($c2,$c1,$c2,$c3),$c2,$c1,$c2).
% 2.72/2.92 1344 [hyper,1053,42,115] {-} $F.
% 2.72/2.92
% 2.72/2.92 % SZS output end Refutation
% 2.72/2.92 ------------ end of proof -------------
% 2.72/2.92
% 2.72/2.92
% 2.72/2.92 Search stopped by max_proofs option.
% 2.72/2.92
% 2.72/2.92
% 2.72/2.92 Search stopped by max_proofs option.
% 2.72/2.92
% 2.72/2.92 ============ end of search ============
% 2.72/2.92
% 2.72/2.92 ----------- soft-scott stats ----------
% 2.72/2.92
% 2.72/2.92 true clauses given 3 (21.4%)
% 2.72/2.92 false clauses given 11
% 2.72/2.92
% 2.72/2.92 FALSE TRUE
% 2.72/2.92 3 0 1
% 2.72/2.92 4 0 3
% 2.72/2.92 5 0 2
% 2.72/2.92 6 0 4
% 2.72/2.92 7 0 2
% 2.72/2.92 8 0 6
% 2.72/2.92 9 1 8
% 2.72/2.92 10 0 14
% 2.72/2.92 11 2 9
% 2.72/2.92 12 6 15
% 2.72/2.92 13 17 14
% 2.72/2.92 14 8 17
% 2.72/2.92 15 30 16
% 2.72/2.92 16 9 7
% 2.72/2.92 17 6 21
% 2.72/2.92 18 19 35
% 2.72/2.92 19 54 48
% 2.72/2.92 20 50 26
% 2.72/2.92 21 7 32
% 2.72/2.92 22 11 44
% 2.72/2.92 23 30 6
% 2.72/2.92 24 6 7
% 2.72/2.92 25 33 9
% 2.72/2.92 26 5 12
% 2.72/2.92 27 12 4
% 2.72/2.92 28 9 0
% 2.72/2.92 29 18 19
% 2.72/2.92 30 0 16
% 2.72/2.92 31 26 15
% 2.72/2.92 32 5 8
% 2.72/2.92 33 6 2
% 2.72/2.92 34 17 11
% 2.72/2.92 35 12 23
% 2.72/2.92 36 0 25
% 2.72/2.92 37 18 56
% 2.72/2.92 38 1 12
% 2.72/2.92 39 18 8
% 2.72/2.92 40 12 23
% 2.72/2.92 41 0 10
% 2.72/2.92 42 6 15
% 2.72/2.92 43 12 28
% 2.72/2.92 44 0 13
% 2.72/2.92 45 0 15
% 2.72/2.92 46 6 39
% 2.72/2.92 47 3 2
% 2.72/2.92 48 0 2
% 2.72/2.92 49 6 10
% 2.72/2.92 50 0 2
% 2.72/2.92 51 0 9
% 2.72/2.92 52 0 11
% 2.72/2.92 55 0 2
% 2.72/2.92 56 0 2
% 2.72/2.92 tot: 481 740 (60.6% true)
% 2.72/2.92
% 2.72/2.92
% 2.72/2.92 Model 6 [ 10 -14 50243 ] (0.00 seconds, 250000 Inserts)
% 2.72/2.92
% 2.72/2.92 That finishes the proof of the theorem.
% 2.72/2.92
% 2.72/2.92 Process 17687 finished Sat Jun 18 03:10:25 2022
%------------------------------------------------------------------------------