TSTP Solution File: HEN006-4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HEN006-4 : 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:45 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : HEN006-4 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jul 1 14:43:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n013.cluster.edu,
% 0.13/0.36 Fri Jul 1 14:43:14 2022
% 0.13/0.36 The command was "./sos". The process ID is 19674.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 5
% 0.19/0.40 number of clauses initially in problem: 19
% 0.19/0.40 percentage of clauses intially in UL: 26
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 87
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 8
% 0.19/0.40 distinct predicate count: 2
% 0.19/0.40 distinct function count: 1
% 0.19/0.40 distinct constant count: 5
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.19/0.41
% 0.19/0.41 -------- PROOF --------
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41 ----> UNIT CONFLICT at 0.03 sec ----> 123 [binary,122.1,5.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 Length of proof is 5. Level of proof is 5.
% 0.19/0.41
% 0.19/0.41 ---------------- PROOF ----------------
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 1 [] {+} -less_equal(A,B)|divide(A,B)=zero.
% 0.19/0.41 2 [] {+} divide(A,B)!=zero|less_equal(A,B).
% 0.19/0.41 3 [] {+} -less_equal(A,B)| -less_equal(B,A)|A=B.
% 0.19/0.41 4 [] {+} -less_equal(A,B)| -less_equal(B,C)|less_equal(A,C).
% 0.19/0.41 5 [] {+} -less_equal(divide(a,d),b).
% 0.19/0.41 6 [] {+} less_equal(divide(A,B),A).
% 0.19/0.41 7 [] {-} less_equal(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)).
% 0.19/0.41 8 [] {+} less_equal(zero,A).
% 0.19/0.41 18 [] {-} less_equal(divide(a,b),d).
% 0.19/0.41 26 [hyper,18,1] {-} divide(divide(a,b),d)=zero.
% 0.19/0.41 59 [para_from,26.1.1,7.1.2] {-} less_equal(divide(divide(a,d),divide(b,d)),zero).
% 0.19/0.41 96 [hyper,59,3,8,flip.1] {-} divide(divide(a,d),divide(b,d))=zero.
% 0.19/0.41 111 [hyper,96,2] {-} less_equal(divide(a,d),divide(b,d)).
% 0.19/0.41 122 [hyper,111,4,6] {-} less_equal(divide(a,d),b).
% 0.19/0.41 123 [binary,122.1,5.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 % SZS output end Refutation
% 0.19/0.41 ------------ end of proof -------------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41 ============ end of search ============
% 0.19/0.41
% 0.19/0.41 ----------- soft-scott stats ----------
% 0.19/0.41
% 0.19/0.41 true clauses given 6 (31.6%)
% 0.19/0.41 false clauses given 13
% 0.19/0.41
% 0.19/0.41 FALSE TRUE
% 0.19/0.41 5 0 1
% 0.19/0.41 7 0 2
% 0.19/0.41 9 0 3
% 0.19/0.41 10 3 0
% 0.19/0.41 11 10 4
% 0.19/0.41 12 0 1
% 0.19/0.41 13 14 1
% 0.19/0.41 14 2 0
% 0.19/0.41 15 22 0
% 0.19/0.41 17 11 0
% 0.19/0.41 19 2 0
% 0.19/0.41 21 5 0
% 0.19/0.41 23 1 0
% 0.19/0.41 25 1 0
% 0.19/0.41 tot: 71 12 (14.5% true)
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 That finishes the proof of the theorem.
% 0.19/0.41
% 0.19/0.41 Process 19674 finished Fri Jul 1 14:43:14 2022
%------------------------------------------------------------------------------