TSTP Solution File: GEO178+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO178+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO178+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n024.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 21:57:17 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 sandbox2 on n024.cluster.edu,
% 0.13/0.36 Fri Jun 17 21:57:17 2022
% 0.13/0.36 The command was "./sos". The process ID is 1845.
% 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=0, symmetry=0, max_lits=6.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 15
% 0.20/0.39 number of clauses initially in problem: 17
% 0.20/0.39 percentage of clauses intially in UL: 88
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 9
% 0.20/0.39 distinct predicate count: 4
% 0.20/0.39 distinct function count: 2
% 0.20/0.39 distinct constant count: 3
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 0.20/0.49
% 0.20/0.49 -------- PROOF --------
% 0.20/0.49 % SZS status Theorem
% 0.20/0.49 % SZS output start Refutation
% 0.20/0.49
% 0.20/0.49 Stopped by limit on insertions
% 0.20/0.49
% 0.20/0.49 Model 3 [ 1 0 76 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.49
% 0.20/0.49 ----> UNIT CONFLICT at 0.11 sec ----> 47 [binary,46.1,1.1] {+} $F.
% 0.20/0.49
% 0.20/0.49 Length of proof is 5. Level of proof is 4.
% 0.20/0.49
% 0.20/0.49 ---------------- PROOF ----------------
% 0.20/0.49 % SZS status Theorem
% 0.20/0.49 % SZS output start Refutation
% 0.20/0.49
% 0.20/0.49 1 [] {+} -distinct_points(A,A).
% 0.20/0.49 4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 0.20/0.49 7 [] {+} -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 0.20/0.49 8 [] {+} -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 0.20/0.49 12 [] {+} -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 0.20/0.49 15 [] {+} -distinct_points($c1,$c3)| -distinct_points($c1,$c2).
% 0.20/0.49 16 [] {+} distinct_points($c3,$c2).
% 0.20/0.49 17 [] {-} apart_point_and_line($c1,line_connecting($c3,$c2)).
% 0.20/0.49 18 [hyper,16,4] {+} distinct_points($c3,A)|distinct_points($c2,A).
% 0.20/0.49 20 [hyper,17,12] {-} distinct_points($c1,A)|apart_point_and_line(A,line_connecting($c3,$c2)).
% 0.20/0.49 23 [hyper,20,15,20] {-} apart_point_and_line($c2,line_connecting($c3,$c2))|apart_point_and_line($c3,line_connecting($c3,$c2)).
% 0.20/0.49 40 [hyper,23,8,18,unit_del,1] {+} apart_point_and_line($c3,line_connecting($c3,$c2)).
% 0.20/0.49 46 [hyper,40,7,18] {-} distinct_points($c2,$c2).
% 0.20/0.49 47 [binary,46.1,1.1] {+} $F.
% 0.20/0.49
% 0.20/0.49 % SZS output end Refutation
% 0.20/0.49 ------------ end of proof -------------
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Search stopped by max_proofs option.
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Search stopped by max_proofs option.
% 0.20/0.49
% 0.20/0.49 ============ end of search ============
% 0.20/0.49
% 0.20/0.49 ----------- soft-scott stats ----------
% 0.20/0.49
% 0.20/0.49 true clauses given 2 (20.0%)
% 0.20/0.49 false clauses given 8
% 0.20/0.49
% 0.20/0.49 FALSE TRUE
% 0.20/0.49 5 0 1
% 0.20/0.49 9 2 0
% 0.20/0.49 11 0 1
% 0.20/0.49 14 0 2
% 0.20/0.49 20 0 1
% 0.20/0.49 23 0 2
% 0.20/0.49 tot: 2 7 (77.8% true)
% 0.20/0.49
% 0.20/0.49
% 0.20/0.49 Model 3 [ 1 0 76 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.49
% 0.20/0.49 That finishes the proof of the theorem.
% 0.20/0.49
% 0.20/0.49 Process 1845 finished Fri Jun 17 21:57:18 2022
%------------------------------------------------------------------------------