TSTP Solution File: GEO208+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO208+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:19:11 EDT 2022
% Result : Theorem 0.90s 1.10s
% Output : Refutation 0.90s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO208+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n027.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.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 17 22:37:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n027.cluster.edu,
% 0.13/0.37 Fri Jun 17 22:37:52 2022
% 0.13/0.37 The command was "./sos". The process ID is 22480.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37 Following clause subsumed by 15 during input processing: 0 [] {-} -distinct_lines(A,B)|apart_point_and_line(C,A)|apart_point_and_line(C,B)|convergent_lines(A,B).
% 0.13/0.37 Following clause subsumed by 6 during input processing: 0 [] {-} -convergent_lines(A,B)| -unorthogonal_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.13/0.37 28 back subsumes 27.
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 39 during input processing: 0 [] {-} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 37
% 0.20/0.41 number of clauses initially in problem: 46
% 0.20/0.41 percentage of clauses intially in UL: 80
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 94
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 19
% 0.20/0.41 distinct predicate count: 12
% 0.20/0.41 distinct function count: 4
% 0.20/0.41 distinct constant count: 3
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.90/1.10
% 0.90/1.10 -------- PROOF --------
% 0.90/1.10 % SZS status Theorem
% 0.90/1.10 % SZS output start Refutation
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Model 3 [ 3 1 304 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Model 4 [ 3 0 267 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 Model 5 (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on number of solutions
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Model 6 [ 3 1 370 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Model 7 [ 5 0 1362 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Model 8 [ 4 1 437 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Model 9 [ 4 0 151 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Model 10 [ 5 1 651 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Model 11 [ 5 0 474 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 Stopped by limit on insertions
% 0.90/1.10
% 0.90/1.10 Model 12 [ 1 0 153 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 -----> EMPTY CLAUSE at 0.71 sec ----> 103 [hyper,94,35,47] {-} $F.
% 0.90/1.10
% 0.90/1.10 Length of proof is 2. Level of proof is 2.
% 0.90/1.10
% 0.90/1.10 ---------------- PROOF ----------------
% 0.90/1.10 % SZS status Theorem
% 0.90/1.10 % SZS output start Refutation
% 0.90/1.10
% 0.90/1.10 15 [] {+} -distinct_lines(A,B)|convergent_lines(A,B).
% 0.90/1.10 35 [] {+} -parallel_lines(A,B)| -convergent_lines(A,B).
% 0.90/1.10 38 [] {+} -equal_lines($c2,$c1).
% 0.90/1.10 41 [] {+} equal_lines(A,B)|distinct_lines(A,B).
% 0.90/1.10 47 [] {+} parallel_lines($c2,$c1).
% 0.90/1.10 72 [hyper,41,38] {+} distinct_lines($c2,$c1).
% 0.90/1.10 94 [hyper,72,15] {+} convergent_lines($c2,$c1).
% 0.90/1.10 103 [hyper,94,35,47] {-} $F.
% 0.90/1.10
% 0.90/1.10 % SZS output end Refutation
% 0.90/1.10 ------------ end of proof -------------
% 0.90/1.10
% 0.90/1.10
% 0.90/1.10 Search stopped by max_proofs option.
% 0.90/1.10
% 0.90/1.10
% 0.90/1.10 Search stopped by max_proofs option.
% 0.90/1.10
% 0.90/1.10 ============ end of search ============
% 0.90/1.10
% 0.90/1.10 ----------- soft-scott stats ----------
% 0.90/1.10
% 0.90/1.10 true clauses given 1 (8.3%)
% 0.90/1.10 false clauses given 11
% 0.90/1.10
% 0.90/1.10 FALSE TRUE
% 0.90/1.10 5 0 1
% 0.90/1.10 6 7 11
% 0.90/1.10 8 3 10
% 0.90/1.10 11 4 8
% 0.90/1.10 12 0 1
% 0.90/1.10 14 0 4
% 0.90/1.10 tot: 14 35 (71.4% true)
% 0.90/1.10
% 0.90/1.10
% 0.90/1.10 Model 12 [ 1 0 153 ] (0.00 seconds, 250000 Inserts)
% 0.90/1.10
% 0.90/1.10 That finishes the proof of the theorem.
% 0.90/1.10
% 0.90/1.10 Process 22480 finished Fri Jun 17 22:37:53 2022
%------------------------------------------------------------------------------