TSTP Solution File: RNG001-4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : RNG001-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:52 EDT 2022
% Result : Unsatisfiable 0.59s 0.78s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : RNG001-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.32 % Computer : n025.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon May 30 19:20:42 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox2 on n025.cluster.edu,
% 0.12/0.34 Mon May 30 19:20:42 2022
% 0.12/0.34 The command was "./sos". The process ID is 12736.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 0.12/0.34
% 0.12/0.34 This is a Horn set with equality. The strategy will be
% 0.12/0.34 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.34 sos and nonpositive clauses in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(knuth_bendix).
% 0.12/0.34 dependent: set(para_from).
% 0.12/0.34 dependent: set(para_into).
% 0.12/0.34 dependent: clear(para_from_right).
% 0.12/0.34 dependent: clear(para_into_right).
% 0.12/0.34 dependent: set(para_from_vars).
% 0.12/0.34 dependent: set(eq_units_both_ways).
% 0.12/0.34 dependent: set(dynamic_demod_all).
% 0.12/0.34 dependent: set(dynamic_demod).
% 0.12/0.34 dependent: set(order_eq).
% 0.12/0.34 dependent: set(back_demod).
% 0.12/0.34 dependent: set(lrpo).
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: clear(order_hyper).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.18/0.40
% 0.18/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.40
% 0.18/0.40 Stopped by limit on number of solutions
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 -------------- Softie stats --------------
% 0.18/0.40
% 0.18/0.40 UPDATE_STOP: 300
% 0.18/0.40 SFINDER_TIME_LIMIT: 2
% 0.18/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.40 number of clauses in intial UL: 14
% 0.18/0.40 number of clauses initially in problem: 21
% 0.18/0.40 percentage of clauses intially in UL: 66
% 0.18/0.40 percentage of distinct symbols occuring in initial UL: 62
% 0.18/0.40 percent of all initial clauses that are short: 100
% 0.18/0.40 absolute distinct symbol count: 8
% 0.18/0.40 distinct predicate count: 3
% 0.18/0.40 distinct function count: 3
% 0.18/0.40 distinct constant count: 2
% 0.18/0.40
% 0.18/0.40 ---------- no more Softie stats ----------
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.40
% 0.18/0.40 Stopped by limit on number of solutions
% 0.18/0.40
% 0.18/0.40 =========== start of search ===========
% 0.59/0.78
% 0.59/0.78 -------- PROOF --------
% 0.59/0.78 % SZS status Unsatisfiable
% 0.59/0.78 % SZS output start Refutation
% 0.59/0.78
% 0.59/0.78 Model 3 (0.00 seconds, 0 Inserts)
% 0.59/0.78
% 0.59/0.78 Stopped by limit on number of solutions
% 0.59/0.78
% 0.59/0.78 Stopped by limit on insertions
% 0.59/0.78
% 0.59/0.78 Model 4 [ 4 1 640 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.78
% 0.59/0.78 Model 5 [ 2 2 1805 ] (0.00 seconds, 14464 Inserts)
% 0.59/0.78
% 0.59/0.78 Stopped by limit on insertions
% 0.59/0.78
% 0.59/0.78 Model 6 [ 6 2 1030 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.78
% 0.59/0.78 Stopped by limit on insertions
% 0.59/0.78
% 0.59/0.78 Model 7 [ 4 10 117370 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.78
% 0.59/0.78 ----> UNIT CONFLICT at 0.41 sec ----> 87 [binary,86.1,14.1] {-} $F.
% 0.59/0.78
% 0.59/0.78 Length of proof is 3. Level of proof is 3.
% 0.59/0.78
% 0.59/0.78 ---------------- PROOF ----------------
% 0.59/0.78 % SZS status Unsatisfiable
% 0.59/0.78 % SZS output start Refutation
% 0.59/0.78
% 0.59/0.78 6 [] {+} -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -product(A,F,G)|sum(C,E,G).
% 0.59/0.78 7 [] {+} -product(A,B,C)| -product(A,D,E)| -sum(B,D,F)| -sum(C,E,G)|product(A,F,G).
% 0.59/0.78 13 [] {+} -sum(A,B,C)| -sum(D,B,C)|A=D.
% 0.59/0.78 14 [] {+} -product(a,additive_identity,additive_identity).
% 0.59/0.78 15 [] {+} sum(additive_identity,A,A).
% 0.59/0.78 16 [] {+} sum(A,additive_identity,A).
% 0.59/0.78 17 [] {+} product(A,B,multiply(A,B)).
% 0.59/0.78 40 [hyper,17,6,17,17,15] {+} sum(multiply(A,additive_identity),multiply(A,B),multiply(A,B)).
% 0.59/0.78 83,82 [hyper,40,13,15,flip.1] {-} multiply(A,additive_identity)=additive_identity.
% 0.59/0.78 86 [hyper,40,7,17,17,16,demod,83] {-} product(A,additive_identity,additive_identity).
% 0.59/0.78 87 [binary,86.1,14.1] {-} $F.
% 0.59/0.78
% 0.59/0.78 % SZS output end Refutation
% 0.59/0.78 ------------ end of proof -------------
% 0.59/0.78
% 0.59/0.78
% 0.59/0.78 Search stopped by max_proofs option.
% 0.59/0.78
% 0.59/0.78
% 0.59/0.78 Search stopped by max_proofs option.
% 0.59/0.78
% 0.59/0.78 ============ end of search ============
% 0.59/0.78
% 0.59/0.78 ----------- soft-scott stats ----------
% 0.59/0.78
% 0.59/0.78 true clauses given 1 (14.3%)
% 0.59/0.78 false clauses given 6
% 0.59/0.78
% 0.59/0.78 FALSE TRUE
% 0.59/0.78 4 0 1
% 0.59/0.78 5 0 3
% 0.59/0.78 6 1 3
% 0.59/0.78 7 2 0
% 0.59/0.78 9 3 0
% 0.59/0.78 10 8 3
% 0.59/0.78 11 2 2
% 0.59/0.78 12 4 8
% 0.59/0.78 13 0 8
% 0.59/0.78 14 8 0
% 0.59/0.78 tot: 28 28 (50.0% true)
% 0.59/0.78
% 0.59/0.78
% 0.59/0.78 Model 7 [ 4 10 117370 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.78
% 0.59/0.78 That finishes the proof of the theorem.
% 0.59/0.78
% 0.59/0.78 Process 12736 finished Mon May 30 19:20:43 2022
%------------------------------------------------------------------------------