TSTP Solution File: HEN003-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HEN003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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 : Sat Jul 16 13:02:40 EDT 2022
% Result : Unsatisfiable 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : HEN003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n013.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 : Fri Jul 1 13:46:29 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n013.cluster.edu,
% 0.14/0.36 Fri Jul 1 13:46:29 2022
% 0.14/0.36 The command was "./sos". The process ID is 13826.
% 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=6.
% 0.14/0.36
% 0.14/0.36 This is a Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.36 sos and nonpositive clauses in usable.
% 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 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 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 11 during input processing: 0 [copy,11,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.38
% 0.14/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.38
% 0.14/0.38 Stopped by limit on number of solutions
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 -------------- Softie stats --------------
% 0.14/0.38
% 0.14/0.38 UPDATE_STOP: 300
% 0.14/0.38 SFINDER_TIME_LIMIT: 2
% 0.14/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.38 number of clauses in intial UL: 7
% 0.14/0.38 number of clauses initially in problem: 11
% 0.14/0.38 percentage of clauses intially in UL: 63
% 0.14/0.38 percentage of distinct symbols occuring in initial UL: 71
% 0.14/0.38 percent of all initial clauses that are short: 100
% 0.14/0.38 absolute distinct symbol count: 7
% 0.14/0.38 distinct predicate count: 3
% 0.14/0.38 distinct function count: 1
% 0.14/0.38 distinct constant count: 3
% 0.14/0.38
% 0.14/0.38 ---------- no more Softie stats ----------
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 =========== start of search ===========
% 0.20/0.56
% 0.20/0.56 -------- PROOF --------
% 0.20/0.56 % SZS status Unsatisfiable
% 0.20/0.56 % SZS output start Refutation
% 0.20/0.56
% 0.20/0.56 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.56
% 0.20/0.56 Stopped by limit on number of solutions
% 0.20/0.56
% 0.20/0.56 Model 3 [ 2 0 203 ] (0.00 seconds, 831 Inserts)
% 0.20/0.56
% 0.20/0.56 Model 4 [ 3 1 500 ] (0.00 seconds, 1430 Inserts)
% 0.20/0.56
% 0.20/0.56 Model 5 [ 4 1 61 ] (0.00 seconds, 2065 Inserts)
% 0.20/0.56
% 0.20/0.56 Model 6 [ 6 1 758 ] (0.00 seconds, 2190 Inserts)
% 0.20/0.56
% 0.20/0.56 Model 7 [ 8 1 1063 ] (0.00 seconds, 4734 Inserts)
% 0.20/0.56
% 0.20/0.56 Model 8 [ 6 0 479 ] (0.00 seconds, 1968 Inserts)
% 0.20/0.56
% 0.20/0.56 Model 9 [ 8 1 284 ] (0.00 seconds, 2497 Inserts)
% 0.20/0.56
% 0.20/0.56 Model 10 [ 9 1 1239 ] (0.00 seconds, 3672 Inserts)
% 0.20/0.56
% 0.20/0.56 Model 11 [ 10 1 673 ] (0.00 seconds, 1944 Inserts)
% 0.20/0.56
% 0.20/0.56 ----> UNIT CONFLICT at 0.17 sec ----> 148 [binary,147.1,7.1] {-} $F.
% 0.20/0.56
% 0.20/0.56 Length of proof is 8. Level of proof is 7.
% 0.20/0.56
% 0.20/0.56 ---------------- PROOF ----------------
% 0.20/0.56 % SZS status Unsatisfiable
% 0.20/0.56 % SZS output start Refutation
% 0.20/0.56
% 0.20/0.56 1 [] {+} -less_equal(A,B)|quotient(A,B,zero).
% 0.20/0.56 2 [] {+} -quotient(A,B,zero)|less_equal(A,B).
% 0.20/0.56 3 [] {+} -quotient(A,B,C)|less_equal(C,A).
% 0.20/0.56 4 [] {+} -quotient(A,B,C)| -quotient(B,D,E)| -quotient(A,D,F)| -quotient(F,E,G)| -quotient(C,D,H)|less_equal(G,H).
% 0.20/0.56 5 [] {+} -less_equal(A,B)| -less_equal(B,A)|A=B.
% 0.20/0.56 7 [] {+} -quotient(x,x,zero).
% 0.20/0.56 8 [] {+} less_equal(zero,A).
% 0.20/0.56 10 [] {-} quotient(A,B,divide(A,B)).
% 0.20/0.56 19 [hyper,10,3] {+} less_equal(divide(A,B),A).
% 0.20/0.56 21 [para_into,10.1.3,5.3.1] {+} quotient(A,B,C)| -less_equal(divide(A,B),C)| -less_equal(C,divide(A,B)).
% 0.20/0.56 24 [hyper,19,1] {+} quotient(divide(A,B),A,zero).
% 0.20/0.56 91 [hyper,24,4,10,24,10,10] {+} less_equal(divide(divide(A,A),zero),zero).
% 0.20/0.56 102 [hyper,91,5,8,flip.1] {+} divide(divide(A,A),zero)=zero.
% 0.20/0.56 137 [para_from,102.1.1,10.1.3] {+} quotient(divide(A,A),zero,zero).
% 0.20/0.56 140 [hyper,137,2] {+} less_equal(divide(A,A),zero).
% 0.20/0.56 147 [hyper,140,21,8] {-} quotient(A,A,zero).
% 0.20/0.56 148 [binary,147.1,7.1] {-} $F.
% 0.20/0.56
% 0.20/0.56 % SZS output end Refutation
% 0.20/0.56 ------------ end of proof -------------
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Search stopped by max_proofs option.
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Search stopped by max_proofs option.
% 0.20/0.56
% 0.20/0.56 ============ end of search ============
% 0.20/0.56
% 0.20/0.56 ----------- soft-scott stats ----------
% 0.20/0.56
% 0.20/0.56 true clauses given 9 (36.0%)
% 0.20/0.56 false clauses given 16
% 0.20/0.56
% 0.20/0.56 FALSE TRUE
% 0.20/0.56 9 0 4
% 0.20/0.56 10 0 4
% 0.20/0.56 11 0 5
% 0.20/0.56 12 1 5
% 0.20/0.56 13 2 9
% 0.20/0.56 14 2 6
% 0.20/0.56 15 0 7
% 0.20/0.56 16 0 3
% 0.20/0.56 17 2 6
% 0.20/0.56 18 3 5
% 0.20/0.56 19 2 8
% 0.20/0.56 20 3 8
% 0.20/0.56 21 2 8
% 0.20/0.56 22 6 2
% 0.20/0.56 23 1 1
% 0.20/0.56 25 0 1
% 0.20/0.56 tot: 24 82 (77.4% true)
% 0.20/0.56
% 0.20/0.56
% 0.20/0.56 Model 11 [ 10 1 673 ] (0.00 seconds, 1944 Inserts)
% 0.20/0.56
% 0.20/0.56 That finishes the proof of the theorem.
% 0.20/0.56
% 0.20/0.56 Process 13826 finished Fri Jul 1 13:46:29 2022
%------------------------------------------------------------------------------