TSTP Solution File: GEO183+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO183+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:49 EDT 2022
% Result : Theorem 0.70s 0.89s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14 % Problem : GEO183+3 : TPTP v8.1.0. Released v4.0.0.
% 0.14/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n006.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 : Sat Jun 18 12:41:10 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.39 ----- Otter 3.2, August 2001 -----
% 0.14/0.39 The process was started by sandbox on n006.cluster.edu,
% 0.14/0.39 Sat Jun 18 12:41:10 2022
% 0.14/0.39 The command was "./sos". The process ID is 17031.
% 0.14/0.39
% 0.14/0.39 set(prolog_style_variables).
% 0.14/0.39 set(auto).
% 0.14/0.39 dependent: set(auto1).
% 0.14/0.39 dependent: set(process_input).
% 0.14/0.39 dependent: clear(print_kept).
% 0.14/0.39 dependent: clear(print_new_demod).
% 0.14/0.39 dependent: clear(print_back_demod).
% 0.14/0.39 dependent: clear(print_back_sub).
% 0.14/0.39 dependent: set(control_memory).
% 0.14/0.39 dependent: assign(max_mem, 12000).
% 0.14/0.39 dependent: assign(pick_given_ratio, 4).
% 0.14/0.39 dependent: assign(stats_level, 1).
% 0.14/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.39 dependent: assign(sos_limit, 5000).
% 0.14/0.39 dependent: assign(max_weight, 60).
% 0.14/0.39 clear(print_given).
% 0.14/0.39
% 0.14/0.39 formula_list(usable).
% 0.14/0.39
% 0.14/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.14/0.39
% 0.14/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.39 clauses in usable.
% 0.14/0.39
% 0.14/0.39 dependent: set(knuth_bendix).
% 0.14/0.39 dependent: set(para_from).
% 0.14/0.39 dependent: set(para_into).
% 0.14/0.39 dependent: clear(para_from_right).
% 0.14/0.39 dependent: clear(para_into_right).
% 0.14/0.39 dependent: set(para_from_vars).
% 0.14/0.39 dependent: set(eq_units_both_ways).
% 0.14/0.39 dependent: set(dynamic_demod_all).
% 0.14/0.39 dependent: set(dynamic_demod).
% 0.14/0.39 dependent: set(order_eq).
% 0.14/0.39 dependent: set(back_demod).
% 0.14/0.39 dependent: set(lrpo).
% 0.14/0.39 dependent: set(hyper_res).
% 0.14/0.39 dependent: set(unit_deletion).
% 0.14/0.39 dependent: set(factor).
% 0.14/0.39
% 0.14/0.39 ------------> process usable:
% 0.14/0.39 Following clause subsumed by 15 during input processing: 0 [] {-} -distinct_lines(A,B)|apart_point_and_line(C,A)|apart_point_and_line(C,B)|convergent_lines(A,B).
% 0.14/0.39 Following clause subsumed by 6 during input processing: 0 [] {-} -convergent_lines(A,B)| -unorthogonal_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.14/0.39 28 back subsumes 27.
% 0.14/0.39
% 0.14/0.39 ------------> process sos:
% 0.14/0.39 Following clause subsumed by 39 during input processing: 0 [] {-} convergent_lines(A,B)|unorthogonal_lines(A,B).
% 0.14/0.39
% 0.14/0.39 ======= end of input processing =======
% 0.14/0.43
% 0.14/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.43
% 0.14/0.43 Stopped by limit on number of solutions
% 0.14/0.43
% 0.14/0.43
% 0.14/0.43 -------------- Softie stats --------------
% 0.14/0.43
% 0.14/0.43 UPDATE_STOP: 300
% 0.14/0.43 SFINDER_TIME_LIMIT: 2
% 0.14/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.43 number of clauses in intial UL: 37
% 0.14/0.43 number of clauses initially in problem: 47
% 0.14/0.43 percentage of clauses intially in UL: 78
% 0.14/0.43 percentage of distinct symbols occuring in initial UL: 95
% 0.14/0.43 percent of all initial clauses that are short: 100
% 0.14/0.43 absolute distinct symbol count: 20
% 0.14/0.43 distinct predicate count: 12
% 0.14/0.43 distinct function count: 4
% 0.14/0.43 distinct constant count: 4
% 0.14/0.43
% 0.14/0.43 ---------- no more Softie stats ----------
% 0.14/0.43
% 0.14/0.43
% 0.14/0.43
% 0.14/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.43
% 0.14/0.43 Stopped by limit on number of solutions
% 0.14/0.43
% 0.14/0.43 =========== start of search ===========
% 0.70/0.89
% 0.70/0.89 -------- PROOF --------
% 0.70/0.89 % SZS status Theorem
% 0.70/0.89 % SZS output start Refutation
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 3 [ 3 1 157 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 4 [ 5 1 840 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 5 [ 4 1 269 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 6 [ 4 0 219 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 7 [ 2 0 1157 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 8 [ 13 0 896 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 Stopped by limit on insertions
% 0.70/0.89
% 0.70/0.89 Model 9 [ 1 0 338 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 -----> EMPTY CLAUSE at 0.48 sec ----> 115 [hyper,43,38,43,unit_del,57,58] {-} $F.
% 0.70/0.89
% 0.70/0.89 Length of proof is 3. Level of proof is 2.
% 0.70/0.89
% 0.70/0.89 ---------------- PROOF ----------------
% 0.70/0.89 % SZS status Theorem
% 0.70/0.89 % SZS output start Refutation
% 0.70/0.89
% 0.70/0.89 7 [] {+} -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 0.70/0.89 8 [] {+} -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 0.70/0.89 38 [] {+} -incident_point_and_line($c4,$c2)| -incident_point_and_line($c3,$c2).
% 0.70/0.89 43 [] {-} incident_point_and_line(A,B)|apart_point_and_line(A,B).
% 0.70/0.89 45 [] {+} distinct_points($c4,$c3).
% 0.70/0.89 47 [] {-} equal_lines($c2,line_connecting($c4,$c3)).
% 0.70/0.89 48 [copy,47,flip.1] {-} equal_lines(line_connecting($c4,$c3),$c2).
% 0.70/0.89 57 [para_from,48.1.1,8.2.2,unit_del,45] {+} -apart_point_and_line($c3,$c2).
% 0.70/0.89 58 [para_from,48.1.1,7.2.2,unit_del,45] {+} -apart_point_and_line($c4,$c2).
% 0.70/0.89 115 [hyper,43,38,43,unit_del,57,58] {-} $F.
% 0.70/0.89
% 0.70/0.89 % SZS output end Refutation
% 0.70/0.89 ------------ end of proof -------------
% 0.70/0.89
% 0.70/0.89
% 0.70/0.89 Search stopped by max_proofs option.
% 0.70/0.89
% 0.70/0.89
% 0.70/0.89 Search stopped by max_proofs option.
% 0.70/0.89
% 0.70/0.89 ============ end of search ============
% 0.70/0.89
% 0.70/0.89 ----------- soft-scott stats ----------
% 0.70/0.89
% 0.70/0.89 true clauses given 1 (9.1%)
% 0.70/0.89 false clauses given 10
% 0.70/0.89
% 0.70/0.89 FALSE TRUE
% 0.70/0.89 3 0 1
% 0.70/0.89 6 8 13
% 0.70/0.89 8 5 12
% 0.70/0.89 9 0 8
% 0.70/0.89 11 4 8
% 0.70/0.89 14 2 2
% 0.70/0.89 tot: 19 44 (69.8% true)
% 0.70/0.89
% 0.70/0.89
% 0.70/0.89 Model 9 [ 1 -4 338 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.89
% 0.70/0.89 That finishes the proof of the theorem.
% 0.70/0.89
% 0.70/0.89 Process 17031 finished Sat Jun 18 12:41:11 2022
%------------------------------------------------------------------------------