TSTP Solution File: GRP150-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP150-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:41:56 EDT 2022
% Result : Unsatisfiable 0.39s 0.62s
% Output : Refutation 0.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP150-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n025.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 : Tue Jun 14 06:15:24 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 n025.cluster.edu,
% 0.13/0.36 Tue Jun 14 06:15:24 2022
% 0.13/0.36 The command was "./sos". The process ID is 21707.
% 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 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.13/0.36
% 0.13/0.36 All clauses are units, and equality is present; the
% 0.13/0.36 strategy will be Knuth-Bendix with positive clauses in sos.
% 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
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.13/0.36 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.13/0.36 Following clause subsumed by 32 during input processing: 0 [copy,32,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 1
% 0.20/0.40 number of clauses initially in problem: 30
% 0.20/0.40 percentage of clauses intially in UL: 3
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 50
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 8
% 0.20/0.40 distinct predicate count: 1
% 0.20/0.40 distinct function count: 4
% 0.20/0.40 distinct constant count: 3
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.39/0.62
% 0.39/0.62 -------- PROOF --------
% 0.39/0.62 % SZS status Unsatisfiable
% 0.39/0.62 % SZS output start Refutation
% 0.39/0.62
% 0.39/0.62 Model 3 (0.00 seconds, 0 Inserts)
% 0.39/0.62
% 0.39/0.62 Stopped by limit on number of solutions
% 0.39/0.62
% 0.39/0.62 Model 4 (0.00 seconds, 0 Inserts)
% 0.39/0.62
% 0.39/0.62 Stopped by limit on number of solutions
% 0.39/0.62
% 0.39/0.62 Model 5 (0.00 seconds, 0 Inserts)
% 0.39/0.62
% 0.39/0.62 Stopped by limit on number of solutions
% 0.39/0.62
% 0.39/0.62 Model 6 (0.00 seconds, 0 Inserts)
% 0.39/0.62
% 0.39/0.62 Stopped by limit on number of solutions
% 0.39/0.62
% 0.39/0.62 Model 7 (0.00 seconds, 0 Inserts)
% 0.39/0.62
% 0.39/0.62 Stopped by limit on number of solutions
% 0.39/0.62
% 0.39/0.62 Model 8 (0.00 seconds, 0 Inserts)
% 0.39/0.62
% 0.39/0.62 Stopped by limit on number of solutions
% 0.39/0.62
% 0.39/0.62 Stopped by limit on insertions
% 0.39/0.62
% 0.39/0.62 Model 9 [ 3 0 342 ] (0.00 seconds, 250000 Inserts)
% 0.39/0.62
% 0.39/0.62 Stopped by limit on insertions
% 0.39/0.62
% 0.39/0.62 Model 10 [ 2 1 3460 ] (0.00 seconds, 250000 Inserts)
% 0.39/0.62
% 0.39/0.62 ----> UNIT CONFLICT at 0.23 sec ----> 59 [binary,57.1,35.1] {+} $F.
% 0.39/0.62
% 0.39/0.62 Length of proof is 4. Level of proof is 2.
% 0.39/0.62
% 0.39/0.62 ---------------- PROOF ----------------
% 0.39/0.62 % SZS status Unsatisfiable
% 0.39/0.62 % SZS output start Refutation
% 0.39/0.62
% 0.39/0.62 1 [] {+} least_upper_bound(a,least_upper_bound(a,b))!=least_upper_bound(a,b).
% 0.39/0.62 8 [] {+} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.39/0.62 9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.39/0.62 13 [] {-} least_upper_bound(A,least_upper_bound(B,C))=least_upper_bound(least_upper_bound(A,B),C).
% 0.39/0.62 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.39/0.62 20 [] {+} least_upper_bound(A,greatest_lower_bound(A,B))=A.
% 0.39/0.62 22 [] {+} greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 0.39/0.62 35 [para_from,9.1.1,1.1.1,demod,15] {+} least_upper_bound(a,least_upper_bound(b,a))!=least_upper_bound(a,b).
% 0.39/0.62 36 [para_into,20.1.1.2,8.1.1] {+} least_upper_bound(A,greatest_lower_bound(B,A))=A.
% 0.39/0.62 57 [para_into,36.1.1.2,22.1.1,demod,15] {-} least_upper_bound(A,least_upper_bound(B,A))=least_upper_bound(A,B).
% 0.39/0.62 59 [binary,57.1,35.1] {+} $F.
% 0.39/0.62
% 0.39/0.62 % SZS output end Refutation
% 0.39/0.62 ------------ end of proof -------------
% 0.39/0.62
% 0.39/0.62
% 0.39/0.62 Search stopped by max_proofs option.
% 0.39/0.62
% 0.39/0.62
% 0.39/0.62 Search stopped by max_proofs option.
% 0.39/0.62
% 0.39/0.62 ============ end of search ============
% 0.39/0.62
% 0.39/0.62 ----------- soft-scott stats ----------
% 0.39/0.62
% 0.39/0.62 true clauses given 1 (8.3%)
% 0.39/0.62 false clauses given 11
% 0.39/0.62
% 0.39/0.62 FALSE TRUE
% 0.39/0.62 7 2 1
% 0.39/0.62 8 0 1
% 0.39/0.62 9 0 2
% 0.39/0.62 11 2 4
% 0.39/0.62 13 5 1
% 0.39/0.62 tot: 9 9 (50.0% true)
% 0.39/0.62
% 0.39/0.62
% 0.39/0.62 Model 10 [ 2 1 3460 ] (0.00 seconds, 250000 Inserts)
% 0.39/0.62
% 0.39/0.62 That finishes the proof of the theorem.
% 0.39/0.62
% 0.39/0.62 Process 21707 finished Tue Jun 14 06:15:24 2022
%------------------------------------------------------------------------------