TSTP Solution File: GEO206+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO206+1 : TPTP v8.1.0. Released v3.3.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:09 EDT 2022
% Result : Theorem 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO206+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sat Jun 18 02:05:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n004.cluster.edu,
% 0.13/0.37 Sat Jun 18 02:05:53 2022
% 0.13/0.37 The command was "./sos". The process ID is 7678.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.13/0.37
% 0.13/0.37 This is a non-Horn set without equality. The strategy
% 0.13/0.37 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.37 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37
% 0.13/0.37 ======= 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: 19
% 0.20/0.39 number of clauses initially in problem: 20
% 0.20/0.39 percentage of clauses intially in UL: 95
% 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: 10
% 0.20/0.39 distinct predicate count: 4
% 0.20/0.39 distinct function count: 3
% 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 =========== start of search ===========
% 0.20/0.42
% 0.20/0.42 -------- PROOF --------
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 ----> UNIT CONFLICT at 0.04 sec ----> 163 [binary,162.1,16.1] {-} $F.
% 0.20/0.42
% 0.20/0.42 Length of proof is 4. Level of proof is 4.
% 0.20/0.42
% 0.20/0.42 ---------------- PROOF ----------------
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.20/0.42 15 [] {+} -convergent_lines(parallel_through_point(A,B),A).
% 0.20/0.42 16 [] {+} -apart_point_and_line(A,parallel_through_point(B,A)).
% 0.20/0.42 17 [] {+} -distinct_lines(A,B)|apart_point_and_line(C,A)|apart_point_and_line(C,B)|convergent_lines(A,B).
% 0.20/0.42 18 [] {+} -apart_point_and_line($c3,$c2).
% 0.20/0.42 19 [] {+} -convergent_lines($c2,$c1).
% 0.20/0.42 20 [] {-} distinct_lines($c2,parallel_through_point($c1,$c3)).
% 0.20/0.42 21 [hyper,20,17] {-} apart_point_and_line(A,$c2)|apart_point_and_line(A,parallel_through_point($c1,$c3))|convergent_lines($c2,parallel_through_point($c1,$c3)).
% 0.20/0.42 41 [hyper,21,6] {-} apart_point_and_line(A,$c2)|apart_point_and_line(A,parallel_through_point($c1,$c3))|convergent_lines($c2,B)|convergent_lines(parallel_through_point($c1,$c3),B).
% 0.20/0.42 161 [hyper,41,19,unit_del,15] {-} apart_point_and_line(A,$c2)|apart_point_and_line(A,parallel_through_point($c1,$c3)).
% 0.20/0.42 162 [hyper,161,18] {-} apart_point_and_line($c3,parallel_through_point($c1,$c3)).
% 0.20/0.42 163 [binary,162.1,16.1] {-} $F.
% 0.20/0.42
% 0.20/0.42 % SZS output end Refutation
% 0.20/0.42 ------------ end of proof -------------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42 ============ end of search ============
% 0.20/0.42
% 0.20/0.42 ----------- soft-scott stats ----------
% 0.20/0.42
% 0.20/0.42 true clauses given 0 (0.0%)
% 0.20/0.42 false clauses given 39
% 0.20/0.42
% 0.20/0.42 FALSE TRUE
% 0.20/0.42 16 2 0
% 0.20/0.42 17 36 0
% 0.20/0.42 19 7 0
% 0.20/0.42 20 34 0
% 0.20/0.42 22 16 0
% 0.20/0.42 23 1 0
% 0.20/0.42 25 2 0
% 0.20/0.42 tot: 98 0 (0.0% true)
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 That finishes the proof of the theorem.
% 0.20/0.42
% 0.20/0.42 Process 7678 finished Sat Jun 18 02:05:53 2022
%------------------------------------------------------------------------------