TSTP Solution File: RNG014-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : RNG014-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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.37s 0.57s
% Output : Refutation 0.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG014-6 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon May 30 07:16:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n027.cluster.edu,
% 0.12/0.35 Mon May 30 07:16:46 2022
% 0.12/0.35 The command was "./sos". The process ID is 14984.
% 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 21 during input processing: 0 [copy,21,flip.1] {-} add(A,B)=add(B,A).
% 0.12/0.35 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 1
% 0.19/0.39 number of clauses initially in problem: 31
% 0.19/0.39 percentage of clauses intially in UL: 3
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 55
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 9
% 0.19/0.39 distinct predicate count: 1
% 0.19/0.39 distinct function count: 5
% 0.19/0.39 distinct constant count: 3
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.37/0.57
% 0.37/0.57 -------- PROOF --------
% 0.37/0.57 % SZS status Unsatisfiable
% 0.37/0.57 % SZS output start Refutation
% 0.37/0.57
% 0.37/0.57 Model 3 (0.00 seconds, 0 Inserts)
% 0.37/0.57
% 0.37/0.57 Stopped by limit on number of solutions
% 0.37/0.57
% 0.37/0.57 Model 4 (0.00 seconds, 0 Inserts)
% 0.37/0.57
% 0.37/0.57 Stopped by limit on number of solutions
% 0.37/0.57
% 0.37/0.57 Model 5 (0.00 seconds, 0 Inserts)
% 0.37/0.57
% 0.37/0.57 Stopped by limit on number of solutions
% 0.37/0.57
% 0.37/0.57 Stopped by limit on insertions
% 0.37/0.57
% 0.37/0.57 Model 6 [ 3 0 1097 ] (0.00 seconds, 250000 Inserts)
% 0.37/0.57
% 0.37/0.57 Stopped by limit on insertions
% 0.37/0.57
% 0.37/0.57 Model 7 [ 4 1 589 ] (0.00 seconds, 250000 Inserts)
% 0.37/0.57
% 0.37/0.57 Model 8 (0.00 seconds, 250000 Inserts)
% 0.37/0.57
% 0.37/0.57 Stopped by limit on number of solutions
% 0.37/0.57
% 0.37/0.57 Model 9 (0.00 seconds, 250000 Inserts)
% 0.37/0.57
% 0.37/0.57 Stopped by limit on number of solutions
% 0.37/0.57
% 0.37/0.57 ----> UNIT CONFLICT at 0.18 sec ----> 91 [binary,89.1,2.1] {+} $F.
% 0.37/0.57
% 0.37/0.57 Length of proof is 5. Level of proof is 3.
% 0.37/0.57
% 0.37/0.57 ---------------- PROOF ----------------
% 0.37/0.57 % SZS status Unsatisfiable
% 0.37/0.57 % SZS output start Refutation
% 0.37/0.57
% 0.37/0.57 1 [] {-} multiply(a,additive_inverse(b))!=additive_inverse(multiply(a,b)).
% 0.37/0.57 2 [copy,1,flip.1] {+} additive_inverse(multiply(a,b))!=multiply(a,additive_inverse(b)).
% 0.37/0.57 4,3 [] {+} add(additive_identity,A)=A.
% 0.37/0.57 6,5 [] {+} add(A,additive_identity)=A.
% 0.37/0.57 10,9 [] {+} multiply(A,additive_identity)=additive_identity.
% 0.37/0.57 11 [] {+} add(additive_inverse(A),A)=additive_identity.
% 0.37/0.57 13 [] {+} add(A,additive_inverse(A))=additive_identity.
% 0.37/0.57 17 [] {-} multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 0.37/0.57 22 [] {-} add(A,add(B,C))=add(add(A,B),C).
% 0.37/0.57 23 [copy,22,flip.1] {-} add(add(A,B),C)=add(A,add(B,C)).
% 0.37/0.57 40 [para_into,23.1.1.1,11.1.1,demod,4,flip.1] {+} add(additive_inverse(A),add(A,B))=B.
% 0.37/0.57 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.37/0.57 89 [para_into,40.1.1.2,44.1.1,demod,6] {-} additive_inverse(multiply(A,B))=multiply(A,additive_inverse(B)).
% 0.37/0.57 91 [binary,89.1,2.1] {+} $F.
% 0.37/0.57
% 0.37/0.57 % SZS output end Refutation
% 0.37/0.57 ------------ end of proof -------------
% 0.37/0.57
% 0.37/0.57
% 0.37/0.57 Search stopped by max_proofs option.
% 0.37/0.57
% 0.37/0.57
% 0.37/0.57 Search stopped by max_proofs option.
% 0.37/0.57
% 0.37/0.57 ============ end of search ============
% 0.37/0.57
% 0.37/0.57 ----------- soft-scott stats ----------
% 0.37/0.57
% 0.37/0.57 true clauses given 4 (23.5%)
% 0.37/0.57 false clauses given 13
% 0.37/0.57
% 0.37/0.57 FALSE TRUE
% 0.37/0.57 8 0 2
% 0.37/0.57 10 2 1
% 0.37/0.57 11 2 3
% 0.37/0.57 12 3 1
% 0.37/0.57 14 4 0
% 0.37/0.57 16 4 0
% 0.37/0.57 17 1 0
% 0.37/0.57 19 2 0
% 0.37/0.57 31 0 2
% 0.37/0.57 tot: 18 9 (33.3% true)
% 0.37/0.57
% 0.37/0.57
% 0.37/0.57 Model 9 (0.00 seconds, 250000 Inserts)
% 0.37/0.57
% 0.37/0.57 That finishes the proof of the theorem.
% 0.37/0.57
% 0.37/0.57 Process 14984 finished Mon May 30 07:16:46 2022
%------------------------------------------------------------------------------