TSTP Solution File: GRP186-4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP186-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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.40s 0.57s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP186-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n010.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 : Mon Jun 13 10:38: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 sandbox2 on n010.cluster.edu,
% 0.13/0.36 Mon Jun 13 10:38:55 2022
% 0.13/0.36 The command was "./sos". The process ID is 17913.
% 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 9 during input processing: 0 [copy,9,flip.1] {-} greatest_lower_bound(A,B)=greatest_lower_bound(B,A).
% 0.13/0.36 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.13/0.36 Following clause subsumed by 39 during input processing: 0 [copy,39,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.21/0.40
% 0.21/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.40
% 0.21/0.40 Stopped by limit on number of solutions
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40 -------------- Softie stats --------------
% 0.21/0.40
% 0.21/0.40 UPDATE_STOP: 300
% 0.21/0.40 SFINDER_TIME_LIMIT: 2
% 0.21/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.40 number of clauses in intial UL: 0
% 0.21/0.40 number of clauses initially in problem: 36
% 0.21/0.40 percentage of clauses intially in UL: 0
% 0.21/0.40 percentage of distinct symbols occuring in initial UL: 0
% 0.21/0.40 percent of all initial clauses that are short: 100
% 0.21/0.40 absolute distinct symbol count: 8
% 0.21/0.40 distinct predicate count: 1
% 0.21/0.40 distinct function count: 4
% 0.21/0.40 distinct constant count: 3
% 0.21/0.40
% 0.21/0.40 ---------- no more Softie stats ----------
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40
% 0.21/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.40
% 0.21/0.40 Stopped by limit on number of solutions
% 0.21/0.40
% 0.21/0.40 =========== start of search ===========
% 0.40/0.57
% 0.40/0.57 -------- PROOF --------
% 0.40/0.57 % SZS status Unsatisfiable
% 0.40/0.57 % SZS output start Refutation
% 0.40/0.57
% 0.40/0.57 Model 3 (0.00 seconds, 0 Inserts)
% 0.40/0.57
% 0.40/0.57 Stopped by limit on number of solutions
% 0.40/0.57
% 0.40/0.57 Model 4 (0.00 seconds, 0 Inserts)
% 0.40/0.57
% 0.40/0.57 Stopped by limit on number of solutions
% 0.40/0.57
% 0.40/0.57 Model 5 (0.00 seconds, 0 Inserts)
% 0.40/0.57
% 0.40/0.57 Stopped by limit on number of solutions
% 0.40/0.57
% 0.40/0.57 Model 6 (0.00 seconds, 0 Inserts)
% 0.40/0.57
% 0.40/0.57 Stopped by limit on number of solutions
% 0.40/0.57
% 0.40/0.57 Stopped by limit on insertions
% 0.40/0.57
% 0.40/0.57 Model 7 [ 1 1 187 ] (0.00 seconds, 250000 Inserts)
% 0.40/0.57
% 0.40/0.57 Stopped by limit on insertions
% 0.40/0.57
% 0.40/0.57 Model 8 [ 2 0 293 ] (0.00 seconds, 250000 Inserts)
% 0.40/0.57
% 0.40/0.57 ----> UNIT CONFLICT at 0.18 sec ----> 44 [binary,43.1,10.1] {-} $F.
% 0.40/0.57
% 0.40/0.57 Length of proof is 4. Level of proof is 3.
% 0.40/0.57
% 0.40/0.57 ---------------- PROOF ----------------
% 0.40/0.57 % SZS status Unsatisfiable
% 0.40/0.57 % SZS output start Refutation
% 0.40/0.57
% 0.40/0.57 1 [] {-} least_upper_bound(multiply(a,b),identity)!=multiply(a,least_upper_bound(inverse(a),b)).
% 0.40/0.57 2 [copy,1,flip.1] {-} multiply(a,least_upper_bound(inverse(a),b))!=least_upper_bound(multiply(a,b),identity).
% 0.40/0.57 5 [] {+} multiply(inverse(A),A)=identity.
% 0.40/0.57 10 [] {-} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.40/0.57 26,25 [] {-} multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.40/0.57 35 [] {+} inverse(inverse(A))=A.
% 0.40/0.57 40 [back_demod,2,demod,26] {-} least_upper_bound(multiply(a,inverse(a)),multiply(a,b))!=least_upper_bound(multiply(a,b),identity).
% 0.40/0.57 42,41 [para_from,35.1.1,5.1.1.1] {-} multiply(A,inverse(A))=identity.
% 0.40/0.57 43 [back_demod,40,demod,42,flip.1] {-} least_upper_bound(multiply(a,b),identity)!=least_upper_bound(identity,multiply(a,b)).
% 0.40/0.57 44 [binary,43.1,10.1] {-} $F.
% 0.40/0.57
% 0.40/0.57 % SZS output end Refutation
% 0.40/0.57 ------------ end of proof -------------
% 0.40/0.57
% 0.40/0.57
% 0.40/0.57 Search stopped by max_proofs option.
% 0.40/0.57
% 0.40/0.57
% 0.40/0.57 Search stopped by max_proofs option.
% 0.40/0.57
% 0.40/0.57 ============ end of search ============
% 0.40/0.57
% 0.40/0.57 ----------- soft-scott stats ----------
% 0.40/0.57
% 0.40/0.57 true clauses given 1 (12.5%)
% 0.40/0.57 false clauses given 7
% 0.40/0.57
% 0.40/0.57 FALSE TRUE
% 0.40/0.57 7 3 0
% 0.40/0.57 10 1 0
% 0.40/0.57 11 3 0
% 0.40/0.57 13 4 0
% 0.40/0.57 14 1 0
% 0.40/0.57 tot: 12 0 (0.0% true)
% 0.40/0.57
% 0.40/0.57
% 0.40/0.57 Model 8 [ 2 0 293 ] (0.00 seconds, 250000 Inserts)
% 0.40/0.57
% 0.40/0.57 That finishes the proof of the theorem.
% 0.40/0.57
% 0.40/0.57 Process 17913 finished Mon Jun 13 10:38:55 2022
%------------------------------------------------------------------------------