TSTP Solution File: RNG013-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : RNG013-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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.75s 0.94s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : RNG013-6 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon May 30 12:33:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n024.cluster.edu,
% 0.13/0.36 Mon May 30 12:33:21 2022
% 0.13/0.36 The command was "./sos". The process ID is 4955.
% 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 21 during input processing: 0 [copy,21,flip.1] {-} add(A,B)=add(B,A).
% 0.13/0.36 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 1
% 0.19/0.40 number of clauses initially in problem: 31
% 0.19/0.40 percentage of clauses intially in UL: 3
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 55
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 9
% 0.19/0.40 distinct predicate count: 1
% 0.19/0.40 distinct function count: 5
% 0.19/0.40 distinct constant count: 3
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.75/0.94
% 0.75/0.94 -------- PROOF --------
% 0.75/0.94 % SZS status Unsatisfiable
% 0.75/0.94 % SZS output start Refutation
% 0.75/0.94
% 0.75/0.94 Model 3 (0.00 seconds, 0 Inserts)
% 0.75/0.94
% 0.75/0.94 Stopped by limit on number of solutions
% 0.75/0.94
% 0.75/0.94 Model 4 (0.00 seconds, 0 Inserts)
% 0.75/0.94
% 0.75/0.94 Stopped by limit on number of solutions
% 0.75/0.94
% 0.75/0.94 Model 5 (0.00 seconds, 0 Inserts)
% 0.75/0.94
% 0.75/0.94 Stopped by limit on number of solutions
% 0.75/0.94
% 0.75/0.94 Stopped by limit on insertions
% 0.75/0.94
% 0.75/0.94 Model 6 [ 6 0 1045 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.94
% 0.75/0.94 Stopped by limit on insertions
% 0.75/0.94
% 0.75/0.94 Model 7 [ 2 0 340 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.94
% 0.75/0.94 Stopped by limit on insertions
% 0.75/0.94
% 0.75/0.94 Model 8 [ 7 0 419 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.94
% 0.75/0.94 Stopped by limit on insertions
% 0.75/0.94
% 0.75/0.94 Model 9 [ 1 1 611 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.94
% 0.75/0.94 Stopped by limit on insertions
% 0.75/0.94
% 0.75/0.94 Model 10 [ 13 1 643 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.94
% 0.75/0.94 Stopped by limit on insertions
% 0.75/0.94
% 0.75/0.94 Model 11 [ 12 1 136 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.94
% 0.75/0.94 Stopped by limit on insertions
% 0.75/0.94
% 0.75/0.94 Model 12 [ 11 1 1033 ] (0.00 seconds, 250000 Inserts)
% 0.75/0.94
% 0.75/0.94 Model 13 (0.00 seconds, 250000 Inserts)
% 0.75/0.94
% 0.75/0.94 Stopped by limit on number of solutions
% 0.75/0.94
% 0.75/0.94 ----> UNIT CONFLICT at 0.55 sec ----> 149 [binary,148.1,113.1] {-} $F.
% 0.75/0.94
% 0.75/0.94 Length of proof is 8. Level of proof is 4.
% 0.75/0.94
% 0.75/0.94 ---------------- PROOF ----------------
% 0.75/0.94 % SZS status Unsatisfiable
% 0.75/0.94 % SZS output start Refutation
% 0.75/0.94
% 0.75/0.94 1 [] {-} multiply(additive_inverse(a),b)!=additive_inverse(multiply(a,b)).
% 0.75/0.94 2 [copy,1,flip.1] {+} additive_inverse(multiply(a,b))!=multiply(additive_inverse(a),b).
% 0.75/0.94 4,3 [] {+} add(additive_identity,A)=A.
% 0.75/0.94 6,5 [] {+} add(A,additive_identity)=A.
% 0.75/0.94 8,7 [] {+} multiply(additive_identity,A)=additive_identity.
% 0.75/0.94 10,9 [] {+} multiply(A,additive_identity)=additive_identity.
% 0.75/0.94 11 [] {+} add(additive_inverse(A),A)=additive_identity.
% 0.75/0.94 13 [] {+} add(A,additive_inverse(A))=additive_identity.
% 0.75/0.94 17 [] {-} multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 0.75/0.94 19 [] {-} multiply(add(A,B),C)=add(multiply(A,C),multiply(B,C)).
% 0.75/0.94 22 [] {-} add(A,add(B,C))=add(add(A,B),C).
% 0.75/0.94 23 [copy,22,flip.1] {-} add(add(A,B),C)=add(A,add(B,C)).
% 0.75/0.94 40 [para_into,23.1.1.1,11.1.1,demod,4,flip.1] {+} add(additive_inverse(A),add(A,B))=B.
% 0.75/0.94 44 [para_into,17.1.1.2,13.1.1,demod,10,flip.1] {-} add(multiply(A,B),multiply(A,additive_inverse(B)))=additive_identity.
% 0.75/0.94 79 [para_into,19.1.1.1,13.1.1,demod,8,flip.1] {-} add(multiply(A,B),multiply(additive_inverse(A),B))=additive_identity.
% 0.75/0.94 102,101 [para_from,44.1.1,40.1.1.2,demod,6] {-} additive_inverse(multiply(A,B))=multiply(A,additive_inverse(B)).
% 0.75/0.94 113 [back_demod,2,demod,102] {+} multiply(a,additive_inverse(b))!=multiply(additive_inverse(a),b).
% 0.75/0.94 148 [para_from,79.1.1,40.1.1.2,demod,102,6] {-} multiply(A,additive_inverse(B))=multiply(additive_inverse(A),B).
% 0.75/0.94 149 [binary,148.1,113.1] {-} $F.
% 0.75/0.94
% 0.75/0.94 % SZS output end Refutation
% 0.75/0.94 ------------ end of proof -------------
% 0.75/0.94
% 0.75/0.94
% 0.75/0.94 Search stopped by max_proofs option.
% 0.75/0.94
% 0.75/0.94
% 0.75/0.94 Search stopped by max_proofs option.
% 0.75/0.94
% 0.75/0.94 ============ end of search ============
% 0.75/0.94
% 0.75/0.94 ----------- soft-scott stats ----------
% 0.75/0.95
% 0.75/0.95 true clauses given 3 (13.0%)
% 0.75/0.95 false clauses given 20
% 0.75/0.95
% 0.75/0.95 FALSE TRUE
% 0.75/0.95 9 0 3
% 0.75/0.95 10 1 1
% 0.75/0.95 11 1 3
% 0.75/0.95 12 6 7
% 0.75/0.95 13 2 0
% 0.75/0.95 14 4 0
% 0.75/0.95 15 1 1
% 0.75/0.95 16 10 0
% 0.75/0.95 17 2 0
% 0.75/0.95 18 2 0
% 0.75/0.95 19 1 0
% 0.75/0.95 31 0 2
% 0.75/0.95 47 1 0
% 0.75/0.95 tot: 31 17 (35.4% true)
% 0.75/0.95
% 0.75/0.95
% 0.75/0.95 Model 13 (0.00 seconds, 250000 Inserts)
% 0.75/0.95
% 0.75/0.95 That finishes the proof of the theorem.
% 0.75/0.95
% 0.75/0.95 Process 4955 finished Mon May 30 12:33:22 2022
%------------------------------------------------------------------------------