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