TSTP Solution File: COL052-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COL052-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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 00:42:06 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL052-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue May 31 15:53:17 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n027.cluster.edu,
% 0.13/0.35 Tue May 31 15:53:17 2022
% 0.13/0.35 The command was "./sos". The process ID is 25579.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.13/0.35
% 0.13/0.35 This is a Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.35 sos and nonpositive clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: clear(order_hyper).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.20/0.37
% 0.20/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.37
% 0.20/0.37 Stopped by limit on number of solutions
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 -------------- Softie stats --------------
% 0.20/0.37
% 0.20/0.37 UPDATE_STOP: 300
% 0.20/0.37 SFINDER_TIME_LIMIT: 2
% 0.20/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.37 number of clauses in intial UL: 3
% 0.20/0.37 number of clauses initially in problem: 9
% 0.20/0.37 percentage of clauses intially in UL: 33
% 0.20/0.37 percentage of distinct symbols occuring in initial UL: 66
% 0.20/0.37 percent of all initial clauses that are short: 100
% 0.20/0.37 absolute distinct symbol count: 9
% 0.20/0.37 distinct predicate count: 2
% 0.20/0.37 distinct function count: 4
% 0.20/0.37 distinct constant count: 3
% 0.20/0.37
% 0.20/0.37 ---------- no more Softie stats ----------
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 =========== start of search ===========
% 0.20/0.39
% 0.20/0.39 -------- PROOF --------
% 0.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39 % SZS output start Refutation
% 0.20/0.39
% 0.20/0.39 ----> UNIT CONFLICT at 0.02 sec ----> 132 [binary,131.1,4.1] {-} $F.
% 0.20/0.39
% 0.20/0.39 Length of proof is 8. Level of proof is 5.
% 0.20/0.39
% 0.20/0.39 ---------------- PROOF ----------------
% 0.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39 % SZS output start Refutation
% 0.20/0.39
% 0.20/0.39 1 [] {+} -agreeable(A)|response(A,common_bird(B))=response(B,common_bird(B)).
% 0.20/0.39 2 [] {-} response(A,B)!=response(compatible(A),B)|agreeable(A).
% 0.20/0.39 3 [copy,2,flip.1] {+} response(compatible(A),B)!=response(A,B)|agreeable(A).
% 0.20/0.39 4 [] {+} -agreeable(a).
% 0.20/0.39 5 [] {-} response(compose(A,B),C)=response(A,response(B,C)).
% 0.20/0.39 7 [] {+} agreeable(c).
% 0.20/0.39 8 [] {-} c=compose(a,b).
% 0.20/0.39 9 [copy,8,flip.1] {+} compose(a,b)=c.
% 0.20/0.39 28 [hyper,7,1] {+} response(c,common_bird(A))=response(A,common_bird(A)).
% 0.20/0.39 29 [copy,28,flip.1] {+} response(A,common_bird(A))=response(c,common_bird(A)).
% 0.20/0.39 34,33 [para_from,9.1.1,5.1.1.1] {-} response(c,A)=response(a,response(b,A)).
% 0.20/0.39 35 [back_demod,29,demod,34] {-} response(A,common_bird(A))=response(a,response(b,common_bird(A))).
% 0.20/0.39 45 [para_into,35.1.1,5.1.1] {-} response(A,response(B,common_bird(compose(A,B))))=response(a,response(b,common_bird(compose(A,B)))).
% 0.20/0.39 131 [hyper,45,3] {-} agreeable(a).
% 0.20/0.39 132 [binary,131.1,4.1] {-} $F.
% 0.20/0.39
% 0.20/0.39 % SZS output end Refutation
% 0.20/0.39 ------------ end of proof -------------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Search stopped by max_proofs option.
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Search stopped by max_proofs option.
% 0.20/0.39
% 0.20/0.39 ============ end of search ============
% 0.20/0.39
% 0.20/0.39 ----------- soft-scott stats ----------
% 0.20/0.39
% 0.20/0.39 true clauses given 5 (22.7%)
% 0.20/0.39 false clauses given 17
% 0.20/0.39
% 0.20/0.39 FALSE TRUE
% 0.20/0.39 13 0 2
% 0.20/0.39 17 6 0
% 0.20/0.39 18 1 2
% 0.20/0.39 19 17 1
% 0.20/0.39 20 2 1
% 0.20/0.39 21 14 0
% 0.20/0.39 23 18 0
% 0.20/0.39 24 2 0
% 0.20/0.39 25 17 0
% 0.20/0.39 27 6 0
% 0.20/0.39 29 2 0
% 0.20/0.39 31 1 0
% 0.20/0.39 tot: 86 6 (6.5% true)
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 That finishes the proof of the theorem.
% 0.20/0.39
% 0.20/0.39 Process 25579 finished Tue May 31 15:53:17 2022
%------------------------------------------------------------------------------