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