TSTP Solution File: GEO112+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO112+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:13 EDT 2022
% Result : Theorem 0.58s 0.82s
% Output : Refutation 0.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO112+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n010.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 23:22:54 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 sandbox on n010.cluster.edu,
% 0.13/0.36 Fri Jun 17 23:22:54 2022
% 0.13/0.36 The command was "./sos". The process ID is 31920.
% 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=1, symmetry=0, max_lits=12.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 65 during input processing: 0 [copy,65,flip.1] {-} A=A.
% 0.13/0.36 65 back subsumes 58.
% 0.13/0.36 65 back subsumes 57.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.48
% 0.19/0.48 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.48
% 0.19/0.48 Stopped by limit on number of solutions
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 -------------- Softie stats --------------
% 0.19/0.48
% 0.19/0.48 UPDATE_STOP: 300
% 0.19/0.48 SFINDER_TIME_LIMIT: 2
% 0.19/0.48 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.48 number of clauses in intial UL: 53
% 0.19/0.48 number of clauses initially in problem: 64
% 0.19/0.48 percentage of clauses intially in UL: 82
% 0.19/0.48 percentage of distinct symbols occuring in initial UL: 92
% 0.19/0.48 percent of all initial clauses that are short: 100
% 0.19/0.48 absolute distinct symbol count: 28
% 0.19/0.48 distinct predicate count: 9
% 0.19/0.48 distinct function count: 15
% 0.19/0.48 distinct constant count: 4
% 0.19/0.48
% 0.19/0.48 ---------- no more Softie stats ----------
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.48
% 0.19/0.48 Stopped by limit on number of solutions
% 0.19/0.48
% 0.19/0.48 =========== start of search ===========
% 0.58/0.82
% 0.58/0.82 -------- PROOF --------
% 0.58/0.82 % SZS status Theorem
% 0.58/0.82 % SZS output start Refutation
% 0.58/0.82
% 0.58/0.82 Model 3 [ 2 4 36530 ] (0.00 seconds, 44717 Inserts)
% 0.58/0.82
% 0.58/0.82 ----> UNIT CONFLICT at 0.43 sec ----> 1393 [binary,1392.1,1391.1] {-} $F.
% 0.58/0.82
% 0.58/0.82 Length of proof is 7. Level of proof is 3.
% 0.58/0.82
% 0.58/0.82 ---------------- PROOF ----------------
% 0.58/0.82 % SZS status Theorem
% 0.58/0.82 % SZS output start Refutation
% 0.58/0.82
% 0.58/0.82 43 [] {+} -between_c(A,B,C,D)|part_of($f14(A,B,C,D),A).
% 0.58/0.82 44 [] {+} -between_c(A,B,C,D)|end_point(B,$f14(A,B,C,D)).
% 0.58/0.82 45 [] {+} -between_c(A,B,C,D)|end_point(D,$f14(A,B,C,D)).
% 0.58/0.82 46 [] {+} -between_c(A,B,C,D)|inner_point(C,$f14(A,B,C,D)).
% 0.58/0.82 47 [] {+} between_c(A,B,C,D)|B=D| -part_of(E,A)| -end_point(B,E)| -end_point(D,E)| -inner_point(C,E).
% 0.58/0.82 48 [] {+} -between_c($c4,$c1,$c2,$c3).
% 0.58/0.82 64 [] {-} between_c($c4,$c3,$c2,$c1).
% 0.58/0.82 113 [hyper,64,46] {-} inner_point($c2,$f14($c4,$c3,$c2,$c1)).
% 0.58/0.82 114 [hyper,64,45] {-} end_point($c1,$f14($c4,$c3,$c2,$c1)).
% 0.58/0.82 115 [hyper,64,44] {-} end_point($c3,$f14($c4,$c3,$c2,$c1)).
% 0.58/0.82 116 [hyper,64,43] {-} part_of($f14($c4,$c3,$c2,$c1),$c4).
% 0.58/0.82 1093,1092 [hyper,116,47,114,115,113,unit_del,48,flip.1] {-} $c3=$c1.
% 0.58/0.82 1391 [back_demod,64,demod,1093] {-} between_c($c4,$c1,$c2,$c1).
% 0.58/0.82 1392 [back_demod,48,demod,1093] {-} -between_c($c4,$c1,$c2,$c1).
% 0.58/0.82 1393 [binary,1392.1,1391.1] {-} $F.
% 0.58/0.82
% 0.58/0.82 % SZS output end Refutation
% 0.58/0.82 ------------ end of proof -------------
% 0.58/0.82
% 0.58/0.82
% 0.58/0.82 Search stopped by max_proofs option.
% 0.58/0.82
% 0.58/0.82
% 0.58/0.82 Search stopped by max_proofs option.
% 0.58/0.82
% 0.58/0.82 ============ end of search ============
% 0.58/0.82
% 0.58/0.82 ----------- soft-scott stats ----------
% 0.58/0.82
% 0.58/0.82 true clauses given 4 (33.3%)
% 0.58/0.82 false clauses given 8
% 0.58/0.82
% 0.58/0.82 FALSE TRUE
% 0.58/0.82 6 0 4
% 0.58/0.82 7 3 0
% 0.58/0.82 9 0 1
% 0.58/0.82 10 0 9
% 0.58/0.82 11 2 3
% 0.58/0.82 12 0 21
% 0.58/0.82 13 7 13
% 0.58/0.82 14 0 4
% 0.58/0.82 15 33 35
% 0.58/0.82 16 3 5
% 0.58/0.82 17 16 21
% 0.58/0.82 18 0 9
% 0.58/0.82 19 9 37
% 0.58/0.82 20 18 12
% 0.58/0.82 21 34 50
% 0.58/0.82 22 49 31
% 0.58/0.82 23 2 25
% 0.58/0.82 24 12 4
% 0.58/0.82 25 4 53
% 0.58/0.82 26 9 16
% 0.58/0.82 27 10 37
% 0.58/0.82 28 3 9
% 0.58/0.82 29 6 28
% 0.58/0.82 30 0 18
% 0.58/0.82 31 0 49
% 0.58/0.82 32 0 12
% 0.58/0.82 33 0 15
% 0.58/0.82 34 0 23
% 0.58/0.82 35 0 30
% 0.58/0.82 36 0 14
% 0.58/0.82 37 0 47
% 0.58/0.82 38 0 5
% 0.58/0.82 39 0 22
% 0.58/0.82 40 0 23
% 0.58/0.82 41 0 15
% 0.58/0.82 42 0 14
% 0.58/0.82 43 0 18
% 0.58/0.82 44 0 4
% 0.58/0.82 45 0 8
% 0.58/0.82 46 0 32
% 0.58/0.82 50 0 2
% 0.58/0.82 51 0 6
% 0.58/0.82 52 0 9
% 0.58/0.82 56 0 2
% 0.58/0.82 tot: 220 795 (78.3% true)
% 0.58/0.82
% 0.58/0.82
% 0.58/0.82 Model 3 [ 2 4 36530 ] (0.00 seconds, 44717 Inserts)
% 0.58/0.82
% 0.58/0.82 That finishes the proof of the theorem.
% 0.58/0.82
% 0.58/0.82 Process 31920 finished Fri Jun 17 23:22:54 2022
%------------------------------------------------------------------------------