TSTP Solution File: HEN008-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HEN008-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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:48 EDT 2022
% Result : Unsatisfiable 0.44s 0.61s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN008-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n008.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:15:23 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 n008.cluster.edu,
% 0.14/0.36 Fri Jul 1 13:15:23 2022
% 0.14/0.36 The command was "./sos". The process ID is 22241.
% 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 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.39
% 0.14/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 -------------- Softie stats --------------
% 0.14/0.39
% 0.14/0.39 UPDATE_STOP: 300
% 0.14/0.39 SFINDER_TIME_LIMIT: 2
% 0.14/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39 number of clauses in intial UL: 10
% 0.14/0.39 number of clauses initially in problem: 21
% 0.14/0.39 percentage of clauses intially in UL: 47
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 54
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 11
% 0.14/0.39 distinct predicate count: 3
% 0.14/0.39 distinct function count: 1
% 0.14/0.39 distinct constant count: 7
% 0.14/0.39
% 0.14/0.39 ---------- no more Softie stats ----------
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 =========== start of search ===========
% 0.44/0.61
% 0.44/0.61 -------- PROOF --------
% 0.44/0.61 % SZS status Unsatisfiable
% 0.44/0.61 % SZS output start Refutation
% 0.44/0.61
% 0.44/0.61 Model 2 (0.00 seconds, 0 Inserts)
% 0.44/0.61
% 0.44/0.61 Stopped by limit on number of solutions
% 0.44/0.61
% 0.44/0.61 Model 3 (0.00 seconds, 0 Inserts)
% 0.44/0.61
% 0.44/0.61 Stopped by limit on number of solutions
% 0.44/0.61
% 0.44/0.61 Model 4 (0.00 seconds, 0 Inserts)
% 0.44/0.61
% 0.44/0.61 Stopped by limit on number of solutions
% 0.44/0.61
% 0.44/0.61 Model 5 (0.00 seconds, 0 Inserts)
% 0.44/0.61
% 0.44/0.61 Stopped by limit on number of solutions
% 0.44/0.61
% 0.44/0.61 Model 6 (0.00 seconds, 0 Inserts)
% 0.44/0.61
% 0.44/0.61 Stopped by limit on number of solutions
% 0.44/0.61
% 0.44/0.61 Model 7 [ 1 12 192256 ] (0.00 seconds, 193047 Inserts)
% 0.44/0.61
% 0.44/0.61 ----> UNIT CONFLICT at 0.22 sec ----> 369 [binary,368.1,10.1] {-} $F.
% 0.44/0.61
% 0.44/0.61 Length of proof is 7. Level of proof is 3.
% 0.44/0.61
% 0.44/0.61 ---------------- PROOF ----------------
% 0.44/0.61 % SZS status Unsatisfiable
% 0.44/0.61 % SZS output start Refutation
% 0.44/0.61
% 0.44/0.61 1 [] {+} -less_equal(A,B)|quotient(A,B,zero).
% 0.44/0.61 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.44/0.61 6 [] {+} -quotient(A,B,C)| -quotient(A,B,D)|C=D.
% 0.44/0.61 8 [] {+} -quotient(A,B,C)| -less_equal(C,D)| -quotient(A,D,E)|less_equal(E,B).
% 0.44/0.61 10 [] {+} -less_equal(aQc,bQc).
% 0.44/0.61 13 [] {+} quotient(A,B,divide(A,B)).
% 0.44/0.61 15 [] {+} quotient(zero,A,zero).
% 0.44/0.61 17 [] {+} quotient(A,zero,A).
% 0.44/0.61 18 [] {+} less_equal(a,b).
% 0.44/0.61 19 [] {+} quotient(a,c,aQc).
% 0.44/0.61 20 [] {+} quotient(b,c,bQc).
% 0.44/0.61 29 [hyper,18,1] {+} quotient(a,b,zero).
% 0.44/0.61 44,43 [hyper,13,6,17,flip.1] {+} divide(A,zero)=A.
% 0.44/0.61 66 [hyper,19,4,13,20,13,13] {-} less_equal(divide(aQc,bQc),divide(divide(a,b),c)).
% 0.44/0.61 88 [hyper,66,8,13,13] {-} less_equal(divide(aQc,divide(divide(a,b),c)),bQc).
% 0.44/0.61 177,176 [hyper,15,6,13] {+} divide(zero,A)=zero.
% 0.44/0.61 341,340 [hyper,29,6,13] {-} divide(a,b)=zero.
% 0.44/0.61 368 [back_demod,88,demod,341,177,44] {-} less_equal(aQc,bQc).
% 0.44/0.61 369 [binary,368.1,10.1] {-} $F.
% 0.44/0.61
% 0.44/0.61 % SZS output end Refutation
% 0.44/0.61 ------------ end of proof -------------
% 0.44/0.61
% 0.44/0.61
% 0.44/0.61 Search stopped by max_proofs option.
% 0.44/0.61
% 0.44/0.61
% 0.44/0.61 Search stopped by max_proofs option.
% 0.44/0.61
% 0.44/0.61 ============ end of search ============
% 0.44/0.61
% 0.44/0.61 ----------- soft-scott stats ----------
% 0.44/0.61
% 0.44/0.61 true clauses given 11 (37.9%)
% 0.44/0.61 false clauses given 18
% 0.44/0.61
% 0.44/0.61 FALSE TRUE
% 0.44/0.61 4 0 3
% 0.44/0.61 5 0 19
% 0.44/0.61 7 0 18
% 0.44/0.61 9 9 23
% 0.44/0.61 10 4 12
% 0.44/0.61 11 15 17
% 0.44/0.61 12 4 12
% 0.44/0.61 13 26 2
% 0.44/0.61 14 15 2
% 0.44/0.61 15 41 0
% 0.44/0.61 16 15 0
% 0.44/0.61 17 40 1
% 0.44/0.61 18 2 0
% 0.44/0.61 19 4 1
% 0.44/0.61 21 2 0
% 0.44/0.61 tot: 177 110 (38.3% true)
% 0.44/0.61
% 0.44/0.61
% 0.44/0.61 Model 7 [ 1 12 192256 ] (0.00 seconds, 193047 Inserts)
% 0.44/0.61
% 0.44/0.61 That finishes the proof of the theorem.
% 0.44/0.61
% 0.44/0.61 Process 22241 finished Fri Jul 1 13:15:23 2022
%------------------------------------------------------------------------------