TSTP Solution File: HEN007-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : HEN007-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:47 EDT 2022
% Result : Unsatisfiable 0.22s 0.51s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : HEN007-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jul 1 13:21:08 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox2 on n004.cluster.edu,
% 0.14/0.37 Fri Jul 1 13:21:08 2022
% 0.14/0.37 The command was "./sos". The process ID is 28022.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=6.
% 0.14/0.37
% 0.14/0.37 This is a Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.37 sos and nonpositive clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: clear(order_hyper).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} A=A.
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 9
% 0.14/0.40 number of clauses initially in problem: 20
% 0.14/0.40 percentage of clauses intially in UL: 45
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 54
% 0.14/0.40 percent of all initial clauses that are short: 100
% 0.14/0.40 absolute distinct symbol count: 11
% 0.14/0.40 distinct predicate count: 3
% 0.14/0.40 distinct function count: 1
% 0.14/0.40 distinct constant count: 7
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 0.22/0.51
% 0.22/0.51 -------- PROOF --------
% 0.22/0.51 % SZS status Unsatisfiable
% 0.22/0.51 % SZS output start Refutation
% 0.22/0.51
% 0.22/0.51 Model 2 (0.00 seconds, 0 Inserts)
% 0.22/0.51
% 0.22/0.51 Stopped by limit on number of solutions
% 0.22/0.51
% 0.22/0.51 Model 3 (0.00 seconds, 0 Inserts)
% 0.22/0.51
% 0.22/0.51 Stopped by limit on number of solutions
% 0.22/0.51
% 0.22/0.51 Model 4 (0.00 seconds, 0 Inserts)
% 0.22/0.51
% 0.22/0.51 Stopped by limit on number of solutions
% 0.22/0.51
% 0.22/0.51 Model 5 (0.00 seconds, 0 Inserts)
% 0.22/0.51
% 0.22/0.51 Stopped by limit on number of solutions
% 0.22/0.51
% 0.22/0.51 Model 6 (0.00 seconds, 0 Inserts)
% 0.22/0.51
% 0.22/0.51 Stopped by limit on number of solutions
% 0.22/0.51
% 0.22/0.51 Model 7 (0.00 seconds, 0 Inserts)
% 0.22/0.51
% 0.22/0.51 Stopped by limit on number of solutions
% 0.22/0.51
% 0.22/0.51 Model 8 [ 1 1 5342 ] (0.00 seconds, 6336 Inserts)
% 0.22/0.51
% 0.22/0.51 Model 9 [ 1 1 196 ] (0.00 seconds, 1237 Inserts)
% 0.22/0.51
% 0.22/0.51 ----> UNIT CONFLICT at 0.11 sec ----> 176 [binary,175.1,9.1] {-} $F.
% 0.22/0.51
% 0.22/0.51 Length of proof is 4. Level of proof is 4.
% 0.22/0.51
% 0.22/0.51 ---------------- PROOF ----------------
% 0.22/0.51 % SZS status Unsatisfiable
% 0.22/0.51 % SZS output start Refutation
% 0.22/0.51
% 0.22/0.51 2 [] {+} -quotient(A,B,zero)|less_equal(A,B).
% 0.22/0.51 7 [] {+} -less_equal(A,B)| -less_equal(B,C)|less_equal(A,C).
% 0.22/0.51 8 [] {+} -quotient(A,B,C)| -less_equal(C,D)| -quotient(A,D,E)|less_equal(E,B).
% 0.22/0.51 9 [] {+} -less_equal(zQy,zQx).
% 0.22/0.51 12 [] {+} quotient(A,B,divide(A,B)).
% 0.22/0.51 15 [] {+} quotient(A,A,zero).
% 0.22/0.51 17 [] {+} less_equal(x,y).
% 0.22/0.51 18 [] {+} quotient(z,y,zQy).
% 0.22/0.51 19 [] {+} quotient(z,x,zQx).
% 0.22/0.51 25 [hyper,15,2] {+} less_equal(A,A).
% 0.22/0.51 149 [hyper,25,8,19,12] {-} less_equal(divide(z,zQx),x).
% 0.22/0.51 164 [hyper,149,7,17] {-} less_equal(divide(z,zQx),y).
% 0.22/0.51 175 [hyper,164,8,12,18] {-} less_equal(zQy,zQx).
% 0.22/0.51 176 [binary,175.1,9.1] {-} $F.
% 0.22/0.51
% 0.22/0.51 % SZS output end Refutation
% 0.22/0.51 ------------ end of proof -------------
% 0.22/0.51
% 0.22/0.51
% 0.22/0.51 Search stopped by max_proofs option.
% 0.22/0.51
% 0.22/0.51
% 0.22/0.51 Search stopped by max_proofs option.
% 0.22/0.51
% 0.22/0.51 ============ end of search ============
% 0.22/0.51
% 0.22/0.51 ----------- soft-scott stats ----------
% 0.22/0.51
% 0.22/0.51 true clauses given 7 (35.0%)
% 0.22/0.51 false clauses given 13
% 0.22/0.51
% 0.22/0.51 FALSE TRUE
% 0.22/0.51 4 0 2
% 0.22/0.51 5 0 18
% 0.22/0.51 6 2 1
% 0.22/0.51 7 3 5
% 0.22/0.51 9 2 16
% 0.22/0.51 10 3 12
% 0.22/0.51 11 7 20
% 0.22/0.51 12 3 12
% 0.22/0.51 13 10 9
% 0.22/0.51 14 0 2
% 0.22/0.51 tot: 30 97 (76.4% true)
% 0.22/0.51
% 0.22/0.51
% 0.22/0.51 Model 9 [ 1 1 196 ] (0.00 seconds, 1237 Inserts)
% 0.22/0.51
% 0.22/0.51 That finishes the proof of the theorem.
% 0.22/0.51
% 0.22/0.51 Process 28022 finished Fri Jul 1 13:21:08 2022
%------------------------------------------------------------------------------