TSTP Solution File: RNG012-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : RNG012-6 : TPTP v8.1.0. Released v1.0.0.
% 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 : Mon Jul 18 20:40:54 EDT 2022
% Result : Unsatisfiable 0.61s 0.82s
% Output : Refutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG012-6 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 05:48:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n029.cluster.edu,
% 0.12/0.35 Mon May 30 05:48:14 2022
% 0.12/0.35 The command was "./sos". The process ID is 30776.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.12/0.35
% 0.12/0.35 All clauses are units, and equality is present; the
% 0.12/0.35 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} add(A,B)=add(B,A).
% 0.12/0.35 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 1
% 0.12/0.39 number of clauses initially in problem: 31
% 0.12/0.39 percentage of clauses intially in UL: 3
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 55
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 9
% 0.12/0.39 distinct predicate count: 1
% 0.12/0.39 distinct function count: 5
% 0.12/0.39 distinct constant count: 3
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.61/0.82
% 0.61/0.82 -------- PROOF --------
% 0.61/0.82 % SZS status Unsatisfiable
% 0.61/0.82 % SZS output start Refutation
% 0.61/0.82
% 0.61/0.82 Model 3 (0.00 seconds, 0 Inserts)
% 0.61/0.82
% 0.61/0.82 Stopped by limit on number of solutions
% 0.61/0.82
% 0.61/0.82 Model 4 (0.00 seconds, 0 Inserts)
% 0.61/0.82
% 0.61/0.82 Stopped by limit on number of solutions
% 0.61/0.82
% 0.61/0.82 Model 5 (0.00 seconds, 0 Inserts)
% 0.61/0.82
% 0.61/0.82 Stopped by limit on number of solutions
% 0.61/0.82
% 0.61/0.82 Stopped by limit on insertions
% 0.61/0.82
% 0.61/0.82 Model 6 [ 6 0 752 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.82
% 0.61/0.82 Stopped by limit on insertions
% 0.61/0.82
% 0.61/0.82 Model 7 [ 1 0 1196 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.82
% 0.61/0.82 Stopped by limit on insertions
% 0.61/0.82
% 0.61/0.82 Stopped by limit on insertions
% 0.61/0.82
% 0.61/0.82 Stopped by limit on insertions
% 0.61/0.82
% 0.61/0.82 Model 8 [ 9 0 203 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.82
% 0.61/0.82 Model 9 (0.00 seconds, 250000 Inserts)
% 0.61/0.82
% 0.61/0.82 Stopped by limit on number of solutions
% 0.61/0.82
% 0.61/0.82 ----> UNIT CONFLICT at 0.45 sec ----> 127 [binary,125.1,1.1] {+} $F.
% 0.61/0.82
% 0.61/0.82 Length of proof is 7. Level of proof is 5.
% 0.61/0.82
% 0.61/0.82 ---------------- PROOF ----------------
% 0.61/0.82 % SZS status Unsatisfiable
% 0.61/0.82 % SZS output start Refutation
% 0.61/0.82
% 0.61/0.82 1 [] {+} multiply(additive_inverse(a),additive_inverse(b))!=multiply(a,b).
% 0.61/0.82 3,2 [] {+} add(additive_identity,A)=A.
% 0.61/0.82 5,4 [] {+} add(A,additive_identity)=A.
% 0.61/0.82 7,6 [] {+} multiply(additive_identity,A)=additive_identity.
% 0.61/0.82 9,8 [] {+} multiply(A,additive_identity)=additive_identity.
% 0.61/0.82 10 [] {+} add(additive_inverse(A),A)=additive_identity.
% 0.61/0.82 12 [] {-} add(A,additive_inverse(A))=additive_identity.
% 0.61/0.82 14 [] {-} additive_inverse(additive_inverse(A))=A.
% 0.61/0.82 16 [] {-} multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 0.61/0.82 18 [] {-} multiply(add(A,B),C)=add(multiply(A,C),multiply(B,C)).
% 0.61/0.82 21 [] {-} add(A,add(B,C))=add(add(A,B),C).
% 0.61/0.82 22 [copy,21,flip.1] {-} add(add(A,B),C)=add(A,add(B,C)).
% 0.61/0.82 37 [para_into,16.1.1.2,12.1.1,demod,9,flip.1] {-} add(multiply(A,B),multiply(A,additive_inverse(B)))=additive_identity.
% 0.61/0.82 56 [para_into,22.1.1.1,10.1.1,demod,3,flip.1] {+} add(additive_inverse(A),add(A,B))=B.
% 0.61/0.82 74 [para_into,18.1.1.1,12.1.1,demod,7,flip.1] {-} add(multiply(A,B),multiply(additive_inverse(A),B))=additive_identity.
% 0.61/0.82 87,86 [para_into,56.1.1.2,37.1.1,demod,5] {-} additive_inverse(multiply(A,B))=multiply(A,additive_inverse(B)).
% 0.61/0.82 106 [para_from,74.1.1,56.1.1.2,demod,87,5] {-} multiply(A,additive_inverse(B))=multiply(additive_inverse(A),B).
% 0.61/0.82 125 [para_into,106.1.1.2,14.1.1,flip.1] {-} multiply(additive_inverse(A),additive_inverse(B))=multiply(A,B).
% 0.61/0.82 127 [binary,125.1,1.1] {+} $F.
% 0.61/0.82
% 0.61/0.82 % SZS output end Refutation
% 0.61/0.82 ------------ end of proof -------------
% 0.61/0.82
% 0.61/0.82
% 0.61/0.82 Search stopped by max_proofs option.
% 0.61/0.82
% 0.61/0.82
% 0.61/0.82 Search stopped by max_proofs option.
% 0.61/0.82
% 0.61/0.82 ============ end of search ============
% 0.61/0.82
% 0.61/0.82 ----------- soft-scott stats ----------
% 0.61/0.82
% 0.61/0.82 true clauses given 2 (9.1%)
% 0.61/0.82 false clauses given 20
% 0.61/0.82
% 0.61/0.82 FALSE TRUE
% 0.61/0.82 8 0 2
% 0.61/0.82 9 1 0
% 0.61/0.82 10 1 1
% 0.61/0.82 11 0 4
% 0.61/0.82 12 5 2
% 0.61/0.82 13 2 0
% 0.61/0.82 14 6 0
% 0.61/0.82 15 1 1
% 0.61/0.82 16 5 0
% 0.61/0.82 17 2 0
% 0.61/0.82 18 2 0
% 0.61/0.82 19 3 0
% 0.61/0.82 31 0 2
% 0.61/0.82 47 1 0
% 0.61/0.82 tot: 29 12 (29.3% true)
% 0.61/0.82
% 0.61/0.82
% 0.61/0.82 Model 9 (0.00 seconds, 250000 Inserts)
% 0.61/0.82
% 0.61/0.82 That finishes the proof of the theorem.
% 0.61/0.82
% 0.61/0.82 Process 30776 finished Mon May 30 05:48:14 2022
%------------------------------------------------------------------------------