TSTP Solution File: ROB016-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ROB016-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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 : Mon Jul 18 20:56:08 EDT 2022
% Result : Unsatisfiable 0.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ROB016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.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 : Thu Jun 9 15:04:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n025.cluster.edu,
% 0.12/0.35 Thu Jun 9 15:04:05 2022
% 0.12/0.35 The command was "./sos". The process ID is 2750.
% 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 5 during input processing: 0 [copy,5,flip.1] {-} add(A,B)=add(B,A).
% 0.12/0.35 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 4
% 0.18/0.39 number of clauses initially in problem: 16
% 0.18/0.39 percentage of clauses intially in UL: 25
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 90
% 0.18/0.39 percent of all initial clauses that are short: 93
% 0.18/0.39 absolute distinct symbol count: 10
% 0.18/0.39 distinct predicate count: 2
% 0.18/0.39 distinct function count: 4
% 0.18/0.39 distinct constant count: 4
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 0.18/0.44
% 0.18/0.44 -------- PROOF --------
% 0.18/0.44 % SZS status Unsatisfiable
% 0.18/0.44 % SZS output start Refutation
% 0.18/0.44
% 0.18/0.44 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.44
% 0.18/0.44 Stopped by limit on number of solutions
% 0.18/0.44
% 0.18/0.44 Model 4 (0.00 seconds, 0 Inserts)
% 0.18/0.44
% 0.18/0.44 Stopped by limit on number of solutions
% 0.18/0.44
% 0.18/0.44 Model 5 (0.00 seconds, 0 Inserts)
% 0.18/0.44
% 0.18/0.44 Stopped by limit on number of solutions
% 0.18/0.44
% 0.18/0.44 ----> UNIT CONFLICT at 0.06 sec ----> 118 [binary,116.1,4.1] {-} $F.
% 0.18/0.44
% 0.18/0.44 Length of proof is 2. Level of proof is 2.
% 0.18/0.44
% 0.18/0.44 ---------------- PROOF ----------------
% 0.18/0.44 % SZS status Unsatisfiable
% 0.18/0.44 % SZS output start Refutation
% 0.18/0.44
% 0.18/0.44 3 [] {+} negate(add(negate(A),negate(add(B,negate(A)))))!=B| -positive_integer(C)|negate(add(A,multiply(C,add(B,negate(add(B,negate(A)))))))=negate(A).
% 0.18/0.44 4 [] {+} negate(add(e,multiply(k,add(d,negate(add(d,negate(e)))))))!=negate(e).
% 0.18/0.44 8 [] {-} negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 0.18/0.44 13 [] {-} negate(add(d,e))=negate(e).
% 0.18/0.44 15 [] {+} positive_integer(k).
% 0.18/0.44 55 [para_into,8.1.1.1.1,13.1.1] {-} negate(add(negate(e),negate(add(d,negate(e)))))=d.
% 0.18/0.44 116 [hyper,55,3,15] {-} negate(add(e,multiply(k,add(d,negate(add(d,negate(e)))))))=negate(e).
% 0.18/0.44 118 [binary,116.1,4.1] {-} $F.
% 0.18/0.44
% 0.18/0.44 % SZS output end Refutation
% 0.18/0.44 ------------ end of proof -------------
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Search stopped by max_proofs option.
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Search stopped by max_proofs option.
% 0.18/0.44
% 0.18/0.44 ============ end of search ============
% 0.18/0.44
% 0.18/0.44 ----------- soft-scott stats ----------
% 0.18/0.44
% 0.18/0.44 true clauses given 5 (27.8%)
% 0.18/0.44 false clauses given 13
% 0.18/0.44
% 0.18/0.44 FALSE TRUE
% 0.18/0.44 4 0 1
% 0.18/0.44 5 0 1
% 0.18/0.44 10 0 2
% 0.18/0.44 11 3 1
% 0.18/0.44 13 3 2
% 0.18/0.44 14 0 1
% 0.18/0.44 15 14 4
% 0.18/0.44 16 0 2
% 0.18/0.44 17 3 0
% 0.18/0.44 18 1 0
% 0.18/0.44 19 2 0
% 0.18/0.44 20 1 0
% 0.18/0.44 21 1 0
% 0.18/0.44 26 0 1
% 0.18/0.44 28 0 5
% 0.18/0.44 30 2 0
% 0.18/0.44 31 1 1
% 0.18/0.44 32 1 0
% 0.18/0.44 33 1 0
% 0.18/0.44 35 0 1
% 0.18/0.44 36 1 1
% 0.18/0.44 38 0 1
% 0.18/0.44 tot: 34 24 (41.4% true)
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Model 5 (0.00 seconds, 0 Inserts)
% 0.18/0.44
% 0.18/0.44 That finishes the proof of the theorem.
% 0.18/0.44
% 0.18/0.44 Process 2750 finished Thu Jun 9 15:04:05 2022
%------------------------------------------------------------------------------