TSTP Solution File: GEO238+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO238+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:32 EDT 2022
% Result : Theorem 0.18s 0.43s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO238+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jun 17 18:09:27 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 n015.cluster.edu,
% 0.13/0.36 Fri Jun 17 18:09:27 2022
% 0.13/0.36 The command was "./sos". The process ID is 19719.
% 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=10.
% 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 36 during input processing: 0 [] {-} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 0.13/0.36 Following clause subsumed by 36 during input processing: 0 [] {-} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(A,reverse_line(C))|unequally_directed_lines(B,reverse_line(C)).
% 0.13/0.36 Following clause subsumed by 40 during input processing: 0 [] {-} -left_apart_point(A,reverse_line(B)).
% 0.13/0.36 Following clause subsumed by 41 during input processing: 0 [] {-} -left_convergent_lines(A,reverse_line(B)).
% 0.13/0.36 Following clause subsumed by 40 during input processing: 0 [unit_del,40,41] {-} -distinct_points(A,B)| -left_apart_point(A,C).
% 0.13/0.36 Following clause subsumed by 40 during input processing: 0 [unit_del,40] {-} -left_apart_point(A,B)|distinct_points(A,C).
% 0.13/0.36 Following clause subsumed by 40 during input processing: 0 [unit_del,40] {-} -left_apart_point(A,B)| -unequally_directed_lines(B,C)|distinct_lines(B,C).
% 0.13/0.36 Following clause subsumed by 41 during input processing: 0 [unit_del,41] {-} -left_convergent_lines(A,B)|unequally_directed_lines(B,C).
% 0.13/0.36 40 back subsumes 20.
% 0.13/0.36 40 back subsumes 19.
% 0.13/0.36 40 back subsumes 10.
% 0.13/0.36 40 back subsumes 4.
% 0.13/0.36 41 back subsumes 6.
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 66 during input processing: 0 [copy,66,flip.1] {-} equally_directed_lines(A,A).
% 0.13/0.36 73 back subsumes 49.
% 0.13/0.36 73 back subsumes 48.
% 0.13/0.36 73 back subsumes 47.
% 0.13/0.36 73 back subsumes 46.
% 0.13/0.36 73 back subsumes 9.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.18/0.41
% 0.18/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 -------------- Softie stats --------------
% 0.18/0.41
% 0.18/0.41 UPDATE_STOP: 300
% 0.18/0.41 SFINDER_TIME_LIMIT: 2
% 0.18/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.41 number of clauses in intial UL: 49
% 0.18/0.41 number of clauses initially in problem: 59
% 0.18/0.41 percentage of clauses intially in UL: 83
% 0.18/0.41 percentage of distinct symbols occuring in initial UL: 80
% 0.18/0.41 percent of all initial clauses that are short: 100
% 0.18/0.41 absolute distinct symbol count: 26
% 0.18/0.41 distinct predicate count: 18
% 0.18/0.41 distinct function count: 4
% 0.18/0.41 distinct constant count: 4
% 0.18/0.41
% 0.18/0.41 ---------- no more Softie stats ----------
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41 =========== start of search ===========
% 0.18/0.43
% 0.18/0.43 -------- PROOF --------
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 % SZS output start Refutation
% 0.18/0.43
% 0.18/0.43 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.43
% 0.18/0.43 Stopped by limit on number of solutions
% 0.18/0.43
% 0.18/0.43 -----> EMPTY CLAUSE at 0.05 sec ----> 99 [hyper,70,16,unit_del,40,40] {-} $F.
% 0.18/0.43
% 0.18/0.43 Length of proof is 0. Level of proof is 0.
% 0.18/0.43
% 0.18/0.43 ---------------- PROOF ----------------
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 % SZS output start Refutation
% 0.18/0.43
% 0.18/0.43 16 [] {+} -divides_points(A,B,C)|left_apart_point(B,A)|left_apart_point(C,A).
% 0.18/0.43 40 [] {+} -left_apart_point(A,B).
% 0.18/0.43 70 [] {-} divides_points($c1,$c4,$c3).
% 0.18/0.43 99 [hyper,70,16,unit_del,40,40] {-} $F.
% 0.18/0.43
% 0.18/0.43 % SZS output end Refutation
% 0.18/0.43 ------------ end of proof -------------
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Search stopped by max_proofs option.
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Search stopped by max_proofs option.
% 0.18/0.43
% 0.18/0.43 ============ end of search ============
% 0.18/0.43
% 0.18/0.43 ----------- soft-scott stats ----------
% 0.18/0.43
% 0.18/0.43 true clauses given 0 (0.0%)
% 0.18/0.43 false clauses given 3
% 0.18/0.43
% 0.18/0.43 FALSE TRUE
% 0.18/0.43 3 0 1
% 0.18/0.43 4 2 0
% 0.18/0.43 5 1 0
% 0.18/0.43 6 1 0
% 0.18/0.43 7 0 7
% 0.18/0.43 8 0 2
% 0.18/0.43 9 0 1
% 0.18/0.43 10 0 3
% 0.18/0.43 11 0 1
% 0.18/0.43 14 0 3
% 0.18/0.43 16 0 3
% 0.18/0.43 17 0 2
% 0.18/0.43 18 0 1
% 0.18/0.43 tot: 4 24 (85.7% true)
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.43
% 0.18/0.43 That finishes the proof of the theorem.
% 0.18/0.43
% 0.18/0.43 Process 19719 finished Fri Jun 17 18:09:27 2022
%------------------------------------------------------------------------------