TSTP Solution File: GEO258+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO258+1 : TPTP v8.1.0. Bugfixed v6.4.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:19:43 EDT 2022
% Result : Theorem 0.66s 0.88s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO258+1 : TPTP v8.1.0. Bugfixed v6.4.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 06:49:53 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 n010.cluster.edu,
% 0.13/0.37 Sat Jun 18 06:49:53 2022
% 0.13/0.37 The command was "./sos". The process ID is 1163.
% 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=0, symmetry=0, max_lits=10.
% 0.13/0.37
% 0.13/0.37 This is a non-Horn set without equality. The strategy
% 0.13/0.37 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.37 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37 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.13/0.37 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.13/0.37 Following clause subsumed by 36 during input processing: 0 [] {-} -left_apart_point(A,reverse_line(B)).
% 0.13/0.37 Following clause subsumed by 37 during input processing: 0 [] {-} -left_convergent_lines(A,reverse_line(B)).
% 0.13/0.37 Following clause subsumed by 36 during input processing: 0 [unit_del,36,37] {-} -distinct_points(A,B)| -left_apart_point(A,C).
% 0.13/0.37 Following clause subsumed by 36 during input processing: 0 [unit_del,36] {-} -left_apart_point(A,B)|distinct_points(A,C).
% 0.13/0.37 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.13/0.37 Following clause subsumed by 37 during input processing: 0 [unit_del,37] {-} -left_convergent_lines(A,B)|unequally_directed_lines(B,C).
% 0.13/0.37 36 back subsumes 17.
% 0.13/0.37 36 back subsumes 16.
% 0.13/0.37 36 back subsumes 15.
% 0.13/0.37 36 back subsumes 14.
% 0.13/0.37 36 back subsumes 12.
% 0.13/0.37 36 back subsumes 11.
% 0.13/0.37 36 back subsumes 3.
% 0.13/0.37 36 back subsumes 2.
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 50
% 0.19/0.40 number of clauses initially in problem: 51
% 0.19/0.40 percentage of clauses intially in UL: 98
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 20
% 0.19/0.40 distinct predicate count: 12
% 0.19/0.40 distinct function count: 4
% 0.19/0.40 distinct constant count: 4
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.66/0.88
% 0.66/0.88 -------- PROOF --------
% 0.66/0.88 % SZS status Theorem
% 0.66/0.88 % SZS output start Refutation
% 0.66/0.88
% 0.66/0.88 Model 2 (0.00 seconds, 0 Inserts)
% 0.66/0.88
% 0.66/0.88 Stopped by limit on number of solutions
% 0.66/0.88
% 0.66/0.88 Stopped by limit on insertions
% 0.66/0.88
% 0.66/0.88 Model 3 [ 1 1 2871 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 Stopped by limit on insertions
% 0.66/0.88
% 0.66/0.88 Model 4 [ 1 2 5982 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 Stopped by limit on insertions
% 0.66/0.88
% 0.66/0.88 Model 5 [ 2 1 3973 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 Stopped by limit on insertions
% 0.66/0.88
% 0.66/0.88 Model 6 [ 2 1 3396 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 ----> UNIT CONFLICT at 0.49 sec ----> 91 [binary,90.1,52.1] {-} $F.
% 0.66/0.88
% 0.66/0.88 Length of proof is 8. Level of proof is 4.
% 0.66/0.88
% 0.66/0.88 ---------------- PROOF ----------------
% 0.66/0.88 % SZS status Theorem
% 0.66/0.88 % SZS output start Refutation
% 0.66/0.88
% 0.66/0.88 20 [] {+} -between_on_line(A,B,C,D)|before_on_line(A,B,C)|before_on_line(A,D,C).
% 0.66/0.88 21 [] {+} -between_on_line(A,B,C,D)|before_on_line(A,B,C)|before_on_line(A,C,B).
% 0.66/0.88 22 [] {+} -between_on_line(A,B,C,D)|before_on_line(A,C,D)|before_on_line(A,D,C).
% 0.66/0.88 23 [] {+} -between_on_line(A,B,C,D)|before_on_line(A,C,D)|before_on_line(A,C,B).
% 0.66/0.88 24 [] {+} between_on_line(A,B,C,D)| -before_on_line(A,B,C)| -before_on_line(A,C,D).
% 0.66/0.88 25 [] {+} between_on_line(A,B,C,D)| -before_on_line(A,D,C)| -before_on_line(A,C,B).
% 0.66/0.88 52 [] {+} -between_on_line($c4,$c1,$c2,$c3).
% 0.66/0.88 60 [] {-} between_on_line($c4,$c3,$c2,$c1).
% 0.66/0.88 61 [hyper,60,23] {-} before_on_line($c4,$c2,$c1)|before_on_line($c4,$c2,$c3).
% 0.66/0.88 62 [hyper,60,22] {-} before_on_line($c4,$c2,$c1)|before_on_line($c4,$c1,$c2).
% 0.66/0.88 63 [hyper,60,21] {-} before_on_line($c4,$c3,$c2)|before_on_line($c4,$c2,$c3).
% 0.66/0.88 64 [hyper,60,20] {+} before_on_line($c4,$c3,$c2)|before_on_line($c4,$c1,$c2).
% 0.66/0.88 72 [hyper,62,24,61,unit_del,52,factor_simp] {+} before_on_line($c4,$c2,$c1).
% 0.66/0.88 75 [hyper,72,25,63,unit_del,52] {+} before_on_line($c4,$c2,$c3).
% 0.66/0.88 84 [hyper,64,25,72,unit_del,52] {+} before_on_line($c4,$c1,$c2).
% 0.66/0.88 90 [hyper,84,24,75] {-} between_on_line($c4,$c1,$c2,$c3).
% 0.66/0.88 91 [binary,90.1,52.1] {-} $F.
% 0.66/0.88
% 0.66/0.88 % SZS output end Refutation
% 0.66/0.88 ------------ end of proof -------------
% 0.66/0.88
% 0.66/0.88
% 0.66/0.88 Search stopped by max_proofs option.
% 0.66/0.88
% 0.66/0.88
% 0.66/0.88 Search stopped by max_proofs option.
% 0.66/0.88
% 0.66/0.88 ============ end of search ============
% 0.66/0.88
% 0.66/0.88 ----------- soft-scott stats ----------
% 0.66/0.88
% 0.66/0.88 true clauses given 1 (8.3%)
% 0.66/0.88 false clauses given 11
% 0.66/0.88
% 0.66/0.88 FALSE TRUE
% 0.66/0.88 4 1 0
% 0.66/0.88 6 1 1
% 0.66/0.88 9 1 1
% 0.66/0.88 tot: 3 2 (40.0% true)
% 0.66/0.88
% 0.66/0.88
% 0.66/0.88 Model 6 [ 2 1 3396 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.88
% 0.66/0.88 That finishes the proof of the theorem.
% 0.66/0.88
% 0.66/0.88 Process 1163 finished Sat Jun 18 06:49:53 2022
%------------------------------------------------------------------------------