TSTP Solution File: GRP158-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP158-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:58 EDT 2022
% Result : Unsatisfiable 0.46s 0.67s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP158-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n022.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 08:23:18 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n022.cluster.edu,
% 0.13/0.36 Mon Jun 13 08:23:18 2022
% 0.13/0.36 The command was "./sos". The process ID is 17726.
% 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 34 during input processing: 0 [copy,34,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 1
% 0.20/0.41 number of clauses initially in problem: 32
% 0.20/0.41 percentage of clauses intially in UL: 3
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 66
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 9
% 0.20/0.41 distinct predicate count: 1
% 0.20/0.41 distinct function count: 4
% 0.20/0.41 distinct constant count: 4
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.46/0.67
% 0.46/0.67 -------- PROOF --------
% 0.46/0.67 % SZS status Unsatisfiable
% 0.46/0.67 % SZS output start Refutation
% 0.46/0.67
% 0.46/0.67 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Model 4 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Model 5 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Model 6 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 7 [ 1 1 184 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 8 [ 1 1 96 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Model 9 (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Model 10 (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Model 11 (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 ----> UNIT CONFLICT at 0.27 sec ----> 146 [binary,144.1,1.1] {+} $F.
% 0.46/0.67
% 0.46/0.67 Length of proof is 5. Level of proof is 5.
% 0.46/0.67
% 0.46/0.67 ---------------- PROOF ----------------
% 0.46/0.67 % SZS status Unsatisfiable
% 0.46/0.67 % SZS output start Refutation
% 0.46/0.67
% 0.46/0.67 1 [] {+} greatest_lower_bound(multiply(c,a),multiply(c,b))!=multiply(c,a).
% 0.46/0.67 8 [] {+} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.46/0.67 9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.46/0.67 20 [] {+} least_upper_bound(A,greatest_lower_bound(A,B))=A.
% 0.46/0.67 22 [] {+} greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 0.46/0.67 24 [] {-} multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.46/0.67 32 [] {+} greatest_lower_bound(a,b)=a.
% 0.46/0.67 35 [para_into,8.1.1,32.1.1,flip.1] {+} greatest_lower_bound(b,a)=a.
% 0.46/0.67 38 [para_into,20.1.1.2,35.1.1] {+} least_upper_bound(b,a)=b.
% 0.46/0.67 50 [para_into,38.1.1,9.1.1] {+} least_upper_bound(a,b)=b.
% 0.46/0.67 81 [para_from,50.1.1,24.1.1.2,flip.1] {-} least_upper_bound(multiply(A,a),multiply(A,b))=multiply(A,b).
% 0.46/0.67 144 [para_from,81.1.1,22.1.1.2] {-} greatest_lower_bound(multiply(A,a),multiply(A,b))=multiply(A,a).
% 0.46/0.67 146 [binary,144.1,1.1] {+} $F.
% 0.46/0.67
% 0.46/0.67 % SZS output end Refutation
% 0.46/0.67 ------------ end of proof -------------
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Search stopped by max_proofs option.
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Search stopped by max_proofs option.
% 0.46/0.67
% 0.46/0.67 ============ end of search ============
% 0.46/0.67
% 0.46/0.67 ----------- soft-scott stats ----------
% 0.46/0.67
% 0.46/0.67 true clauses given 6 (25.0%)
% 0.46/0.67 false clauses given 18
% 0.46/0.67
% 0.46/0.67 FALSE TRUE
% 0.46/0.67 5 0 1
% 0.46/0.67 6 0 1
% 0.46/0.67 7 0 4
% 0.46/0.67 9 0 9
% 0.46/0.67 11 2 11
% 0.46/0.67 12 2 1
% 0.46/0.67 13 5 4
% 0.46/0.67 14 2 0
% 0.46/0.67 15 3 0
% 0.46/0.67 16 2 0
% 0.46/0.67 17 1 0
% 0.46/0.67 21 1 0
% 0.46/0.67 tot: 18 31 (63.3% true)
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Model 11 (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 That finishes the proof of the theorem.
% 0.46/0.67
% 0.46/0.67 Process 17726 finished Mon Jun 13 08:23:18 2022
%------------------------------------------------------------------------------