TSTP Solution File: GRP166-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GRP166-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:01 EDT 2022
% Result : Unsatisfiable 0.70s 0.87s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP166-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n005.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 01:52:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.36 ----- Otter 3.2, August 2001 -----
% 0.21/0.36 The process was started by sandbox on n005.cluster.edu,
% 0.21/0.36 Tue Jun 14 01:52:54 2022
% 0.21/0.36 The command was "./sos". The process ID is 10996.
% 0.21/0.36
% 0.21/0.36 set(prolog_style_variables).
% 0.21/0.36 set(auto).
% 0.21/0.36 dependent: set(auto1).
% 0.21/0.36 dependent: set(process_input).
% 0.21/0.36 dependent: clear(print_kept).
% 0.21/0.36 dependent: clear(print_new_demod).
% 0.21/0.36 dependent: clear(print_back_demod).
% 0.21/0.36 dependent: clear(print_back_sub).
% 0.21/0.36 dependent: set(control_memory).
% 0.21/0.36 dependent: assign(max_mem, 12000).
% 0.21/0.36 dependent: assign(pick_given_ratio, 4).
% 0.21/0.36 dependent: assign(stats_level, 1).
% 0.21/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.36 dependent: assign(sos_limit, 5000).
% 0.21/0.36 dependent: assign(max_weight, 60).
% 0.21/0.36 clear(print_given).
% 0.21/0.36
% 0.21/0.36 list(usable).
% 0.21/0.36
% 0.21/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.21/0.36
% 0.21/0.36 All clauses are units, and equality is present; the
% 0.21/0.36 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.21/0.36
% 0.21/0.36 dependent: set(knuth_bendix).
% 0.21/0.36 dependent: set(para_from).
% 0.21/0.36 dependent: set(para_into).
% 0.21/0.36 dependent: clear(para_from_right).
% 0.21/0.36 dependent: clear(para_into_right).
% 0.21/0.36 dependent: set(para_from_vars).
% 0.21/0.36 dependent: set(eq_units_both_ways).
% 0.21/0.36 dependent: set(dynamic_demod_all).
% 0.21/0.36 dependent: set(dynamic_demod).
% 0.21/0.36 dependent: set(order_eq).
% 0.21/0.36 dependent: set(back_demod).
% 0.21/0.36 dependent: set(lrpo).
% 0.21/0.36
% 0.21/0.36 ------------> process usable:
% 0.21/0.36
% 0.21/0.36 ------------> process sos:
% 0.21/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.21/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.21/0.36 Following clause subsumed by 36 during input processing: 0 [copy,36,flip.1] {-} A=A.
% 0.21/0.36
% 0.21/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: 1
% 0.21/0.40 number of clauses initially in problem: 34
% 0.21/0.40 percentage of clauses intially in UL: 2
% 0.21/0.40 percentage of distinct symbols occuring in initial UL: 62
% 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.70/0.87
% 0.70/0.87 -------- PROOF --------
% 0.70/0.87 % SZS status Unsatisfiable
% 0.70/0.87 % SZS output start Refutation
% 0.70/0.87
% 0.70/0.87 Model 3 (0.00 seconds, 0 Inserts)
% 0.70/0.87
% 0.70/0.87 Stopped by limit on number of solutions
% 0.70/0.87
% 0.70/0.87 Model 4 (0.00 seconds, 0 Inserts)
% 0.70/0.87
% 0.70/0.87 Stopped by limit on number of solutions
% 0.70/0.87
% 0.70/0.87 Model 5 (0.00 seconds, 0 Inserts)
% 0.70/0.87
% 0.70/0.87 Stopped by limit on number of solutions
% 0.70/0.87
% 0.70/0.87 Stopped by limit on insertions
% 0.70/0.87
% 0.70/0.87 Model 6 [ 3 0 206 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.87
% 0.70/0.87 Stopped by limit on insertions
% 0.70/0.87
% 0.70/0.87 Model 7 [ 3 1 65 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.87
% 0.70/0.87 Stopped by limit on insertions
% 0.70/0.87
% 0.70/0.87 Model 8 [ 1 1 171 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.87
% 0.70/0.87 Stopped by limit on insertions
% 0.70/0.87
% 0.70/0.87 Model 9 [ 2 1 1008 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.87
% 0.70/0.87 Model 10 (0.00 seconds, 250000 Inserts)
% 0.70/0.87
% 0.70/0.87 Stopped by limit on number of solutions
% 0.70/0.87
% 0.70/0.87 Model 11 (0.00 seconds, 250000 Inserts)
% 0.70/0.87
% 0.70/0.87 Stopped by limit on number of solutions
% 0.70/0.87
% 0.70/0.87 Model 12 (0.00 seconds, 250000 Inserts)
% 0.70/0.87
% 0.70/0.87 Stopped by limit on number of solutions
% 0.70/0.87
% 0.70/0.87 Model 13 [ 1 6 119113 ] (0.00 seconds, 223334 Inserts)
% 0.70/0.87
% 0.70/0.87 Model 14 [ 1 1 9684 ] (0.00 seconds, 159587 Inserts)
% 0.70/0.87
% 0.70/0.87 ----> UNIT CONFLICT at 0.48 sec ----> 190 [binary,188.1,1.1] {+} $F.
% 0.70/0.87
% 0.70/0.87 Length of proof is 2. Level of proof is 2.
% 0.70/0.87
% 0.70/0.87 ---------------- PROOF ----------------
% 0.70/0.87 % SZS status Unsatisfiable
% 0.70/0.87 % SZS output start Refutation
% 0.70/0.87
% 0.70/0.87 1 [] {+} least_upper_bound(a,multiply(b,a))!=multiply(b,a).
% 0.70/0.87 3,2 [] {+} multiply(identity,A)=A.
% 0.70/0.87 9 [] {+} least_upper_bound(A,B)=least_upper_bound(B,A).
% 0.70/0.87 28 [] {-} multiply(least_upper_bound(A,B),C)=least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/0.87 34 [] {+} least_upper_bound(b,identity)=b.
% 0.70/0.87 37 [para_into,9.1.1,34.1.1,flip.1] {+} least_upper_bound(identity,b)=b.
% 0.70/0.87 188 [para_into,28.1.1.1,37.1.1,demod,3,flip.1] {-} least_upper_bound(A,multiply(b,A))=multiply(b,A).
% 0.70/0.87 190 [binary,188.1,1.1] {+} $F.
% 0.70/0.87
% 0.70/0.87 % SZS output end Refutation
% 0.70/0.87 ------------ end of proof -------------
% 0.70/0.87
% 0.70/0.87
% 0.70/0.87 Search stopped by max_proofs option.
% 0.70/0.87
% 0.70/0.87
% 0.70/0.87 Search stopped by max_proofs option.
% 0.70/0.87
% 0.70/0.87 ============ end of search ============
% 0.70/0.87
% 0.70/0.87 ----------- soft-scott stats ----------
% 0.70/0.87
% 0.70/0.87 true clauses given 4 (12.9%)
% 0.70/0.87 false clauses given 27
% 0.70/0.87
% 0.70/0.87 FALSE TRUE
% 0.70/0.87 4 0 1
% 0.70/0.87 5 0 2
% 0.70/0.87 6 0 1
% 0.70/0.87 7 2 6
% 0.70/0.87 9 4 11
% 0.70/0.87 11 7 15
% 0.70/0.87 12 1 0
% 0.70/0.87 13 3 4
% 0.70/0.87 15 3 0
% 0.70/0.87 17 2 0
% 0.70/0.87 tot: 22 40 (64.5% true)
% 0.70/0.87
% 0.70/0.87
% 0.70/0.87 Model 14 [ 1 1 9684 ] (0.00 seconds, 159587 Inserts)
% 0.70/0.87
% 0.70/0.87 That finishes the proof of the theorem.
% 0.70/0.87
% 0.70/0.87 Process 10996 finished Tue Jun 14 01:52:54 2022
%------------------------------------------------------------------------------