TSTP Solution File: GEO024-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO024-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:17:29 EDT 2022
% Result : Unsatisfiable 1.23s 1.43s
% Output : Refutation 1.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO024-3 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : sos-script %s
% 0.12/0.32 % Computer : n003.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sat Jun 18 14:16:43 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.18/0.34 ----- Otter 3.2, August 2001 -----
% 0.18/0.34 The process was started by sandbox2 on n003.cluster.edu,
% 0.18/0.34 Sat Jun 18 14:16:43 2022
% 0.18/0.34 The command was "./sos". The process ID is 32530.
% 0.18/0.34
% 0.18/0.34 set(prolog_style_variables).
% 0.18/0.34 set(auto).
% 0.18/0.34 dependent: set(auto1).
% 0.18/0.34 dependent: set(process_input).
% 0.18/0.34 dependent: clear(print_kept).
% 0.18/0.34 dependent: clear(print_new_demod).
% 0.18/0.34 dependent: clear(print_back_demod).
% 0.18/0.34 dependent: clear(print_back_sub).
% 0.18/0.34 dependent: set(control_memory).
% 0.18/0.34 dependent: assign(max_mem, 12000).
% 0.18/0.34 dependent: assign(pick_given_ratio, 4).
% 0.18/0.34 dependent: assign(stats_level, 1).
% 0.18/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.34 dependent: assign(sos_limit, 5000).
% 0.18/0.34 dependent: assign(max_weight, 60).
% 0.18/0.34 clear(print_given).
% 0.18/0.34
% 0.18/0.34 list(usable).
% 0.18/0.34
% 0.18/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.18/0.34
% 0.18/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.34 clauses in usable.
% 0.18/0.34
% 0.18/0.34 dependent: set(knuth_bendix).
% 0.18/0.34 dependent: set(para_from).
% 0.18/0.34 dependent: set(para_into).
% 0.18/0.34 dependent: clear(para_from_right).
% 0.18/0.34 dependent: clear(para_into_right).
% 0.18/0.34 dependent: set(para_from_vars).
% 0.18/0.34 dependent: set(eq_units_both_ways).
% 0.18/0.34 dependent: set(dynamic_demod_all).
% 0.18/0.34 dependent: set(dynamic_demod).
% 0.18/0.34 dependent: set(order_eq).
% 0.18/0.34 dependent: set(back_demod).
% 0.18/0.34 dependent: set(lrpo).
% 0.18/0.34 dependent: set(hyper_res).
% 0.18/0.34 dependent: set(unit_deletion).
% 0.18/0.34 dependent: set(factor).
% 0.18/0.34
% 0.18/0.34 ------------> process usable:
% 0.18/0.34
% 0.18/0.34 ------------> process sos:
% 0.18/0.34 Following clause subsumed by 47 during input processing: 0 [demod,50] {-} between(A,B,extension(A,B,A,B)).
% 0.18/0.34 Following clause subsumed by 48 during input processing: 0 [demod,50] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.18/0.34 Following clause subsumed by 56 during input processing: 0 [] {-} A=A.
% 0.18/0.34 46 back subsumes 43.
% 0.18/0.34 51 back subsumes 30.
% 0.18/0.34 Following clause subsumed by 56 during input processing: 0 [copy,56,flip.1] {-} A=A.
% 0.18/0.34
% 0.18/0.34 ======= end of input processing =======
% 0.84/1.08
% 0.84/1.08 Model 1 (0.00 seconds, 0 Inserts)
% 0.84/1.08
% 0.84/1.08 Stopped by limit on number of solutions
% 0.84/1.08
% 0.84/1.08
% 0.84/1.08 -------------- Softie stats --------------
% 0.84/1.08
% 0.84/1.08 UPDATE_STOP: 300
% 0.84/1.08 SFINDER_TIME_LIMIT: 2
% 0.84/1.08 SHORT_CLAUSE_CUTOFF: 4
% 0.84/1.08 number of clauses in intial UL: 39
% 0.84/1.08 number of clauses initially in problem: 50
% 0.84/1.08 percentage of clauses intially in UL: 78
% 0.84/1.08 percentage of distinct symbols occuring in initial UL: 92
% 0.84/1.08 percent of all initial clauses that are short: 100
% 0.84/1.08 absolute distinct symbol count: 14
% 0.84/1.08 distinct predicate count: 3
% 0.84/1.08 distinct function count: 6
% 0.84/1.08 distinct constant count: 5
% 0.84/1.08
% 0.84/1.08 ---------- no more Softie stats ----------
% 0.84/1.08
% 0.84/1.08
% 0.84/1.08
% 0.84/1.08 Model 2 (0.00 seconds, 0 Inserts)
% 0.84/1.08
% 0.84/1.08 Stopped by limit on number of solutions
% 0.84/1.08
% 0.91/1.08 =========== start of search ===========
% 1.23/1.43
% 1.23/1.43 -------- PROOF --------
% 1.23/1.43 % SZS status Unsatisfiable
% 1.23/1.43 % SZS output start Refutation
% 1.23/1.43
% 1.23/1.43 Model 3 (0.00 seconds, 0 Inserts)
% 1.23/1.43
% 1.23/1.43 Stopped by limit on number of solutions
% 1.23/1.43
% 1.23/1.43 ----> UNIT CONFLICT at 1.06 sec ----> 83 [binary,82.1,29.1] {+} $F.
% 1.23/1.43
% 1.23/1.43 Length of proof is 2. Level of proof is 2.
% 1.23/1.43
% 1.23/1.43 ---------------- PROOF ----------------
% 1.23/1.43 % SZS status Unsatisfiable
% 1.23/1.43 % SZS output start Refutation
% 1.23/1.43
% 1.23/1.43 29 [] {+} -equidistant(u,u,v,v).
% 1.23/1.43 48 [] {-} equidistant(A,extension(B,A,C,D),C,D).
% 1.23/1.43 52 [] {-} A=extension(B,A,C,C).
% 1.23/1.43 53 [copy,52,flip.1] {+} extension(A,B,C,C)=B.
% 1.23/1.43 82 [para_into,48.1.2,53.1.1] {-} equidistant(A,A,B,B).
% 1.23/1.43 83 [binary,82.1,29.1] {+} $F.
% 1.23/1.43
% 1.23/1.43 % SZS output end Refutation
% 1.23/1.43 ------------ end of proof -------------
% 1.23/1.43
% 1.23/1.43
% 1.23/1.43 Search stopped by max_proofs option.
% 1.23/1.43
% 1.23/1.43
% 1.23/1.43 Search stopped by max_proofs option.
% 1.23/1.43
% 1.23/1.43 ============ end of search ============
% 1.23/1.43
% 1.23/1.43 ----------- soft-scott stats ----------
% 1.23/1.43
% 1.23/1.43 true clauses given 0 (0.0%)
% 1.23/1.43 false clauses given 3
% 1.23/1.43
% 1.23/1.43 FALSE TRUE
% 1.23/1.43 3 0 1
% 1.23/1.43 5 0 1
% 1.23/1.43 7 0 1
% 1.23/1.43 8 0 2
% 1.23/1.43 9 1 0
% 1.23/1.43 10 1 1
% 1.23/1.43 12 0 1
% 1.23/1.43 16 0 2
% 1.23/1.43 20 0 2
% 1.23/1.43 21 0 1
% 1.23/1.43 22 0 1
% 1.23/1.43 25 0 2
% 1.23/1.43 30 0 1
% 1.23/1.43 31 0 1
% 1.23/1.43 36 0 1
% 1.23/1.43 tot: 2 18 (90.0% true)
% 1.23/1.43
% 1.23/1.43
% 1.23/1.43 Model 3 (0.00 seconds, 0 Inserts)
% 1.23/1.43
% 1.23/1.43 That finishes the proof of the theorem.
% 1.23/1.43
% 1.23/1.43 Process 32530 finished Sat Jun 18 14:16:44 2022
%------------------------------------------------------------------------------