TSTP Solution File: GEO233+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO233+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:29 EDT 2022
% Result : Theorem 1.15s 1.34s
% Output : Refutation 1.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO233+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n004.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 : Fri Jun 17 17:27:38 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 n004.cluster.edu,
% 0.13/0.36 Fri Jun 17 17:27:38 2022
% 0.13/0.36 The command was "./sos". The process ID is 29845.
% 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 67 during input processing: 0 [copy,67,flip.1] {-} equally_directed_lines(A,A).
% 0.13/0.36 71 back subsumes 49.
% 0.13/0.36 71 back subsumes 48.
% 0.13/0.36 71 back subsumes 47.
% 0.13/0.36 71 back subsumes 46.
% 0.13/0.36 71 back subsumes 9.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.44/0.62
% 0.44/0.62 Model 1 (0.00 seconds, 0 Inserts)
% 0.44/0.62
% 0.44/0.62 Stopped by limit on number of solutions
% 0.44/0.62
% 0.44/0.62
% 0.44/0.62 -------------- Softie stats --------------
% 0.44/0.62
% 0.44/0.62 UPDATE_STOP: 300
% 0.44/0.62 SFINDER_TIME_LIMIT: 2
% 0.44/0.62 SHORT_CLAUSE_CUTOFF: 4
% 0.44/0.62 number of clauses in intial UL: 50
% 0.44/0.62 number of clauses initially in problem: 57
% 0.44/0.62 percentage of clauses intially in UL: 87
% 0.44/0.62 percentage of distinct symbols occuring in initial UL: 95
% 0.44/0.62 percent of all initial clauses that are short: 100
% 0.44/0.62 absolute distinct symbol count: 23
% 0.44/0.62 distinct predicate count: 18
% 0.44/0.62 distinct function count: 4
% 0.44/0.62 distinct constant count: 1
% 0.44/0.62
% 0.44/0.62 ---------- no more Softie stats ----------
% 0.44/0.62
% 0.44/0.62
% 0.44/0.62
% 0.44/0.62 Stopped by limit on insertions
% 0.44/0.62
% 0.44/0.62 =========== start of search ===========
% 1.15/1.34
% 1.15/1.34 -------- PROOF --------
% 1.15/1.34 % SZS status Theorem
% 1.15/1.34 % SZS output start Refutation
% 1.15/1.34
% 1.15/1.34 Stopped by limit on insertions
% 1.15/1.34
% 1.15/1.34 Model 2 [ 1 0 1065 ] (0.00 seconds, 250000 Inserts)
% 1.15/1.34
% 1.15/1.34 Stopped by limit on insertions
% 1.15/1.34
% 1.15/1.34 Model 3 [ 2 1 2616 ] (0.00 seconds, 250000 Inserts)
% 1.15/1.34
% 1.15/1.34 Stopped by limit on insertions
% 1.15/1.34
% 1.15/1.34 Stopped by limit on insertions
% 1.15/1.34
% 1.15/1.34 Model 4 [ 2 1 3659 ] (0.00 seconds, 250000 Inserts)
% 1.15/1.34
% 1.15/1.34 Stopped by limit on insertions
% 1.15/1.34
% 1.15/1.34 ----> UNIT CONFLICT at 0.95 sec ----> 196 [binary,194.1,56.1] {-} $F.
% 1.15/1.34
% 1.15/1.34 Length of proof is 4. Level of proof is 3.
% 1.15/1.34
% 1.15/1.34 ---------------- PROOF ----------------
% 1.15/1.34 % SZS status Theorem
% 1.15/1.34 % SZS output start Refutation
% 1.15/1.34
% 1.15/1.34 36 [] {+} -unequally_directed_lines(A,B)|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 1.15/1.34 39 [] {+} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|left_convergent_lines(A,B)|left_convergent_lines(A,reverse_line(B)).
% 1.15/1.34 41 [] {+} -left_convergent_lines(A,B).
% 1.15/1.34 56 [] {+} -equally_directed_lines(reverse_line(reverse_line($c1)),$c1).
% 1.15/1.34 63 [factor,36.2.3] {+} -unequally_directed_lines(A,A)|unequally_directed_lines(A,B).
% 1.15/1.34 65 [] {-} equally_directed_lines(A,B)|unequally_directed_lines(A,B).
% 1.15/1.34 68 [] {+} unequally_directed_lines(A,B)|unequally_directed_lines(A,reverse_line(B)).
% 1.15/1.34 70,69 [] {-} equally_directed_lines(parallel_through_point(A,B),A).
% 1.15/1.34 99 [para_into,69.1.1,65.1.1,demod,70] {-} equally_directed_lines(A,B)|unequally_directed_lines(B,A).
% 1.15/1.34 125 [hyper,68,63,factor_simp] {+} unequally_directed_lines(A,reverse_line(A)).
% 1.15/1.34 194 [hyper,125,39,99,unit_del,41,41] {-} equally_directed_lines(reverse_line(reverse_line(A)),A).
% 1.15/1.34 196 [binary,194.1,56.1] {-} $F.
% 1.15/1.34
% 1.15/1.34 % SZS output end Refutation
% 1.15/1.34 ------------ end of proof -------------
% 1.15/1.34
% 1.15/1.34
% 1.15/1.34 Search stopped by max_proofs option.
% 1.15/1.34
% 1.15/1.34
% 1.15/1.34 Search stopped by max_proofs option.
% 1.15/1.34
% 1.15/1.34 ============ end of search ============
% 1.15/1.34
% 1.15/1.34 ----------- soft-scott stats ----------
% 1.15/1.34
% 1.15/1.34 true clauses given 2 (22.2%)
% 1.15/1.34 false clauses given 7
% 1.15/1.34
% 1.15/1.34 FALSE TRUE
% 1.15/1.34 4 0 1
% 1.15/1.34 6 2 1
% 1.15/1.34 7 11 13
% 1.15/1.34 8 6 16
% 1.15/1.34 9 2 2
% 1.15/1.34 10 8 9
% 1.15/1.34 11 0 5
% 1.15/1.34 12 0 3
% 1.15/1.34 13 0 2
% 1.15/1.34 14 0 12
% 1.15/1.34 16 0 4
% 1.15/1.34 17 0 8
% 1.15/1.34 18 0 4
% 1.15/1.34 tot: 29 80 (73.4% true)
% 1.15/1.34
% 1.15/1.34
% 1.15/1.34 Model 4 [ 2 -17 3659 ] (0.00 seconds, 250000 Inserts)
% 1.15/1.34
% 1.15/1.34 That finishes the proof of the theorem.
% 1.15/1.34
% 1.15/1.34 Process 29845 finished Fri Jun 17 17:27:39 2022
%------------------------------------------------------------------------------