TSTP Solution File: GEO200+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO200+1 : TPTP v8.1.0. Released v3.3.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:04 EDT 2022
% Result : Theorem 0.41s 0.58s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO200+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 15:41:57 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n015.cluster.edu,
% 0.12/0.36 Fri Jun 17 15:41:57 2022
% 0.12/0.36 The command was "./sos". The process ID is 20510.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 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=6.
% 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
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 14
% 0.12/0.39 number of clauses initially in problem: 16
% 0.12/0.39 percentage of clauses intially in UL: 87
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 8
% 0.12/0.39 distinct predicate count: 4
% 0.12/0.39 distinct function count: 2
% 0.12/0.39 distinct constant count: 2
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.41/0.58
% 0.41/0.58 -------- PROOF --------
% 0.41/0.58 % SZS status Theorem
% 0.41/0.58 % SZS output start Refutation
% 0.41/0.58
% 0.41/0.58 Stopped by limit on insertions
% 0.41/0.58
% 0.41/0.58 Model 3 [ 1 1 454 ] (0.00 seconds, 250000 Inserts)
% 0.41/0.58
% 0.41/0.58 ----> UNIT CONFLICT at 0.20 sec ----> 180 [binary,179.1,1.1] {-} $F.
% 0.41/0.58
% 0.41/0.58 Length of proof is 8. Level of proof is 6.
% 0.41/0.58
% 0.41/0.58 ---------------- PROOF ----------------
% 0.41/0.58 % SZS status Theorem
% 0.41/0.58 % SZS output start Refutation
% 0.41/0.58
% 0.41/0.58 1 [] {+} -distinct_points(A,A).
% 0.41/0.58 4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 0.41/0.58 7 [] {+} -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 0.41/0.58 8 [] {+} -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 0.41/0.58 11 [] {+} -distinct_points(A,B)| -distinct_lines(C,D)|apart_point_and_line(A,C)|apart_point_and_line(A,D)|apart_point_and_line(B,C)|apart_point_and_line(B,D).
% 0.41/0.58 15 [] {+} distinct_points($c2,$c1).
% 0.41/0.58 16 [] {-} distinct_lines(line_connecting($c2,$c1),line_connecting($c1,$c2)).
% 0.41/0.58 17 [hyper,15,4] {+} distinct_points($c2,A)|distinct_points($c1,A).
% 0.41/0.58 18 [hyper,16,11,15] {-} apart_point_and_line($c2,line_connecting($c2,$c1))|apart_point_and_line($c2,line_connecting($c1,$c2))|apart_point_and_line($c1,line_connecting($c2,$c1))|apart_point_and_line($c1,line_connecting($c1,$c2)).
% 0.41/0.58 28 [hyper,17,4] {+} distinct_points($c1,A)|distinct_points($c2,B)|distinct_points(A,B).
% 0.41/0.58 36 [hyper,18,7,17,unit_del,1] {-} apart_point_and_line($c2,line_connecting($c1,$c2))|apart_point_and_line($c1,line_connecting($c2,$c1))|apart_point_and_line($c1,line_connecting($c1,$c2)).
% 0.41/0.58 97 [hyper,28,1] {+} distinct_points($c1,A)|distinct_points(A,$c2).
% 0.41/0.58 158 [hyper,36,8,97,unit_del,1] {-} apart_point_and_line($c1,line_connecting($c2,$c1))|apart_point_and_line($c1,line_connecting($c1,$c2)).
% 0.41/0.58 169 [hyper,158,8,17,unit_del,1] {+} apart_point_and_line($c1,line_connecting($c1,$c2)).
% 0.41/0.58 179 [hyper,169,7,97] {-} distinct_points($c1,$c1).
% 0.41/0.58 180 [binary,179.1,1.1] {-} $F.
% 0.41/0.58
% 0.41/0.58 % SZS output end Refutation
% 0.41/0.58 ------------ end of proof -------------
% 0.41/0.58
% 0.41/0.58
% 0.41/0.58 Search stopped by max_proofs option.
% 0.41/0.58
% 0.41/0.58
% 0.41/0.58 Search stopped by max_proofs option.
% 0.41/0.58
% 0.41/0.58 ============ end of search ============
% 0.41/0.58
% 0.41/0.58 ----------- soft-scott stats ----------
% 0.41/0.58
% 0.41/0.58 true clauses given 4 (18.2%)
% 0.41/0.58 false clauses given 18
% 0.41/0.58
% 0.41/0.58 FALSE TRUE
% 0.41/0.58 5 0 1
% 0.41/0.58 6 1 0
% 0.41/0.58 9 2 0
% 0.41/0.58 12 3 0
% 0.41/0.58 16 8 0
% 0.41/0.58 22 0 3
% 0.41/0.58 24 0 4
% 0.41/0.58 25 0 9
% 0.41/0.58 26 0 3
% 0.41/0.58 27 0 14
% 0.41/0.58 28 0 9
% 0.41/0.58 30 0 12
% 0.41/0.58 42 0 3
% 0.41/0.58 tot: 14 58 (80.6% true)
% 0.41/0.58
% 0.41/0.58
% 0.41/0.58 Model 3 [ 1 1 454 ] (0.00 seconds, 250000 Inserts)
% 0.41/0.58
% 0.41/0.58 That finishes the proof of the theorem.
% 0.41/0.58
% 0.41/0.58 Process 20510 finished Fri Jun 17 15:41:57 2022
%------------------------------------------------------------------------------