TSTP Solution File: GRP188-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP188-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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 11:42:12 EDT 2022
% Result : Unsatisfiable 0.18s 0.51s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : GRP188-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.09/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 04:37:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n021.cluster.edu,
% 0.12/0.35 Mon Jun 13 04:37:41 2022
% 0.12/0.35 The command was "./sos". The process ID is 8987.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.12/0.35
% 0.12/0.35 All clauses are units, and equality is present; the
% 0.12/0.35 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.12/0.35 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.12/0.35 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 1
% 0.12/0.38 number of clauses initially in problem: 36
% 0.12/0.38 percentage of clauses intially in UL: 2
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 50
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 8
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 4
% 0.12/0.38 distinct constant count: 3
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.18/0.51
% 0.18/0.51 -------- PROOF --------
% 0.18/0.51 % SZS status Unsatisfiable
% 0.18/0.51 % SZS output start Refutation
% 0.18/0.51
% 0.18/0.51 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on number of solutions
% 0.18/0.51
% 0.18/0.51 Model 4 (0.00 seconds, 0 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on number of solutions
% 0.18/0.51
% 0.18/0.51 Model 5 (0.00 seconds, 0 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on number of solutions
% 0.18/0.51
% 0.18/0.51 Stopped by limit on insertions
% 0.18/0.51
% 0.18/0.51 Model 6 [ 4 0 88 ] (0.00 seconds, 250000 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on insertions
% 0.18/0.51
% 0.18/0.51 Model 7 [ 1 1 71391 ] (0.00 seconds, 250000 Inserts)
% 0.18/0.51
% 0.18/0.51 Model 8 (0.00 seconds, 250000 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on number of solutions
% 0.18/0.51
% 0.18/0.51 Model 9 (0.00 seconds, 250000 Inserts)
% 0.18/0.51
% 0.18/0.51 Stopped by limit on number of solutions
% 0.18/0.51
% 0.18/0.51 ----> UNIT CONFLICT at 0.14 sec ----> 42 [binary,41.1,38.1] {-} $F.
% 0.18/0.51
% 0.18/0.51 Length of proof is 2. Level of proof is 2.
% 0.18/0.51
% 0.18/0.51 ---------------- PROOF ----------------
% 0.18/0.51 % SZS status Unsatisfiable
% 0.18/0.51 % SZS output start Refutation
% 0.18/0.51
% 0.18/0.51 1 [] {+} least_upper_bound(b,least_upper_bound(a,b))!=least_upper_bound(a,b).
% 0.18/0.51 9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.18/0.51 13 [] {-} least_upper_bound(A,least_upper_bound(B,C))=least_upper_bound(least_upper_bound(A,B),C).
% 0.18/0.51 15,14 [copy,13,flip.1] {-} least_upper_bound(least_upper_bound(A,B),C)=least_upper_bound(A,least_upper_bound(B,C)).
% 0.18/0.51 17,16 [] {+} least_upper_bound(A,A)=A.
% 0.18/0.51 38 [] {+} A=A.
% 0.18/0.51 41 [para_from,9.1.1,1.1.1,demod,15,17] {-} least_upper_bound(a,b)!=least_upper_bound(a,b).
% 0.18/0.51 42 [binary,41.1,38.1] {-} $F.
% 0.18/0.51
% 0.18/0.51 % SZS output end Refutation
% 0.18/0.51 ------------ end of proof -------------
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Search stopped by max_proofs option.
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Search stopped by max_proofs option.
% 0.18/0.51
% 0.18/0.51 ============ end of search ============
% 0.18/0.51
% 0.18/0.51 ----------- soft-scott stats ----------
% 0.18/0.51
% 0.18/0.51 true clauses given 2 (20.0%)
% 0.18/0.51 false clauses given 8
% 0.18/0.51
% 0.18/0.51 FALSE TRUE
% 0.18/0.51 7 2 0
% 0.18/0.51 10 1 0
% 0.18/0.51 11 3 0
% 0.18/0.51 13 4 0
% 0.18/0.51 tot: 10 0 (0.0% true)
% 0.18/0.51
% 0.18/0.51
% 0.18/0.51 Model 9 (0.00 seconds, 250000 Inserts)
% 0.18/0.51
% 0.18/0.51 That finishes the proof of the theorem.
% 0.18/0.51
% 0.18/0.51 Process 8987 finished Mon Jun 13 04:37:42 2022
%------------------------------------------------------------------------------