TSTP Solution File: COL064-5 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COL064-5 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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:10 EDT 2022
% Result : Unsatisfiable 0.15s 0.33s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : COL064-5 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.03/0.10 % Command : sos-script %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Tue May 31 14:43:58 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.09/0.31 ----- Otter 3.2, August 2001 -----
% 0.09/0.31 The process was started by sandbox on n032.cluster.edu,
% 0.09/0.31 Tue May 31 14:43:58 2022
% 0.09/0.31 The command was "./sos". The process ID is 32243.
% 0.09/0.31
% 0.09/0.31 set(prolog_style_variables).
% 0.09/0.31 set(auto).
% 0.09/0.31 dependent: set(auto1).
% 0.09/0.31 dependent: set(process_input).
% 0.09/0.31 dependent: clear(print_kept).
% 0.09/0.31 dependent: clear(print_new_demod).
% 0.09/0.31 dependent: clear(print_back_demod).
% 0.09/0.31 dependent: clear(print_back_sub).
% 0.09/0.31 dependent: set(control_memory).
% 0.09/0.31 dependent: assign(max_mem, 12000).
% 0.09/0.31 dependent: assign(pick_given_ratio, 4).
% 0.09/0.31 dependent: assign(stats_level, 1).
% 0.09/0.31 dependent: assign(pick_semantic_ratio, 3).
% 0.09/0.31 dependent: assign(sos_limit, 5000).
% 0.09/0.31 dependent: assign(max_weight, 60).
% 0.09/0.31 clear(print_given).
% 0.09/0.31
% 0.09/0.31 list(usable).
% 0.09/0.31
% 0.09/0.31 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.09/0.31
% 0.09/0.31 All clauses are units, and equality is present; the
% 0.09/0.31 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.09/0.31
% 0.09/0.31 dependent: set(knuth_bendix).
% 0.09/0.31 dependent: set(para_from).
% 0.09/0.31 dependent: set(para_into).
% 0.09/0.31 dependent: clear(para_from_right).
% 0.09/0.31 dependent: clear(para_into_right).
% 0.09/0.31 dependent: set(para_from_vars).
% 0.09/0.31 dependent: set(eq_units_both_ways).
% 0.09/0.31 dependent: set(dynamic_demod_all).
% 0.09/0.31 dependent: set(dynamic_demod).
% 0.09/0.31 dependent: set(order_eq).
% 0.09/0.31 dependent: set(back_demod).
% 0.09/0.31 dependent: set(lrpo).
% 0.09/0.31
% 0.09/0.31 ------------> process usable:
% 0.09/0.31
% 0.09/0.31 ------------> process sos:
% 0.09/0.31 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] {-} A=A.
% 0.09/0.31 Following clause subsumed by 4 during input processing: 0 [copy,7,flip.1] {-} apply(apply(t,A),B)=apply(B,A).
% 0.09/0.31
% 0.09/0.31 ======= end of input processing =======
% 0.15/0.32
% 0.15/0.32 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.32
% 0.15/0.32 Stopped by limit on number of solutions
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 -------------- Softie stats --------------
% 0.15/0.32
% 0.15/0.32 UPDATE_STOP: 300
% 0.15/0.32 SFINDER_TIME_LIMIT: 2
% 0.15/0.32 SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.32 number of clauses in intial UL: 0
% 0.15/0.32 number of clauses initially in problem: 6
% 0.15/0.32 percentage of clauses intially in UL: 0
% 0.15/0.32 percentage of distinct symbols occuring in initial UL: 0
% 0.15/0.32 percent of all initial clauses that are short: 100
% 0.15/0.32 absolute distinct symbol count: 7
% 0.15/0.32 distinct predicate count: 1
% 0.15/0.32 distinct function count: 1
% 0.15/0.32 distinct constant count: 5
% 0.15/0.32
% 0.15/0.32 ---------- no more Softie stats ----------
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32
% 0.15/0.32 =========== start of search ===========
% 0.15/0.33
% 0.15/0.33 -------- PROOF --------
% 0.15/0.33 % SZS status Unsatisfiable
% 0.15/0.33 % SZS output start Refutation
% 0.15/0.33
% 0.15/0.33 ----> UNIT CONFLICT at 0.01 sec ----> 47 [binary,46.1,18.1] {-} $F.
% 0.15/0.33
% 0.15/0.33 Length of proof is 6. Level of proof is 3.
% 0.15/0.33
% 0.15/0.33 ---------------- PROOF ----------------
% 0.15/0.33 % SZS status Unsatisfiable
% 0.15/0.33 % SZS output start Refutation
% 0.15/0.33
% 0.15/0.33 1 [] {-} apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,apply(apply(b,b),t))),apply(apply(b,b),b))),t),x),y),z)!=apply(apply(z,x),y).
% 0.15/0.33 3,2 [] {-} apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 0.15/0.33 4 [] {-} apply(apply(t,A),B)=apply(B,A).
% 0.15/0.33 6 [back_demod,1,demod,3,3,3] {-} apply(apply(apply(apply(t,apply(apply(b,b),t)),apply(b,apply(b,apply(t,x)))),y),z)!=apply(apply(z,x),y).
% 0.15/0.33 7 [copy,4,flip.1] {-} apply(A,B)=apply(apply(t,B),A).
% 0.15/0.33 10 [para_into,7.1.1,2.1.1] {-} apply(A,apply(B,C))=apply(apply(t,C),apply(apply(b,A),B)).
% 0.15/0.33 14,13 [para_from,7.1.1,2.1.1.1] {-} apply(apply(apply(t,A),apply(b,B)),C)=apply(B,apply(A,C)).
% 0.15/0.33 18 [back_demod,6,demod,14,3,3,flip.1] {+} apply(apply(z,x),y)!=apply(apply(t,x),apply(apply(b,apply(t,y)),z)).
% 0.15/0.33 46 [para_into,10.1.1,4.1.1] {-} apply(apply(A,B),C)=apply(apply(t,B),apply(apply(b,apply(t,C)),A)).
% 0.15/0.33 47 [binary,46.1,18.1] {-} $F.
% 0.15/0.33
% 0.15/0.33 % SZS output end Refutation
% 0.15/0.33 ------------ end of proof -------------
% 0.15/0.33
% 0.15/0.33
% 0.15/0.33 Search stopped by max_proofs option.
% 0.15/0.33
% 0.15/0.33
% 0.15/0.33 Search stopped by max_proofs option.
% 0.15/0.33
% 0.15/0.33 ============ end of search ============
% 0.15/0.33
% 0.15/0.33 ----------- soft-scott stats ----------
% 0.15/0.33
% 0.15/0.33 true clauses given 1 (9.1%)
% 0.15/0.33 false clauses given 10
% 0.15/0.33
% 0.15/0.33 FALSE TRUE
% 0.15/0.33 13 3 0
% 0.15/0.33 15 4 0
% 0.15/0.33 17 0 1
% 0.15/0.33 19 0 1
% 0.15/0.33 21 0 1
% 0.15/0.33 27 2 1
% 0.15/0.33 tot: 9 4 (30.8% true)
% 0.15/0.33
% 0.15/0.33
% 0.15/0.33 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.33
% 0.15/0.33 That finishes the proof of the theorem.
% 0.15/0.33
% 0.15/0.33 Process 32243 finished Tue May 31 14:43:58 2022
%------------------------------------------------------------------------------