TSTP Solution File: RNG015-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : RNG015-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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.62s 0.81s
% Output : Refutation 0.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : RNG015-6 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n017.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 : Mon May 30 13:43:10 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n017.cluster.edu,
% 0.14/0.36 Mon May 30 13:43:10 2022
% 0.14/0.36 The command was "./sos". The process ID is 2979.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.14/0.36
% 0.14/0.36 All clauses are units, and equality is present; the
% 0.14/0.36 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} add(A,B)=add(B,A).
% 0.14/0.36 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 0
% 0.14/0.40 number of clauses initially in problem: 31
% 0.14/0.40 percentage of clauses intially in UL: 0
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 0
% 0.14/0.40 percent of all initial clauses that are short: 100
% 0.14/0.40 absolute distinct symbol count: 10
% 0.14/0.40 distinct predicate count: 1
% 0.14/0.40 distinct function count: 5
% 0.14/0.40 distinct constant count: 4
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 0.62/0.81
% 0.62/0.81 -------- PROOF --------
% 0.62/0.81 % SZS status Unsatisfiable
% 0.62/0.81 % SZS output start Refutation
% 0.62/0.81
% 0.62/0.81 Model 3 (0.00 seconds, 0 Inserts)
% 0.62/0.81
% 0.62/0.81 Stopped by limit on number of solutions
% 0.62/0.81
% 0.62/0.81 Model 4 (0.00 seconds, 0 Inserts)
% 0.62/0.81
% 0.62/0.81 Stopped by limit on number of solutions
% 0.62/0.81
% 0.62/0.81 Model 5 (0.00 seconds, 0 Inserts)
% 0.62/0.81
% 0.62/0.81 Stopped by limit on number of solutions
% 0.62/0.81
% 0.62/0.81 Stopped by limit on insertions
% 0.62/0.81
% 0.62/0.81 Model 6 [ 3 1 1198 ] (0.00 seconds, 250000 Inserts)
% 0.62/0.81
% 0.62/0.81 Stopped by limit on insertions
% 0.62/0.81
% 0.62/0.81 Model 7 [ 6 0 881 ] (0.00 seconds, 250000 Inserts)
% 0.62/0.81
% 0.62/0.81 Stopped by limit on insertions
% 0.62/0.81
% 0.62/0.81 Model 8 [ 9 0 76 ] (0.00 seconds, 250000 Inserts)
% 0.62/0.81
% 0.62/0.81 Stopped by limit on insertions
% 0.62/0.81
% 0.62/0.81 Model 9 [ 5 1 1039 ] (0.00 seconds, 250000 Inserts)
% 0.62/0.81
% 0.62/0.81 Stopped by limit on insertions
% 0.62/0.81
% 0.62/0.81 Model 10 [ 8 0 388 ] (0.00 seconds, 250000 Inserts)
% 0.62/0.81
% 0.62/0.81 Model 11 (0.00 seconds, 250000 Inserts)
% 0.62/0.81
% 0.62/0.81 Stopped by limit on number of solutions
% 0.62/0.81
% 0.62/0.81 ----> UNIT CONFLICT at 0.42 sec ----> 93 [binary,92.1,35.1] {+} $F.
% 0.62/0.81
% 0.62/0.81 Length of proof is 7. Level of proof is 4.
% 0.62/0.81
% 0.62/0.81 ---------------- PROOF ----------------
% 0.62/0.81 % SZS status Unsatisfiable
% 0.62/0.81 % SZS output start Refutation
% 0.62/0.81
% 0.62/0.81 1 [] {-} multiply(x,add(y,additive_inverse(z)))!=add(multiply(x,y),additive_inverse(multiply(x,z))).
% 0.62/0.81 2 [copy,1,flip.1] {-} add(multiply(x,y),additive_inverse(multiply(x,z)))!=multiply(x,add(y,additive_inverse(z))).
% 0.62/0.81 4,3 [] {+} add(additive_identity,A)=A.
% 0.62/0.81 6,5 [] {+} add(A,additive_identity)=A.
% 0.62/0.81 10,9 [] {+} multiply(A,additive_identity)=additive_identity.
% 0.62/0.81 11 [] {+} add(additive_inverse(A),A)=additive_identity.
% 0.62/0.81 13 [] {+} add(A,additive_inverse(A))=additive_identity.
% 0.62/0.81 18,17 [] {-} multiply(A,add(B,C))=add(multiply(A,B),multiply(A,C)).
% 0.62/0.81 22 [] {-} add(A,add(B,C))=add(add(A,B),C).
% 0.62/0.81 23 [copy,22,flip.1] {-} add(add(A,B),C)=add(A,add(B,C)).
% 0.62/0.81 35 [] {+} A=A.
% 0.62/0.81 36 [back_demod,2,demod,18] {+} add(multiply(x,y),additive_inverse(multiply(x,z)))!=add(multiply(x,y),multiply(x,additive_inverse(z))).
% 0.62/0.81 39 [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.62/0.81 58 [para_into,23.1.1.1,11.1.1,demod,4,flip.1] {+} add(additive_inverse(A),add(A,B))=B.
% 0.62/0.81 89,88 [para_into,58.1.1.2,39.1.1,demod,6] {-} additive_inverse(multiply(A,B))=multiply(A,additive_inverse(B)).
% 0.62/0.81 92 [back_demod,36,demod,89] {-} add(multiply(x,y),multiply(x,additive_inverse(z)))!=add(multiply(x,y),multiply(x,additive_inverse(z))).
% 0.62/0.81 93 [binary,92.1,35.1] {+} $F.
% 0.62/0.81
% 0.62/0.81 % SZS output end Refutation
% 0.62/0.81 ------------ end of proof -------------
% 0.62/0.81
% 0.62/0.81
% 0.62/0.81 Search stopped by max_proofs option.
% 0.62/0.81
% 0.62/0.81
% 0.62/0.81 Search stopped by max_proofs option.
% 0.62/0.81
% 0.62/0.81 ============ end of search ============
% 0.62/0.81
% 0.62/0.81 ----------- soft-scott stats ----------
% 0.62/0.81
% 0.62/0.81 true clauses given 2 (11.8%)
% 0.62/0.81 false clauses given 15
% 0.62/0.81
% 0.62/0.81 FALSE TRUE
% 0.62/0.81 8 0 2
% 0.62/0.81 10 2 1
% 0.62/0.81 11 1 4
% 0.62/0.81 12 3 1
% 0.62/0.81 14 4 0
% 0.62/0.81 16 3 0
% 0.62/0.81 17 1 1
% 0.62/0.81 19 2 0
% 0.62/0.81 31 0 2
% 0.62/0.81 tot: 16 11 (40.7% true)
% 0.62/0.81
% 0.62/0.81
% 0.62/0.81 Model 11 (0.00 seconds, 250000 Inserts)
% 0.62/0.81
% 0.62/0.81 That finishes the proof of the theorem.
% 0.62/0.81
% 0.62/0.81 Process 2979 finished Mon May 30 13:43:10 2022
%------------------------------------------------------------------------------