TSTP Solution File: GRP190-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP190-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:13 EDT 2022
% Result : Unsatisfiable 0.18s 0.59s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP190-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n006.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 15:43:56 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 n006.cluster.edu,
% 0.12/0.35 Mon Jun 13 15:43:56 2022
% 0.12/0.35 The command was "./sos". The process ID is 16852.
% 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 34 during input processing: 0 [copy,34,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: 32
% 0.12/0.38 percentage of clauses intially in UL: 3
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 62
% 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.59
% 0.18/0.59 -------- PROOF --------
% 0.18/0.59 % SZS status Unsatisfiable
% 0.18/0.59 % SZS output start Refutation
% 0.18/0.59
% 0.18/0.59 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.59
% 0.18/0.59 Stopped by limit on number of solutions
% 0.18/0.59
% 0.18/0.59 Model 4 (0.00 seconds, 0 Inserts)
% 0.18/0.59
% 0.18/0.59 Stopped by limit on number of solutions
% 0.18/0.59
% 0.18/0.59 Model 5 (0.00 seconds, 0 Inserts)
% 0.18/0.59
% 0.18/0.59 Stopped by limit on number of solutions
% 0.18/0.59
% 0.18/0.59 Stopped by limit on insertions
% 0.18/0.59
% 0.18/0.59 Model 6 [ 1 1 437 ] (0.00 seconds, 250000 Inserts)
% 0.18/0.59
% 0.18/0.59 Stopped by limit on insertions
% 0.18/0.59
% 0.18/0.59 Model 7 [ 1 0 12149 ] (0.00 seconds, 250000 Inserts)
% 0.18/0.59
% 0.18/0.59 Model 8 (0.00 seconds, 250000 Inserts)
% 0.18/0.59
% 0.18/0.59 Stopped by limit on number of solutions
% 0.18/0.59
% 0.18/0.59 Model 9 (0.00 seconds, 250000 Inserts)
% 0.18/0.59
% 0.18/0.59 Stopped by limit on number of solutions
% 0.18/0.59
% 0.18/0.59 Model 10 (0.00 seconds, 250000 Inserts)
% 0.18/0.59
% 0.18/0.59 Stopped by limit on number of solutions
% 0.18/0.59
% 0.18/0.59 Model 11 (0.00 seconds, 250000 Inserts)
% 0.18/0.59
% 0.18/0.59 Stopped by limit on number of solutions
% 0.18/0.59
% 0.18/0.59 ----> UNIT CONFLICT at 0.21 sec ----> 414 [binary,412.1,1.1] {-} $F.
% 0.18/0.59
% 0.18/0.59 Length of proof is 10. Level of proof is 6.
% 0.18/0.59
% 0.18/0.59 ---------------- PROOF ----------------
% 0.18/0.59 % SZS status Unsatisfiable
% 0.18/0.59 % SZS output start Refutation
% 0.18/0.59
% 0.18/0.59 1 [] {+} greatest_lower_bound(inverse(a),inverse(b))!=inverse(a).
% 0.18/0.59 3,2 [] {+} multiply(identity,A)=A.
% 0.18/0.59 4 [] {+} multiply(inverse(A),A)=identity.
% 0.18/0.59 7,6 [] {-} multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 0.18/0.59 9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.18/0.59 22 [] {+} greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 0.18/0.59 24 [] {-} multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.18/0.59 30 [] {-} multiply(greatest_lower_bound(A,B),C)=greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.18/0.59 32 [] {+} least_upper_bound(a,b)=a.
% 0.18/0.59 36 [para_into,9.1.1,32.1.1,flip.1] {+} least_upper_bound(b,a)=a.
% 0.18/0.59 42 [para_into,6.1.1.1,4.1.1,demod,3,flip.1] {+} multiply(inverse(A),multiply(A,B))=B.
% 0.18/0.59 53,52 [para_into,42.1.1.2,42.1.1] {+} multiply(inverse(inverse(A)),B)=multiply(A,B).
% 0.18/0.59 57,56 [para_into,42.1.1.2,4.1.1,demod,53] {+} multiply(A,identity)=A.
% 0.18/0.59 60 [para_into,24.1.1.2,36.1.1,flip.1] {-} least_upper_bound(multiply(A,b),multiply(A,a))=multiply(A,a).
% 0.18/0.59 85 [para_into,60.1.1.1,4.1.1] {-} least_upper_bound(identity,multiply(inverse(b),a))=multiply(inverse(b),a).
% 0.18/0.59 97 [para_from,85.1.1,22.1.1.2] {-} greatest_lower_bound(identity,multiply(inverse(b),a))=identity.
% 0.18/0.59 222 [para_into,30.1.1.1,97.1.1,demod,3,3,7,flip.1] {-} greatest_lower_bound(A,multiply(inverse(b),multiply(a,A)))=A.
% 0.18/0.59 344 [para_into,52.1.1,4.1.1,flip.1] {+} multiply(A,inverse(A))=identity.
% 0.18/0.59 412 [para_from,344.1.1,222.1.1.2.2,demod,57] {-} greatest_lower_bound(inverse(a),inverse(b))=inverse(a).
% 0.18/0.59 414 [binary,412.1,1.1] {-} $F.
% 0.18/0.59
% 0.18/0.59 % SZS output end Refutation
% 0.18/0.59 ------------ end of proof -------------
% 0.18/0.59
% 0.18/0.59
% 0.18/0.59 Search stopped by max_proofs option.
% 0.18/0.59
% 0.18/0.59
% 0.18/0.59 Search stopped by max_proofs option.
% 0.18/0.59
% 0.18/0.59 ============ end of search ============
% 0.18/0.59
% 0.18/0.59 ----------- soft-scott stats ----------
% 0.18/0.59
% 0.18/0.59 true clauses given 18 (31.6%)
% 0.18/0.59 false clauses given 39
% 0.18/0.59
% 0.18/0.59 FALSE TRUE
% 0.18/0.59 7 0 2
% 0.18/0.59 8 0 3
% 0.18/0.59 9 0 14
% 0.18/0.59 11 0 17
% 0.18/0.59 12 2 0
% 0.18/0.59 13 3 12
% 0.18/0.59 14 16 0
% 0.18/0.59 15 17 1
% 0.18/0.59 16 8 1
% 0.18/0.59 17 10 1
% 0.18/0.59 18 4 0
% 0.18/0.59 19 2 0
% 0.18/0.59 21 8 0
% 0.18/0.59 23 12 0
% 0.18/0.59 31 6 4
% 0.18/0.59 tot: 88 55 (38.5% true)
% 0.18/0.59
% 0.18/0.59
% 0.18/0.59 Model 11 (0.00 seconds, 250000 Inserts)
% 0.18/0.59
% 0.18/0.59 That finishes the proof of the theorem.
% 0.18/0.59
% 0.18/0.59 Process 16852 finished Mon Jun 13 15:43:57 2022
%------------------------------------------------------------------------------