TSTP Solution File: GEO171+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO171+3 : TPTP v8.1.0. Released v4.0.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:39 EDT 2022
% Result : Theorem 0.60s 0.84s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO171+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jun 18 18:23:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n010.cluster.edu,
% 0.13/0.36 Sat Jun 18 18:23:53 2022
% 0.13/0.36 The command was "./sos". The process ID is 16484.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36 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.36 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.36 28 back subsumes 27.
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 39 during input processing: 0 [] {-} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.13/0.36
% 0.13/0.36 ======= 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: 44
% 0.20/0.41 percentage of clauses intially in UL: 84
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 18
% 0.20/0.41 distinct predicate count: 12
% 0.20/0.41 distinct function count: 4
% 0.20/0.41 distinct constant count: 2
% 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.60/0.84
% 0.60/0.84 -------- PROOF --------
% 0.60/0.84 % SZS status Theorem
% 0.60/0.84 % SZS output start Refutation
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 3 [ 4 0 400 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 4 [ 1 0 730 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 5 [ 13 0 1064 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 6 [ 13 1 588 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 7 [ 13 1 731 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 8 [ 13 0 638 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 9 [ 13 0 466 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 ----> UNIT CONFLICT at 0.45 sec ----> 113 [binary,112.1,21.1] {+} $F.
% 0.60/0.84
% 0.60/0.84 Length of proof is 3. Level of proof is 3.
% 0.60/0.84
% 0.60/0.84 ---------------- PROOF ----------------
% 0.60/0.84 % SZS status Theorem
% 0.60/0.84 % SZS output start Refutation
% 0.60/0.84
% 0.60/0.84 21 [] {+} -unorthogonal_lines(orthogonal_through_point(A,B),A).
% 0.60/0.84 28 [] {+} unorthogonal_lines(A,B)|unorthogonal_lines(A,C)| -convergent_lines(B,C).
% 0.60/0.84 38 [] {+} -distinct_lines($c2,$c1).
% 0.60/0.84 41 [] {+} equal_lines(A,B)|distinct_lines(A,B).
% 0.60/0.84 45 [] {-} convergent_lines($c2,$c1).
% 0.60/0.84 47 [hyper,45,28] {+} unorthogonal_lines(A,$c2)|unorthogonal_lines(A,$c1).
% 0.60/0.84 108 [para_into,47.1.2,41.1.1] {-} unorthogonal_lines(A,B)|unorthogonal_lines(A,$c1)|distinct_lines($c2,B).
% 0.60/0.84 112 [factor,108.1.2,unit_del,38] {-} unorthogonal_lines(A,$c1).
% 0.60/0.84 113 [binary,112.1,21.1] {+} $F.
% 0.60/0.84
% 0.60/0.84 % SZS output end Refutation
% 0.60/0.84 ------------ end of proof -------------
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Search stopped by max_proofs option.
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Search stopped by max_proofs option.
% 0.60/0.84
% 0.60/0.84 ============ end of search ============
% 0.60/0.84
% 0.60/0.84 ----------- soft-scott stats ----------
% 0.60/0.84
% 0.60/0.84 true clauses given 1 (10.0%)
% 0.60/0.84 false clauses given 9
% 0.60/0.84
% 0.60/0.84 FALSE TRUE
% 0.60/0.84 6 5 4
% 0.60/0.84 8 8 7
% 0.60/0.84 9 0 6
% 0.60/0.84 11 0 12
% 0.60/0.84 14 0 4
% 0.60/0.84 tot: 13 33 (71.7% true)
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Model 9 [ 13 0 466 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 That finishes the proof of the theorem.
% 0.60/0.84
% 0.60/0.84 Process 16484 finished Sat Jun 18 18:23:53 2022
%------------------------------------------------------------------------------