TSTP Solution File: GEO179+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO179+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:18:45 EDT 2022
% Result : Theorem 0.39s 0.60s
% Output : Refutation 0.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GEO179+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Fri Jun 17 15:30:07 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox on n011.cluster.edu,
% 0.14/0.38 Fri Jun 17 15:30:07 2022
% 0.14/0.38 The command was "./sos". The process ID is 11026.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 formula_list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.14/0.38
% 0.14/0.38 This is a non-Horn set without equality. The strategy
% 0.14/0.38 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.38 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: set(factor).
% 0.14/0.38 dependent: set(unit_deletion).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.14/0.42
% 0.14/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.42
% 0.14/0.42 Stopped by limit on number of solutions
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42 -------------- Softie stats --------------
% 0.14/0.42
% 0.14/0.42 UPDATE_STOP: 300
% 0.14/0.42 SFINDER_TIME_LIMIT: 2
% 0.14/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.42 number of clauses in intial UL: 15
% 0.14/0.42 number of clauses initially in problem: 17
% 0.14/0.42 percentage of clauses intially in UL: 88
% 0.14/0.42 percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.42 percent of all initial clauses that are short: 100
% 0.14/0.42 absolute distinct symbol count: 9
% 0.14/0.42 distinct predicate count: 4
% 0.14/0.42 distinct function count: 2
% 0.14/0.42 distinct constant count: 3
% 0.14/0.42
% 0.14/0.42 ---------- no more Softie stats ----------
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.42
% 0.14/0.42 Stopped by limit on number of solutions
% 0.14/0.42
% 0.14/0.42 =========== start of search ===========
% 0.39/0.60
% 0.39/0.60 -------- PROOF --------
% 0.39/0.60 % SZS status Theorem
% 0.39/0.60 % SZS output start Refutation
% 0.39/0.60
% 0.39/0.60 Model 3 (0.00 seconds, 0 Inserts)
% 0.39/0.60
% 0.39/0.60 Stopped by limit on number of solutions
% 0.39/0.60
% 0.39/0.60 Stopped by limit on insertions
% 0.39/0.60
% 0.39/0.60 Model 4 [ 1 0 470 ] (0.00 seconds, 250000 Inserts)
% 0.39/0.60
% 0.39/0.60 ----> UNIT CONFLICT at 0.19 sec ----> 50 [binary,49.1,1.1] {+} $F.
% 0.39/0.60
% 0.39/0.60 Length of proof is 8. Level of proof is 6.
% 0.39/0.60
% 0.39/0.60 ---------------- PROOF ----------------
% 0.39/0.60 % SZS status Theorem
% 0.39/0.60 % SZS output start Refutation
% 0.39/0.60
% 0.39/0.60 1 [] {+} -distinct_points(A,A).
% 0.39/0.60 4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 0.39/0.60 7 [] {+} -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 0.39/0.60 8 [] {+} -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 0.39/0.60 12 [] {+} -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 0.39/0.60 13 [] {+} -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 0.39/0.60 15 [] {+} -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c3))| -distinct_lines(line_connecting($c3,$c2),line_connecting($c1,$c2)).
% 0.39/0.60 16 [] {+} distinct_points($c3,$c2).
% 0.39/0.60 17 [] {-} apart_point_and_line($c1,line_connecting($c3,$c2)).
% 0.39/0.60 18 [hyper,16,4] {+} distinct_points($c3,A)|distinct_points($c2,A).
% 0.39/0.60 19 [hyper,17,13] {-} distinct_lines(line_connecting($c3,$c2),A)|apart_point_and_line($c1,A).
% 0.39/0.60 20 [hyper,17,12] {-} distinct_points($c1,A)|apart_point_and_line(A,line_connecting($c3,$c2)).
% 0.39/0.60 21 [hyper,19,15,19] {-} apart_point_and_line($c1,line_connecting($c1,$c2))|apart_point_and_line($c1,line_connecting($c1,$c3)).
% 0.39/0.60 32 [hyper,21,7,20] {-} apart_point_and_line($c1,line_connecting($c1,$c3))|apart_point_and_line($c2,line_connecting($c3,$c2)).
% 0.39/0.60 43 [hyper,32,8,18,unit_del,1] {+} apart_point_and_line($c1,line_connecting($c1,$c3)).
% 0.39/0.60 46 [hyper,43,7,20] {+} apart_point_and_line($c3,line_connecting($c3,$c2)).
% 0.39/0.60 49 [hyper,46,7,18] {-} distinct_points($c2,$c2).
% 0.39/0.60 50 [binary,49.1,1.1] {+} $F.
% 0.39/0.60
% 0.39/0.60 % SZS output end Refutation
% 0.39/0.60 ------------ end of proof -------------
% 0.39/0.60
% 0.39/0.60
% 0.39/0.60 Search stopped by max_proofs option.
% 0.39/0.60
% 0.39/0.60
% 0.39/0.60 Search stopped by max_proofs option.
% 0.39/0.60
% 0.39/0.60 ============ end of search ============
% 0.39/0.60
% 0.39/0.60 ----------- soft-scott stats ----------
% 0.39/0.60
% 0.39/0.60 true clauses given 2 (20.0%)
% 0.39/0.60 false clauses given 8
% 0.39/0.60
% 0.39/0.60 FALSE TRUE
% 0.39/0.60 8 0 2
% 0.39/0.60 9 2 0
% 0.39/0.60 11 0 2
% 0.39/0.60 22 0 1
% 0.39/0.60 tot: 2 5 (71.4% true)
% 0.39/0.60
% 0.39/0.60
% 0.39/0.60 Model 4 [ 1 0 470 ] (0.00 seconds, 250000 Inserts)
% 0.39/0.60
% 0.39/0.60 That finishes the proof of the theorem.
% 0.39/0.60
% 0.39/0.60 Process 11026 finished Fri Jun 17 15:30:07 2022
%------------------------------------------------------------------------------