TSTP Solution File: GRP171-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP171-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:03 EDT 2022
% Result : Unsatisfiable 0.54s 0.74s
% Output : Refutation 0.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP171-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n011.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 08:22:18 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 n011.cluster.edu,
% 0.12/0.35 Mon Jun 13 08:22:18 2022
% 0.12/0.35 The command was "./sos". The process ID is 27792.
% 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 36 during input processing: 0 [copy,36,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 1
% 0.18/0.38 number of clauses initially in problem: 34
% 0.18/0.38 percentage of clauses intially in UL: 2
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 75
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 8
% 0.18/0.38 distinct predicate count: 1
% 0.18/0.38 distinct function count: 4
% 0.18/0.38 distinct constant count: 3
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 0.54/0.74
% 0.54/0.74 -------- PROOF --------
% 0.54/0.74 % SZS status Unsatisfiable
% 0.54/0.74 % SZS output start Refutation
% 0.54/0.74
% 0.54/0.74 Stopped by limit on insertions
% 0.54/0.74
% 0.54/0.74 Model 3 [ 3 0 84 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Model 4 (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Stopped by limit on number of solutions
% 0.54/0.74
% 0.54/0.74 Model 5 (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Stopped by limit on number of solutions
% 0.54/0.74
% 0.54/0.74 Model 6 (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Stopped by limit on number of solutions
% 0.54/0.74
% 0.54/0.74 Model 7 (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Stopped by limit on number of solutions
% 0.54/0.74
% 0.54/0.74 Stopped by limit on insertions
% 0.54/0.74
% 0.54/0.74 Model 8 [ 1 1 85 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Stopped by limit on insertions
% 0.54/0.74
% 0.54/0.74 Model 9 [ 2 1 3803 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Model 10 (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Stopped by limit on number of solutions
% 0.54/0.74
% 0.54/0.74 Model 11 (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Stopped by limit on number of solutions
% 0.54/0.74
% 0.54/0.74 Model 12 (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Stopped by limit on number of solutions
% 0.54/0.74
% 0.54/0.74 Model 13 (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 Stopped by limit on number of solutions
% 0.54/0.74
% 0.54/0.74 ----> UNIT CONFLICT at 0.37 sec ----> 368 [binary,366.1,1.1] {-} $F.
% 0.54/0.74
% 0.54/0.74 Length of proof is 10. Level of proof is 5.
% 0.54/0.74
% 0.54/0.74 ---------------- PROOF ----------------
% 0.54/0.74 % SZS status Unsatisfiable
% 0.54/0.74 % SZS output start Refutation
% 0.54/0.74
% 0.54/0.74 1 [] {+} greatest_lower_bound(identity,multiply(a,b))!=identity.
% 0.54/0.74 3,2 [] {+} multiply(identity,A)=A.
% 0.54/0.74 4 [] {+} multiply(inverse(A),A)=identity.
% 0.54/0.74 6 [] {-} multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 0.54/0.74 9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.54/0.74 13 [] {-} least_upper_bound(A,least_upper_bound(B,C))=least_upper_bound(least_upper_bound(A,B),C).
% 0.54/0.74 14 [copy,13,flip.1] {-} least_upper_bound(least_upper_bound(A,B),C)=least_upper_bound(A,least_upper_bound(B,C)).
% 0.54/0.74 22 [] {+} greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 0.54/0.74 24 [] {-} multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.54/0.74 32 [] {+} least_upper_bound(identity,a)=a.
% 0.54/0.74 34 [] {+} least_upper_bound(identity,b)=b.
% 0.54/0.74 38 [para_into,9.1.1,34.1.1,flip.1] {+} least_upper_bound(b,identity)=b.
% 0.54/0.74 46 [para_into,6.1.1.1,4.1.1,demod,3,flip.1] {+} multiply(inverse(A),multiply(A,B))=B.
% 0.54/0.74 57,56 [para_into,46.1.1.2,46.1.1] {+} multiply(inverse(inverse(A)),B)=multiply(A,B).
% 0.54/0.74 61,60 [para_into,46.1.1.2,4.1.1,demod,57] {+} multiply(A,identity)=A.
% 0.54/0.74 64 [para_into,24.1.1.2,38.1.1,demod,61,flip.1] {+} least_upper_bound(multiply(A,b),A)=multiply(A,b).
% 0.54/0.74 99 [para_into,14.1.1.1,32.1.1,flip.1] {-} least_upper_bound(identity,least_upper_bound(a,A))=least_upper_bound(a,A).
% 0.54/0.74 334 [para_from,99.1.1,22.1.1.2] {-} greatest_lower_bound(identity,least_upper_bound(a,A))=identity.
% 0.54/0.74 344 [para_into,334.1.1.2,9.1.1] {-} greatest_lower_bound(identity,least_upper_bound(A,a))=identity.
% 0.54/0.74 366 [para_into,344.1.1.2,64.1.1] {-} greatest_lower_bound(identity,multiply(a,b))=identity.
% 0.54/0.74 368 [binary,366.1,1.1] {-} $F.
% 0.54/0.74
% 0.54/0.74 % SZS output end Refutation
% 0.54/0.74 ------------ end of proof -------------
% 0.54/0.74
% 0.54/0.74
% 0.54/0.74 Search stopped by max_proofs option.
% 0.54/0.74
% 0.54/0.74
% 0.54/0.74 Search stopped by max_proofs option.
% 0.54/0.74
% 0.54/0.74 ============ end of search ============
% 0.54/0.74
% 0.54/0.74 ----------- soft-scott stats ----------
% 0.54/0.74
% 0.54/0.74 true clauses given 17 (32.7%)
% 0.54/0.74 false clauses given 35
% 0.54/0.74
% 0.54/0.74 FALSE TRUE
% 0.54/0.74 6 0 2
% 0.54/0.74 7 1 11
% 0.54/0.74 9 24 12
% 0.54/0.74 11 38 2
% 0.54/0.74 12 0 1
% 0.54/0.74 13 20 4
% 0.54/0.74 15 0 4
% 0.54/0.74 17 7 0
% 0.54/0.74 19 0 4
% 0.54/0.74 31 4 2
% 0.54/0.74 tot: 94 42 (30.9% true)
% 0.54/0.74
% 0.54/0.74
% 0.54/0.74 Model 13 (0.00 seconds, 250000 Inserts)
% 0.54/0.74
% 0.54/0.74 That finishes the proof of the theorem.
% 0.54/0.74
% 0.54/0.74 Process 27792 finished Mon Jun 13 08:22:19 2022
%------------------------------------------------------------------------------