TSTP Solution File: HEN008-4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HEN008-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:49 EDT 2022
% Result : Unsatisfiable 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : HEN008-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 13:17:14 EDT 2022
% 0.13/0.35 % 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 13:17:14 2022
% 0.13/0.36 The command was "./sos". The process ID is 5798.
% 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 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.40
% 0.13/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 -------------- Softie stats --------------
% 0.13/0.40
% 0.13/0.40 UPDATE_STOP: 300
% 0.13/0.40 SFINDER_TIME_LIMIT: 2
% 0.13/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40 number of clauses in intial UL: 7
% 0.13/0.40 number of clauses initially in problem: 21
% 0.13/0.40 percentage of clauses intially in UL: 33
% 0.13/0.40 percentage of distinct symbols occuring in initial UL: 87
% 0.13/0.40 percent of all initial clauses that are short: 100
% 0.13/0.40 absolute distinct symbol count: 8
% 0.13/0.40 distinct predicate count: 2
% 0.13/0.40 distinct function count: 1
% 0.13/0.40 distinct constant count: 5
% 0.13/0.40
% 0.13/0.40 ---------- no more Softie stats ----------
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40
% 0.13/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40
% 0.13/0.40 Stopped by limit on number of solutions
% 0.13/0.40
% 0.13/0.40 =========== start of search ===========
% 0.20/0.48
% 0.20/0.48 -------- PROOF --------
% 0.20/0.48 % SZS status Unsatisfiable
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.48
% 0.20/0.48 Stopped by limit on number of solutions
% 0.20/0.48
% 0.20/0.48 Model 4 [ 2 1 580 ] (0.00 seconds, 916 Inserts)
% 0.20/0.48
% 0.20/0.48 Model 5 [ 1 1 39 ] (0.00 seconds, 539 Inserts)
% 0.20/0.48
% 0.20/0.48 Model 6 [ 3 1 123 ] (0.00 seconds, 819 Inserts)
% 0.20/0.48
% 0.20/0.48 Model 7 [ 2 1 130 ] (0.00 seconds, 688 Inserts)
% 0.20/0.48
% 0.20/0.48 ----> UNIT CONFLICT at 0.08 sec ----> 356 [binary,355.1,7.1] {-} $F.
% 0.20/0.48
% 0.20/0.48 Length of proof is 4. Level of proof is 4.
% 0.20/0.48
% 0.20/0.48 ---------------- PROOF ----------------
% 0.20/0.48 % SZS status Unsatisfiable
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 1 [] {+} -less_equal(A,B)|divide(A,B)=zero.
% 0.20/0.48 2 [] {+} divide(A,B)!=zero|less_equal(A,B).
% 0.20/0.48 3 [] {+} -less_equal(A,B)| -less_equal(B,A)|A=B.
% 0.20/0.48 7 [] {+} -less_equal(divide(a,c),divide(b,c)).
% 0.20/0.48 9 [] {-} less_equal(divide(divide(A,B),divide(C,B)),divide(divide(A,C),B)).
% 0.20/0.48 10 [] {+} less_equal(zero,A).
% 0.20/0.48 15,14 [] {+} divide(zero,A)=zero.
% 0.20/0.48 20 [] {+} less_equal(a,b).
% 0.20/0.48 30 [hyper,20,1] {-} divide(a,b)=zero.
% 0.20/0.48 67 [para_from,30.1.1,9.1.2.1,demod,15] {-} less_equal(divide(divide(a,A),divide(b,A)),zero).
% 0.20/0.48 189 [hyper,67,3,10,flip.1] {-} divide(divide(a,A),divide(b,A))=zero.
% 0.20/0.48 355 [hyper,189,2] {-} less_equal(divide(a,A),divide(b,A)).
% 0.20/0.48 356 [binary,355.1,7.1] {-} $F.
% 0.20/0.48
% 0.20/0.48 % SZS output end Refutation
% 0.20/0.48 ------------ end of proof -------------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48 ============ end of search ============
% 0.20/0.48
% 0.20/0.48 ----------- soft-scott stats ----------
% 0.20/0.48
% 0.20/0.48 true clauses given 17 (34.0%)
% 0.20/0.48 false clauses given 33
% 0.20/0.48
% 0.20/0.48 FALSE TRUE
% 0.20/0.48 6 0 1
% 0.20/0.48 7 0 2
% 0.20/0.48 8 0 7
% 0.20/0.48 9 6 7
% 0.20/0.48 10 9 6
% 0.20/0.48 11 38 20
% 0.20/0.48 12 3 16
% 0.20/0.48 13 41 4
% 0.20/0.48 14 11 3
% 0.20/0.48 15 38 6
% 0.20/0.48 16 3 1
% 0.20/0.48 17 20 3
% 0.20/0.48 19 7 1
% 0.20/0.48 21 7 2
% 0.20/0.48 23 1 0
% 0.20/0.48 25 1 0
% 0.20/0.48 tot: 185 79 (29.9% true)
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Model 7 [ 2 1 130 ] (0.00 seconds, 688 Inserts)
% 0.20/0.48
% 0.20/0.48 That finishes the proof of the theorem.
% 0.20/0.48
% 0.20/0.48 Process 5798 finished Fri Jul 1 13:17:14 2022
%------------------------------------------------------------------------------