TSTP Solution File: CSR023+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CSR023+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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 : Fri Jul 15 23:21:10 EDT 2022
% Result : Theorem 2.43s 2.60s
% Output : Refutation 2.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR023+1 : TPTP v8.1.0. Bugfixed v3.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 9 19:26:18 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n028.cluster.edu,
% 0.20/0.36 Thu Jun 9 19:26:18 2022
% 0.20/0.36 The command was "./sos". The process ID is 14110.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 formula_list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.20/0.36
% 0.20/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.36 clauses in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(knuth_bendix).
% 0.20/0.36 dependent: set(para_from).
% 0.20/0.36 dependent: set(para_into).
% 0.20/0.36 dependent: clear(para_from_right).
% 0.20/0.36 dependent: clear(para_into_right).
% 0.20/0.36 dependent: set(para_from_vars).
% 0.20/0.36 dependent: set(eq_units_both_ways).
% 0.20/0.36 dependent: set(dynamic_demod_all).
% 0.20/0.36 dependent: set(dynamic_demod).
% 0.20/0.36 dependent: set(order_eq).
% 0.20/0.36 dependent: set(back_demod).
% 0.20/0.36 dependent: set(lrpo).
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36 55 back subsumes 23.
% 0.20/0.36 96 back subsumes 25.
% 0.20/0.36 96 back subsumes 24.
% 0.20/0.36 96 back subsumes 20.
% 0.20/0.36 96 back subsumes 19.
% 0.20/0.36 96 back subsumes 18.
% 0.20/0.36 96 back subsumes 17.
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 Following clause subsumed by 119 during input processing: 0 [copy,119,flip.1] {-} plus(A,B)=plus(B,A).
% 0.20/0.36 Following clause subsumed by 121 during input processing: 0 [copy,121,flip.1] {-} A=A.
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Failed to model usable list: disabling FINDER
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 -------------- Softie stats --------------
% 0.20/0.44
% 0.20/0.44 UPDATE_STOP: 300
% 0.20/0.44 SFINDER_TIME_LIMIT: 2
% 0.20/0.44 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.44 number of clauses in intial UL: 90
% 0.20/0.44 number of clauses initially in problem: 113
% 0.20/0.44 percentage of clauses intially in UL: 79
% 0.20/0.44 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.44 percent of all initial clauses that are short: 100
% 0.20/0.44 absolute distinct symbol count: 35
% 0.20/0.44 distinct predicate count: 13
% 0.20/0.44 distinct function count: 7
% 0.20/0.44 distinct constant count: 15
% 0.20/0.44
% 0.20/0.44 ---------- no more Softie stats ----------
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 =========== start of search ===========
% 0.86/1.04
% 0.86/1.04
% 0.86/1.04 Changing weight limit from 60 to 16.
% 0.86/1.04
% 0.86/1.04 Resetting weight limit to 16 after 55 givens.
% 0.86/1.04
% 1.38/1.55
% 1.38/1.55
% 1.38/1.55 Changing weight limit from 16 to 15.
% 1.38/1.55
% 1.38/1.55 Resetting weight limit to 15 after 65 givens.
% 1.38/1.55
% 1.74/1.92
% 1.74/1.92
% 1.74/1.92 Changing weight limit from 15 to 13.
% 1.74/1.92
% 1.74/1.92 Resetting weight limit to 13 after 75 givens.
% 1.74/1.92
% 2.43/2.60
% 2.43/2.60 -------- PROOF --------
% 2.43/2.60 % SZS status Theorem
% 2.43/2.60 % SZS output start Refutation
% 2.43/2.60
% 2.43/2.60 ----> UNIT CONFLICT at 2.22 sec ----> 11662 [binary,11661.1,97.1] {-} $F.
% 2.43/2.60
% 2.43/2.60 Length of proof is 5. Level of proof is 3.
% 2.43/2.60
% 2.43/2.60 ---------------- PROOF ----------------
% 2.43/2.60 % SZS status Theorem
% 2.43/2.60 % SZS output start Refutation
% 2.43/2.60
% 2.43/2.60 21 [] {+} -happens(A,B)| -initiates(A,C,B)|holdsAt(C,plus(B,n1)).
% 2.43/2.60 40 [] {+} initiates(A,B,C)|A!=pull|B!=spinning| -happens(push,C).
% 2.43/2.60 62 [] {+} happens(A,B)|A!=pull|B!=n2.
% 2.43/2.60 63 [] {+} happens(A,B)|A!=push|B!=n2.
% 2.43/2.60 97 [] {+} -holdsAt(spinning,n3).
% 2.43/2.60 109 [] {-} plus(n1,n2)=n3.
% 2.43/2.60 119 [] {-} plus(A,B)=plus(B,A).
% 2.43/2.60 121 [] {-} A=A.
% 2.43/2.60 249 [hyper,121,63,121] {-} happens(push,n2).
% 2.43/2.60 250 [hyper,121,62,121] {-} happens(pull,n2).
% 2.43/2.60 270 [hyper,249,40,121,121] {-} initiates(pull,spinning,n2).
% 2.43/2.60 5188,5187 [para_into,119.1.1,109.1.1,flip.1] {-} plus(n2,n1)=n3.
% 2.43/2.60 11661 [hyper,270,21,250,demod,5188] {-} holdsAt(spinning,n3).
% 2.43/2.60 11662 [binary,11661.1,97.1] {-} $F.
% 2.43/2.60
% 2.43/2.60 % SZS output end Refutation
% 2.43/2.60 ------------ end of proof -------------
% 2.43/2.60
% 2.43/2.60
% 2.43/2.60 Search stopped by max_proofs option.
% 2.43/2.60
% 2.43/2.60
% 2.43/2.60 Search stopped by max_proofs option.
% 2.43/2.60
% 2.43/2.60 ============ end of search ============
% 2.43/2.60
% 2.43/2.60 That finishes the proof of the theorem.
% 2.43/2.60
% 2.43/2.60 Process 14110 finished Thu Jun 9 19:26:20 2022
%------------------------------------------------------------------------------