TSTP Solution File: GRP157-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP157-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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.19s 0.55s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP157-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 20:54:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n012.cluster.edu,
% 0.13/0.35 Mon Jun 13 20:54:40 2022
% 0.13/0.35 The command was "./sos". The process ID is 32636.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.13/0.35
% 0.13/0.35 All clauses are units, and equality is present; the
% 0.13/0.35 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/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.13/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.13/0.35 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= 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: 1
% 0.13/0.39 number of clauses initially in problem: 32
% 0.13/0.39 percentage of clauses intially in UL: 3
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 66
% 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.55
% 0.19/0.55 -------- PROOF --------
% 0.19/0.55 % SZS status Unsatisfiable
% 0.19/0.55 % SZS output start Refutation
% 0.19/0.55
% 0.19/0.55 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.55
% 0.19/0.55 Stopped by limit on number of solutions
% 0.19/0.55
% 0.19/0.55 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.55
% 0.19/0.55 Stopped by limit on number of solutions
% 0.19/0.55
% 0.19/0.55 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.55
% 0.19/0.55 Stopped by limit on number of solutions
% 0.19/0.55
% 0.19/0.55 Stopped by limit on insertions
% 0.19/0.55
% 0.19/0.55 Model 6 [ 2 0 84 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.55
% 0.19/0.55 Model 7 (0.00 seconds, 250000 Inserts)
% 0.19/0.55
% 0.19/0.55 Stopped by limit on number of solutions
% 0.19/0.55
% 0.19/0.55 Model 8 (0.00 seconds, 250000 Inserts)
% 0.19/0.55
% 0.19/0.55 Stopped by limit on number of solutions
% 0.19/0.55
% 0.19/0.55 Model 9 (0.00 seconds, 250000 Inserts)
% 0.19/0.55
% 0.19/0.55 Stopped by limit on number of solutions
% 0.19/0.55
% 0.19/0.55 Model 10 (0.00 seconds, 250000 Inserts)
% 0.19/0.55
% 0.19/0.55 Stopped by limit on number of solutions
% 0.19/0.55
% 0.19/0.55 Model 11 (0.00 seconds, 250000 Inserts)
% 0.19/0.55
% 0.19/0.55 Stopped by limit on number of solutions
% 0.19/0.55
% 0.19/0.55 ----> UNIT CONFLICT at 0.17 sec ----> 62 [binary,60.1,37.1] {+} $F.
% 0.19/0.55
% 0.19/0.55 Length of proof is 3. Level of proof is 2.
% 0.19/0.55
% 0.19/0.55 ---------------- PROOF ----------------
% 0.19/0.55 % SZS status Unsatisfiable
% 0.19/0.55 % SZS output start Refutation
% 0.19/0.55
% 0.19/0.55 1 [] {+} least_upper_bound(multiply(c,a),multiply(c,b))!=multiply(c,b).
% 0.19/0.55 9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.19/0.55 24 [] {-} multiply(A,least_upper_bound(B,C))=least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.19/0.55 32 [] {+} least_upper_bound(a,b)=b.
% 0.19/0.55 35 [para_into,9.1.1,32.1.1,flip.1] {+} least_upper_bound(b,a)=b.
% 0.19/0.55 37 [para_from,9.1.1,1.1.1] {+} least_upper_bound(multiply(c,b),multiply(c,a))!=multiply(c,b).
% 0.19/0.55 60 [para_into,24.1.1.2,35.1.1,flip.1] {-} least_upper_bound(multiply(A,b),multiply(A,a))=multiply(A,b).
% 0.19/0.55 62 [binary,60.1,37.1] {+} $F.
% 0.19/0.55
% 0.19/0.55 % SZS output end Refutation
% 0.19/0.55 ------------ end of proof -------------
% 0.19/0.55
% 0.19/0.55
% 0.19/0.55 Search stopped by max_proofs option.
% 0.19/0.55
% 0.19/0.55
% 0.19/0.55 Search stopped by max_proofs option.
% 0.19/0.55
% 0.19/0.55 ============ end of search ============
% 0.19/0.55
% 0.19/0.55 ----------- soft-scott stats ----------
% 0.19/0.55
% 0.19/0.55 true clauses given 3 (20.0%)
% 0.19/0.55 false clauses given 12
% 0.19/0.55
% 0.19/0.55 FALSE TRUE
% 0.19/0.55 5 0 2
% 0.19/0.55 6 0 1
% 0.19/0.55 7 0 4
% 0.19/0.55 9 0 1
% 0.19/0.55 11 0 3
% 0.19/0.55 12 0 1
% 0.19/0.55 13 3 0
% 0.19/0.55 tot: 3 12 (80.0% true)
% 0.19/0.55
% 0.19/0.55
% 0.19/0.55 Model 11 (0.00 seconds, 250000 Inserts)
% 0.19/0.55
% 0.19/0.55 That finishes the proof of the theorem.
% 0.19/0.55
% 0.19/0.55 Process 32636 finished Mon Jun 13 20:54:40 2022
%------------------------------------------------------------------------------