TSTP Solution File: ROB021-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ROB021-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:09 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.00/0.12 % Problem : ROB021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n021.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 14:49:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox2 on n021.cluster.edu,
% 0.19/0.35 Thu Jun 9 14:49:38 2022
% 0.19/0.35 The command was "./sos". The process ID is 29545.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.19/0.35
% 0.19/0.35 This is a Horn set with equality. The strategy will be
% 0.19/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.19/0.35 sos and nonpositive clauses in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(knuth_bendix).
% 0.19/0.35 dependent: set(para_from).
% 0.19/0.35 dependent: set(para_into).
% 0.19/0.35 dependent: clear(para_from_right).
% 0.19/0.35 dependent: clear(para_into_right).
% 0.19/0.35 dependent: set(para_from_vars).
% 0.19/0.35 dependent: set(eq_units_both_ways).
% 0.19/0.35 dependent: set(dynamic_demod_all).
% 0.19/0.35 dependent: set(dynamic_demod).
% 0.19/0.35 dependent: set(order_eq).
% 0.19/0.35 dependent: set(back_demod).
% 0.19/0.35 dependent: set(lrpo).
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: clear(order_hyper).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] {-} add(A,B)=add(B,A).
% 0.19/0.35 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} A=A.
% 0.19/0.35
% 0.19/0.35 ======= 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: 2
% 0.19/0.40 number of clauses initially in problem: 8
% 0.19/0.40 percentage of clauses intially in UL: 25
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 5
% 0.19/0.40 distinct predicate count: 1
% 0.19/0.40 distinct function count: 2
% 0.19/0.40 distinct constant count: 2
% 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 ----> UNIT CONFLICT at 0.01 sec ----> 81 [binary,79.1,11.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 Length of proof is 3. Level of proof is 2.
% 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 [] {+} negate(A)!=negate(B)|A=B.
% 0.19/0.41 2 [] {+} add(negate(add(a,negate(b))),negate(add(negate(a),negate(b))))!=b.
% 0.19/0.41 3 [] {+} add(A,B)=add(B,A).
% 0.19/0.41 6 [] {-} negate(add(negate(add(A,B)),negate(add(A,negate(B)))))=A.
% 0.19/0.41 11 [para_from,3.1.1,2.1.1.2.1] {+} add(negate(add(a,negate(b))),negate(add(negate(b),negate(a))))!=b.
% 0.19/0.41 40 [para_into,6.1.1.1.1.1,3.1.1] {-} negate(add(negate(add(A,B)),negate(add(B,negate(A)))))=B.
% 0.19/0.41 79 [hyper,40,1] {-} add(negate(add(A,negate(B))),negate(add(negate(B),negate(A))))=B.
% 0.19/0.41 81 [binary,79.1,11.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 2 (20.0%)
% 0.19/0.41 false clauses given 8
% 0.19/0.41
% 0.19/0.41 FALSE TRUE
% 0.19/0.41 6 0 1
% 0.19/0.41 8 0 1
% 0.19/0.41 11 0 2
% 0.19/0.41 12 0 1
% 0.19/0.41 13 2 1
% 0.19/0.41 14 1 3
% 0.19/0.41 15 16 0
% 0.19/0.41 16 10 0
% 0.19/0.41 17 4 0
% 0.19/0.41 18 6 0
% 0.19/0.41 19 1 0
% 0.19/0.41 20 1 0
% 0.19/0.41 21 1 0
% 0.19/0.41 tot: 42 9 (17.6% true)
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 2 (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 29545 finished Thu Jun 9 14:49:38 2022
%------------------------------------------------------------------------------