TSTP Solution File: GEO117+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO117+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:15 EDT 2022
% Result : Theorem 2.32s 2.50s
% Output : Refutation 2.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO117+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 14:51:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n004.cluster.edu,
% 0.12/0.36 Sat Jun 18 14:51:08 2022
% 0.12/0.36 The command was "./sos". The process ID is 30282.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 114 during input processing: 0 [copy,114,flip.1] {-} A=A.
% 0.12/0.36 114 back subsumes 103.
% 0.12/0.36 114 back subsumes 102.
% 0.12/0.36 114 back subsumes 101.
% 0.12/0.36 114 back subsumes 98.
% 0.12/0.36 114 back subsumes 97.
% 0.12/0.36 114 back subsumes 91.
% 0.12/0.36 114 back subsumes 90.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.91/1.12
% 0.91/1.12 Model 1 (0.00 seconds, 0 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on number of solutions
% 0.91/1.12
% 0.91/1.12
% 0.91/1.12 -------------- Softie stats --------------
% 0.91/1.12
% 0.91/1.12 UPDATE_STOP: 300
% 0.91/1.12 SFINDER_TIME_LIMIT: 2
% 0.91/1.12 SHORT_CLAUSE_CUTOFF: 4
% 0.91/1.12 number of clauses in intial UL: 91
% 0.91/1.12 number of clauses initially in problem: 106
% 0.91/1.12 percentage of clauses intially in UL: 85
% 0.91/1.12 percentage of distinct symbols occuring in initial UL: 88
% 0.91/1.12 percent of all initial clauses that are short: 100
% 0.91/1.12 absolute distinct symbol count: 42
% 0.91/1.12 distinct predicate count: 14
% 0.91/1.12 distinct function count: 26
% 0.91/1.12 distinct constant count: 2
% 0.91/1.12
% 0.91/1.12 ---------- no more Softie stats ----------
% 0.91/1.12
% 0.91/1.12
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 =========== start of search ===========
% 2.32/2.50
% 2.32/2.50 -------- PROOF --------
% 2.32/2.50 % SZS status Theorem
% 2.32/2.50 % SZS output start Refutation
% 2.32/2.50
% 2.32/2.50 Stopped by limit on insertions
% 2.32/2.50
% 2.32/2.50 Model 2 [ 6 16 98205 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.50
% 2.32/2.50 Stopped by limit on insertions
% 2.32/2.50
% 2.32/2.50 Model 3 [ 7 13 92158 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.50
% 2.32/2.50 Stopped by limit on insertions
% 2.32/2.50
% 2.32/2.50 Model 4 [ 8 6 41937 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.50
% 2.32/2.50 Stopped by limit on insertions
% 2.32/2.50
% 2.32/2.50 Model 5 [ 9 7 49602 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.50
% 2.32/2.50 -----> EMPTY CLAUSE at 2.13 sec ----> 1166 [hyper,1033,42,114] {-} $F.
% 2.32/2.50
% 2.32/2.50 Length of proof is 3. Level of proof is 3.
% 2.32/2.50
% 2.32/2.50 ---------------- PROOF ----------------
% 2.32/2.50 % SZS status Theorem
% 2.32/2.50 % SZS output start Refutation
% 2.32/2.50
% 2.32/2.50 42 [] {+} -between_c(A,B,C,D)|B!=D.
% 2.32/2.50 52 [] {+} between_o(A,B,C,D)| -ordered_by(A,B,C)| -ordered_by(A,C,D).
% 2.32/2.50 72 [] {+} -between_o(A,B,C,D)|between_c($f18(B,C,D,A),B,C,D).
% 2.32/2.50 96 [factor,52.2.3] {+} between_o(A,B,B,B)| -ordered_by(A,B,B).
% 2.32/2.50 113 [] {-} ordered_by($c2,$c1,$c1).
% 2.32/2.50 114 [] {+} A=A.
% 2.32/2.50 182 [hyper,113,96] {-} between_o($c2,$c1,$c1,$c1).
% 2.32/2.50 1033 [hyper,182,72] {-} between_c($f18($c1,$c1,$c1,$c2),$c1,$c1,$c1).
% 2.32/2.50 1166 [hyper,1033,42,114] {-} $F.
% 2.32/2.50
% 2.32/2.50 % SZS output end Refutation
% 2.32/2.50 ------------ end of proof -------------
% 2.32/2.50
% 2.32/2.50
% 2.32/2.50 Search stopped by max_proofs option.
% 2.32/2.50
% 2.32/2.50
% 2.32/2.50 Search stopped by max_proofs option.
% 2.32/2.50
% 2.32/2.50 ============ end of search ============
% 2.32/2.50
% 2.32/2.50 ----------- soft-scott stats ----------
% 2.32/2.50
% 2.32/2.50 true clauses given 2 (16.7%)
% 2.32/2.50 false clauses given 10
% 2.32/2.50
% 2.32/2.50 FALSE TRUE
% 2.32/2.50 4 0 3
% 2.32/2.50 5 0 2
% 2.32/2.50 6 0 4
% 2.32/2.50 7 0 1
% 2.32/2.50 8 0 5
% 2.32/2.50 9 0 5
% 2.32/2.50 10 1 11
% 2.32/2.50 11 2 9
% 2.32/2.50 12 6 6
% 2.32/2.50 13 9 10
% 2.32/2.50 14 6 10
% 2.32/2.50 15 13 18
% 2.32/2.50 16 4 8
% 2.32/2.50 17 6 21
% 2.32/2.50 18 15 18
% 2.32/2.50 19 35 27
% 2.32/2.50 20 25 32
% 2.32/2.50 21 7 19
% 2.32/2.50 22 11 32
% 2.32/2.50 23 29 7
% 2.32/2.50 24 3 7
% 2.32/2.50 25 32 6
% 2.32/2.50 26 6 11
% 2.32/2.50 27 12 4
% 2.32/2.50 28 9 0
% 2.32/2.50 29 18 16
% 2.32/2.50 30 0 16
% 2.32/2.50 31 26 15
% 2.32/2.50 32 7 6
% 2.32/2.50 33 6 2
% 2.32/2.50 34 18 10
% 2.32/2.50 35 14 21
% 2.32/2.50 36 0 25
% 2.32/2.50 37 19 55
% 2.32/2.50 38 1 12
% 2.32/2.50 39 15 8
% 2.32/2.50 40 12 23
% 2.32/2.50 41 1 9
% 2.32/2.50 42 6 15
% 2.32/2.50 43 12 28
% 2.32/2.50 44 0 13
% 2.32/2.50 45 0 15
% 2.32/2.50 46 12 33
% 2.32/2.50 47 3 2
% 2.32/2.50 48 0 2
% 2.32/2.50 49 6 10
% 2.32/2.50 50 0 2
% 2.32/2.50 51 0 9
% 2.32/2.50 52 6 5
% 2.32/2.50 55 0 2
% 2.32/2.50 56 0 2
% 2.32/2.50 tot: 413 632 (60.5% true)
% 2.32/2.50
% 2.32/2.50
% 2.32/2.50 Model 5 [ 9 -12 49602 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.50
% 2.32/2.50 That finishes the proof of the theorem.
% 2.32/2.50
% 2.32/2.50 Process 30282 finished Sat Jun 18 14:51:11 2022
%------------------------------------------------------------------------------