TSTP Solution File: GEO205+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO205+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:08 EDT 2022
% Result : Theorem 1.12s 1.29s
% Output : Refutation 1.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GEO205+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.32 % Computer : n023.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.33 % CPULimit : 300
% 0.18/0.33 % WCLimit : 600
% 0.18/0.33 % DateTime : Sat Jun 18 00:19:34 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox2 on n023.cluster.edu,
% 0.18/0.35 Sat Jun 18 00:19:34 2022
% 0.18/0.35 The command was "./sos". The process ID is 3952.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 formula_list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.18/0.35
% 0.18/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.35 clauses in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(knuth_bendix).
% 0.18/0.35 dependent: set(para_from).
% 0.18/0.35 dependent: set(para_into).
% 0.18/0.35 dependent: clear(para_from_right).
% 0.18/0.35 dependent: clear(para_into_right).
% 0.18/0.35 dependent: set(para_from_vars).
% 0.18/0.35 dependent: set(eq_units_both_ways).
% 0.18/0.35 dependent: set(dynamic_demod_all).
% 0.18/0.35 dependent: set(dynamic_demod).
% 0.18/0.35 dependent: set(order_eq).
% 0.18/0.35 dependent: set(back_demod).
% 0.18/0.35 dependent: set(lrpo).
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: set(unit_deletion).
% 0.18/0.35 dependent: set(factor).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35 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.18/0.35 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.18/0.35 28 back subsumes 27.
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35 Following clause subsumed by 39 during input processing: 0 [] {-} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.18/0.35 Following clause subsumed by 49 during input processing: 0 [copy,49,flip.1] {-} -equal_points(intersection_point($c3,$c1),intersection_point($c3,$c1)).
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 36
% 0.18/0.38 number of clauses initially in problem: 46
% 0.18/0.38 percentage of clauses intially in UL: 78
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 84
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 19
% 0.18/0.38 distinct predicate count: 12
% 0.18/0.38 distinct function count: 4
% 0.18/0.38 distinct constant count: 3
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 1.12/1.29
% 1.12/1.29 -------- PROOF --------
% 1.12/1.29 % SZS status Theorem
% 1.12/1.29 % SZS output start Refutation
% 1.12/1.29
% 1.12/1.29 Stopped by limit on insertions
% 1.12/1.29
% 1.12/1.29 Model 3 [ 3 1 322 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Model 4 (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Stopped by limit on number of solutions
% 1.12/1.29
% 1.12/1.29 Model 5 (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Stopped by limit on number of solutions
% 1.12/1.29
% 1.12/1.29 Stopped by limit on insertions
% 1.12/1.29
% 1.12/1.29 Model 6 [ 4 0 727 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Stopped by limit on insertions
% 1.12/1.29
% 1.12/1.29 Model 7 [ 4 0 661 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Stopped by limit on insertions
% 1.12/1.29
% 1.12/1.29 Model 8 [ 4 0 682 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Stopped by limit on insertions
% 1.12/1.29
% 1.12/1.29 Model 9 [ 4 0 590 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Stopped by limit on insertions
% 1.12/1.29
% 1.12/1.29 Model 10 [ 4 0 260 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Stopped by limit on insertions
% 1.12/1.29
% 1.12/1.29 Model 11 [ 5 0 575 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Stopped by limit on insertions
% 1.12/1.29
% 1.12/1.29 Model 12 [ 4 0 241 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Model 13 (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Stopped by limit on number of solutions
% 1.12/1.29
% 1.12/1.29 Stopped by limit on insertions
% 1.12/1.29
% 1.12/1.29 Model 14 [ 10 0 499 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 Stopped by limit on insertions
% 1.12/1.29
% 1.12/1.29 Model 15 [ 12 1 617 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 ----> UNIT CONFLICT at 0.92 sec ----> 160 [binary,159.1,1.1] {-} $F.
% 1.12/1.29
% 1.12/1.29 Length of proof is 3. Level of proof is 3.
% 1.12/1.29
% 1.12/1.29 ---------------- PROOF ----------------
% 1.12/1.29 % SZS status Theorem
% 1.12/1.29 % SZS output start Refutation
% 1.12/1.29
% 1.12/1.29 1 [] {+} -distinct_points(A,A).
% 1.12/1.29 38 [] {-} -convergent_lines($c3,$c1)| -equal_points(intersection_point($c3,$c2),intersection_point($c3,$c1)).
% 1.12/1.29 40 [] {+} equal_points(A,B)|distinct_points(A,B).
% 1.12/1.29 45 [] {-} convergent_lines($c3,$c2).
% 1.12/1.29 47,46 [] {+} equal_lines($c2,$c1).
% 1.12/1.29 48 [back_demod,45,demod,47] {+} convergent_lines($c3,$c1).
% 1.12/1.29 49 [back_demod,38,demod,47,unit_del,48] {+} -equal_points(intersection_point($c3,$c1),intersection_point($c3,$c1)).
% 1.12/1.29 159 [hyper,49,40] {-} distinct_points(intersection_point($c3,$c1),intersection_point($c3,$c1)).
% 1.12/1.29 160 [binary,159.1,1.1] {-} $F.
% 1.12/1.29
% 1.12/1.29 % SZS output end Refutation
% 1.12/1.29 ------------ end of proof -------------
% 1.12/1.29
% 1.12/1.29
% 1.12/1.29 Search stopped by max_proofs option.
% 1.12/1.29
% 1.12/1.29
% 1.12/1.29 Search stopped by max_proofs option.
% 1.12/1.29
% 1.12/1.29 ============ end of search ============
% 1.12/1.29
% 1.12/1.29 ----------- soft-scott stats ----------
% 1.12/1.29
% 1.12/1.29 true clauses given 2 (12.5%)
% 1.12/1.29 false clauses given 14
% 1.12/1.29
% 1.12/1.29 FALSE TRUE
% 1.12/1.29 3 1 0
% 1.12/1.29 5 0 1
% 1.12/1.29 6 8 2
% 1.12/1.29 8 21 11
% 1.12/1.29 9 13 10
% 1.12/1.29 11 0 18
% 1.12/1.29 14 0 6
% 1.12/1.29 15 0 1
% 1.12/1.29 tot: 43 49 (53.3% true)
% 1.12/1.29
% 1.12/1.29
% 1.12/1.29 Model 15 [ 12 1 617 ] (0.00 seconds, 250000 Inserts)
% 1.12/1.29
% 1.12/1.29 That finishes the proof of the theorem.
% 1.12/1.29
% 1.12/1.29 Process 3952 finished Sat Jun 18 00:19:35 2022
%------------------------------------------------------------------------------