TSTP Solution File: GRP141-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:54 EDT 2022
% Result : Unsatisfiable 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP141-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n029.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 02:15:55 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 n029.cluster.edu,
% 0.13/0.36 Tue Jun 14 02:15:55 2022
% 0.13/0.36 The command was "./sos". The process ID is 13244.
% 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 36 during input processing: 0 [copy,36,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 0
% 0.13/0.39 number of clauses initially in problem: 34
% 0.13/0.39 percentage of clauses intially in UL: 0
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 0
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 9
% 0.13/0.39 distinct predicate count: 1
% 0.13/0.39 distinct function count: 4
% 0.13/0.39 distinct constant count: 4
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 0.19/0.52
% 0.19/0.52 -------- PROOF --------
% 0.19/0.52 % SZS status Unsatisfiable
% 0.19/0.52 % SZS output start Refutation
% 0.19/0.52
% 0.19/0.52 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 Model 6 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 Model 7 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 Model 8 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 Stopped by limit on insertions
% 0.19/0.52
% 0.19/0.52 Model 9 [ 2 0 60 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.52
% 0.19/0.52 Model 10 (0.00 seconds, 250000 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 Model 11 (0.00 seconds, 250000 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 ----> UNIT CONFLICT at 0.14 sec ----> 98 [binary,97.1,36.1] {+} $F.
% 0.19/0.52
% 0.19/0.52 Length of proof is 9. Level of proof is 5.
% 0.19/0.52
% 0.19/0.52 ---------------- PROOF ----------------
% 0.19/0.52 % SZS status Unsatisfiable
% 0.19/0.52 % SZS output start Refutation
% 0.19/0.52
% 0.19/0.52 1 [] {-} greatest_lower_bound(greatest_lower_bound(a,b),c)!=c.
% 0.19/0.52 8 [] {+} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.19/0.52 9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.19/0.52 10 [] {-} greatest_lower_bound(A,greatest_lower_bound(B,C))=greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.19/0.52 12,11 [copy,10,flip.1] {-} greatest_lower_bound(greatest_lower_bound(A,B),C)=greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.19/0.52 22 [] {+} greatest_lower_bound(A,least_upper_bound(A,B))=A.
% 0.19/0.52 32 [] {+} least_upper_bound(a,c)=a.
% 0.19/0.52 34 [] {+} least_upper_bound(b,c)=b.
% 0.19/0.52 36 [] {+} A=A.
% 0.19/0.52 37 [back_demod,1,demod,12] {-} greatest_lower_bound(a,greatest_lower_bound(b,c))!=c.
% 0.19/0.52 40 [para_into,9.1.1,34.1.1,flip.1] {+} least_upper_bound(c,b)=b.
% 0.19/0.52 42 [para_into,9.1.1,32.1.1,flip.1] {+} least_upper_bound(c,a)=a.
% 0.19/0.52 58 [para_into,37.1.1,8.1.1,demod,12] {-} greatest_lower_bound(b,greatest_lower_bound(c,a))!=c.
% 0.19/0.52 82,81 [para_into,22.1.1.2,42.1.1] {+} greatest_lower_bound(c,a)=c.
% 0.19/0.52 84,83 [para_into,22.1.1.2,40.1.1] {-} greatest_lower_bound(c,b)=c.
% 0.19/0.52 93 [back_demod,58,demod,82] {+} greatest_lower_bound(b,c)!=c.
% 0.19/0.52 97 [para_into,93.1.1,8.1.1,demod,84] {-} c!=c.
% 0.19/0.52 98 [binary,97.1,36.1] {+} $F.
% 0.19/0.52
% 0.19/0.52 % SZS output end Refutation
% 0.19/0.52 ------------ end of proof -------------
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Search stopped by max_proofs option.
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Search stopped by max_proofs option.
% 0.19/0.52
% 0.19/0.52 ============ end of search ============
% 0.19/0.52
% 0.19/0.52 ----------- soft-scott stats ----------
% 0.19/0.52
% 0.19/0.52 true clauses given 5 (22.7%)
% 0.19/0.52 false clauses given 17
% 0.19/0.52
% 0.19/0.52 FALSE TRUE
% 0.19/0.52 5 2 1
% 0.19/0.52 7 2 3
% 0.19/0.52 8 1 0
% 0.19/0.52 9 0 6
% 0.19/0.52 11 1 9
% 0.19/0.52 13 6 2
% 0.19/0.52 tot: 12 21 (63.6% true)
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Model 11 (0.00 seconds, 250000 Inserts)
% 0.19/0.52
% 0.19/0.52 That finishes the proof of the theorem.
% 0.19/0.52
% 0.19/0.52 Process 13244 finished Tue Jun 14 02:15:55 2022
%------------------------------------------------------------------------------