TSTP Solution File: GRP186-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP186-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:11 EDT 2022
% Result : Unsatisfiable 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP186-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n009.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:03:23 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 sandbox2 on n009.cluster.edu,
% 0.12/0.35 Mon Jun 13 04:03:23 2022
% 0.12/0.35 The command was "./sos". The process ID is 21033.
% 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 9 during input processing: 0 [copy,9,flip.1] {-} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.12/0.35 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.12/0.35 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 0
% 0.12/0.39 number of clauses initially in problem: 30
% 0.12/0.39 percentage of clauses intially in UL: 0
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 0
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 8
% 0.12/0.39 distinct predicate count: 1
% 0.12/0.39 distinct function count: 4
% 0.12/0.39 distinct constant count: 3
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.20/0.56
% 0.20/0.56 -------- PROOF --------
% 0.20/0.56 % SZS status Unsatisfiable
% 0.20/0.56 % SZS output start Refutation
% 0.20/0.56
% 0.20/0.56 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.56
% 0.20/0.56 Stopped by limit on number of solutions
% 0.20/0.56
% 0.20/0.56 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.56
% 0.20/0.56 Stopped by limit on number of solutions
% 0.20/0.56
% 0.20/0.56 Model 5 (0.00 seconds, 0 Inserts)
% 0.20/0.56
% 0.20/0.56 Stopped by limit on number of solutions
% 0.20/0.56
% 0.20/0.56 Stopped by limit on insertions
% 0.20/0.56
% 0.20/0.56 Model 6 [ 2 0 200 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.56
% 0.20/0.56 Stopped by limit on insertions
% 0.20/0.56
% 0.20/0.56 Model 7 [ 3 1 76 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.56
% 0.20/0.56 Model 8 (0.00 seconds, 250000 Inserts)
% 0.20/0.56
% 0.20/0.56 Stopped by limit on number of solutions
% 0.20/0.56
% 0.20/0.56 Model 9 (0.00 seconds, 250000 Inserts)
% 0.20/0.56
% 0.20/0.56 Stopped by limit on number of solutions
% 0.20/0.56
% 0.20/0.56 ----> UNIT CONFLICT at 0.18 sec ----> 245 [binary,244.1,33.1] {-} $F.
% 0.20/0.56
% 0.20/0.56 Length of proof is 7. Level of proof is 4.
% 0.20/0.56
% 0.20/0.56 ---------------- PROOF ----------------
% 0.20/0.56 % SZS status Unsatisfiable
% 0.20/0.56 % SZS output start Refutation
% 0.20/0.56
% 0.20/0.56 1 [] {-} least_upper_bound(multiply(a,b),identity)!=multiply(a,least_upper_bound(inverse(a),b)).
% 0.20/0.56 2 [copy,1,flip.1] {-} multiply(a,least_upper_bound(inverse(a),b))!=least_upper_bound(multiply(a,b),identity).
% 0.20/0.56 4,3 [] {+} multiply(identity,A)=A.
% 0.20/0.56 5 [] {+} multiply(inverse(A),A)=identity.
% 0.20/0.56 7 [] {-} multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 0.20/0.56 10 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.20/0.56 26,25 [] {-} multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.20/0.56 33 [] {+} A=A.
% 0.20/0.56 34 [back_demod,2,demod,26] {-} least_upper_bound(multiply(a,inverse(a)),multiply(a,b))!=least_upper_bound(multiply(a,b),identity).
% 0.20/0.56 35 [para_into,7.1.1.1,5.1.1,demod,4,flip.1] {+} multiply(inverse(A),multiply(A,B))=B.
% 0.20/0.56 41 [para_into,35.1.1.2,35.1.1] {+} multiply(inverse(inverse(A)),B)=multiply(A,B).
% 0.20/0.56 87 [para_into,34.1.1,10.1.1] {-} least_upper_bound(multiply(a,b),multiply(a,inverse(a)))!=least_upper_bound(multiply(a,b),identity).
% 0.20/0.56 243,242 [para_into,41.1.1,5.1.1,flip.1] {-} multiply(A,inverse(A))=identity.
% 0.20/0.56 244 [back_demod,87,demod,243] {-} least_upper_bound(multiply(a,b),identity)!=least_upper_bound(multiply(a,b),identity).
% 0.20/0.56 245 [binary,244.1,33.1] {-} $F.
% 0.20/0.56
% 0.20/0.56 % SZS output end Refutation
% 0.20/0.56 ------------ end of proof -------------
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Search stopped by max_proofs option.
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Search stopped by max_proofs option.
% 0.20/0.56
% 0.20/0.56 ============ end of search ============
% 0.20/0.56
% 0.20/0.56 ----------- soft-scott stats ----------
% 0.20/0.56
% 0.20/0.56 true clauses given 10 (32.3%)
% 0.20/0.56 false clauses given 21
% 0.20/0.56
% 0.20/0.56 FALSE TRUE
% 0.20/0.56 7 0 3
% 0.20/0.56 9 0 5
% 0.20/0.56 10 1 0
% 0.20/0.56 11 1 13
% 0.20/0.56 12 0 1
% 0.20/0.56 13 0 18
% 0.20/0.56 15 8 0
% 0.20/0.56 19 18 0
% 0.20/0.56 28 18 0
% 0.20/0.56 31 2 4
% 0.20/0.56 37 2 0
% 0.20/0.56 tot: 50 44 (46.8% true)
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Model 9 (0.00 seconds, 250000 Inserts)
% 0.20/0.56
% 0.20/0.56 That finishes the proof of the theorem.
% 0.20/0.56
% 0.20/0.56 Process 21033 finished Mon Jun 13 04:03:23 2022
%------------------------------------------------------------------------------