TSTP Solution File: GEO255+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO255+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:41 EDT 2022
% Result : Theorem 0.19s 0.59s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO255+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n014.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.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 16:08:34 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n014.cluster.edu,
% 0.12/0.35 Sat Jun 18 16:08:34 2022
% 0.12/0.35 The command was "./sos". The process ID is 18243.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 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=0, symmetry=0, max_lits=10.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 31 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.12/0.36 Following clause subsumed by 31 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.12/0.36 Following clause subsumed by 36 during input processing: 0 [] {-} -left_apart_point(A,reverse_line(B)).
% 0.12/0.36 Following clause subsumed by 37 during input processing: 0 [] {-} -left_convergent_lines(A,reverse_line(B)).
% 0.12/0.36 Following clause subsumed by 36 during input processing: 0 [unit_del,36,37] {-} -distinct_points(A,B)| -left_apart_point(A,C).
% 0.12/0.36 Following clause subsumed by 36 during input processing: 0 [unit_del,36] {-} -left_apart_point(A,B)|distinct_points(A,C).
% 0.12/0.36 Following clause subsumed by 36 during input processing: 0 [unit_del,36] {-} -left_apart_point(A,B)| -unequally_directed_lines(B,C)|distinct_lines(B,C).
% 0.12/0.36 Following clause subsumed by 37 during input processing: 0 [unit_del,37] {-} -left_convergent_lines(A,B)|unequally_directed_lines(B,C).
% 0.12/0.36 36 back subsumes 17.
% 0.12/0.36 36 back subsumes 16.
% 0.12/0.36 36 back subsumes 15.
% 0.12/0.36 36 back subsumes 14.
% 0.12/0.36 36 back subsumes 12.
% 0.12/0.36 36 back subsumes 11.
% 0.12/0.36 36 back subsumes 3.
% 0.12/0.36 36 back subsumes 2.
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.41
% 0.19/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 -------------- Softie stats --------------
% 0.19/0.41
% 0.19/0.41 UPDATE_STOP: 300
% 0.19/0.41 SFINDER_TIME_LIMIT: 2
% 0.19/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.41 number of clauses in intial UL: 49
% 0.19/0.41 number of clauses initially in problem: 53
% 0.19/0.41 percentage of clauses intially in UL: 92
% 0.19/0.41 percentage of distinct symbols occuring in initial UL: 84
% 0.19/0.41 percent of all initial clauses that are short: 100
% 0.19/0.41 absolute distinct symbol count: 19
% 0.19/0.41 distinct predicate count: 12
% 0.19/0.41 distinct function count: 4
% 0.19/0.41 distinct constant count: 3
% 0.19/0.41
% 0.19/0.41 ---------- no more Softie stats ----------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 =========== start of search ===========
% 0.19/0.59
% 0.19/0.59 -------- PROOF --------
% 0.19/0.59 % SZS status Theorem
% 0.19/0.59 % SZS output start Refutation
% 0.19/0.59
% 0.19/0.59 ----> UNIT CONFLICT at 0.21 sec ----> 239 [binary,238.1,48.1] {-} $F.
% 0.19/0.59
% 0.19/0.59 Length of proof is 11. Level of proof is 9.
% 0.19/0.59
% 0.19/0.59 ---------------- PROOF ----------------
% 0.19/0.59 % SZS status Theorem
% 0.19/0.59 % SZS output start Refutation
% 0.19/0.59
% 0.19/0.59 30 [] {+} -unequally_directed_lines(A,A).
% 0.19/0.59 31 [] {+} -unequally_directed_lines(A,B)|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 0.19/0.59 34 [] {+} -line(A)| -line(B)|unequally_directed_lines(A,B)|unequally_directed_lines(A,reverse_line(B)).
% 0.19/0.59 35 [] {+} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|left_convergent_lines(A,B)|left_convergent_lines(A,reverse_line(B)).
% 0.19/0.59 37 [] {+} -left_convergent_lines(A,B).
% 0.19/0.59 48 [] {+} -unequally_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A))).
% 0.19/0.59 58 [factor,34.1.2,unit_del,30] {+} -line(A)|unequally_directed_lines(A,reverse_line(A)).
% 0.19/0.59 59 [] {-} line($c3).
% 0.19/0.59 63 [hyper,59,58] {-} unequally_directed_lines($c3,reverse_line($c3)).
% 0.19/0.59 68 [hyper,63,31] {-} unequally_directed_lines($c3,A)|unequally_directed_lines(reverse_line($c3),A).
% 0.19/0.59 90 [hyper,68,35,68,unit_del,37,37] {-} unequally_directed_lines($c3,reverse_line(A))|unequally_directed_lines($c3,A).
% 0.19/0.59 119 [hyper,90,31] {-} unequally_directed_lines($c3,A)|unequally_directed_lines($c3,B)|unequally_directed_lines(reverse_line(A),B).
% 0.19/0.59 125 [hyper,90,31] {-} unequally_directed_lines($c3,reverse_line(A))|unequally_directed_lines($c3,B)|unequally_directed_lines(A,B).
% 0.19/0.59 126 [factor,119.1.2] {-} unequally_directed_lines($c3,A)|unequally_directed_lines(reverse_line(A),A).
% 0.19/0.59 127 [factor,125.1.2] {-} unequally_directed_lines($c3,reverse_line(A))|unequally_directed_lines(A,reverse_line(A)).
% 0.19/0.59 179 [hyper,127,35,126,unit_del,37,37] {-} unequally_directed_lines(A,reverse_line(A))|unequally_directed_lines(reverse_line(A),A).
% 0.19/0.59 236 [hyper,179,31] {-} unequally_directed_lines(A,reverse_line(A))|unequally_directed_lines(reverse_line(A),B)|unequally_directed_lines(A,B).
% 0.19/0.59 238 [factor,236.1.3,unit_del,30] {-} unequally_directed_lines(A,reverse_line(A)).
% 0.19/0.59 239 [binary,238.1,48.1] {-} $F.
% 0.19/0.59
% 0.19/0.59 % SZS output end Refutation
% 0.19/0.59 ------------ end of proof -------------
% 0.19/0.59
% 0.19/0.59
% 0.19/0.59 Search stopped by max_proofs option.
% 0.19/0.59
% 0.19/0.59
% 0.19/0.59 Search stopped by max_proofs option.
% 0.19/0.59
% 0.19/0.59 ============ end of search ============
% 0.19/0.59
% 0.19/0.59 ----------- soft-scott stats ----------
% 0.19/0.59
% 0.19/0.59 true clauses given 9 (19.1%)
% 0.19/0.59 false clauses given 38
% 0.19/0.59
% 0.19/0.59 FALSE TRUE
% 0.19/0.59 8 8 1
% 0.19/0.59 9 17 3
% 0.19/0.59 10 24 0
% 0.19/0.59 11 16 0
% 0.19/0.59 12 10 3
% 0.19/0.59 13 1 1
% 0.19/0.59 14 4 0
% 0.19/0.59 15 1 0
% 0.19/0.59 16 4 0
% 0.19/0.59 17 2 0
% 0.19/0.59 19 2 0
% 0.19/0.59 21 2 0
% 0.19/0.59 23 2 0
% 0.19/0.59 25 2 0
% 0.19/0.59 27 1 0
% 0.19/0.59 tot: 96 8 (7.7% true)
% 0.19/0.59
% 0.19/0.59
% 0.19/0.59 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.59
% 0.19/0.59 That finishes the proof of the theorem.
% 0.19/0.59
% 0.19/0.59 Process 18243 finished Sat Jun 18 16:08:34 2022
%------------------------------------------------------------------------------