TSTP Solution File: COL002-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COL002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:41:58 EDT 2022
% Result : Unsatisfiable 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : COL002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue May 31 13:36:40 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n019.cluster.edu,
% 0.14/0.37 Tue May 31 13:36:40 2022
% 0.14/0.37 The command was "./sos". The process ID is 25989.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.14/0.37
% 0.14/0.37 All clauses are units, and equality is present; the
% 0.14/0.37 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} A=A.
% 0.14/0.37 Following clause subsumed by 3 during input processing: 0 [copy,10,flip.1] {-} apply(apply(apply(s,A),B),C)=apply(apply(A,C),apply(B,C)).
% 0.14/0.37 Following clause subsumed by 6 during input processing: 0 [copy,11,flip.1] {-} apply(apply(apply(c,A),B),C)=apply(apply(A,C),B).
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 1
% 0.14/0.40 number of clauses initially in problem: 10
% 0.14/0.40 percentage of clauses intially in UL: 10
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 42
% 0.14/0.40 percent of all initial clauses that are short: 100
% 0.14/0.40 absolute distinct symbol count: 7
% 0.14/0.40 distinct predicate count: 1
% 0.14/0.40 distinct function count: 1
% 0.14/0.40 distinct constant count: 5
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 0.20/0.43
% 0.20/0.43 -------- PROOF --------
% 0.20/0.43 % SZS status Unsatisfiable
% 0.20/0.43 % SZS output start Refutation
% 0.20/0.43
% 0.20/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.43
% 0.20/0.43 Stopped by limit on number of solutions
% 0.20/0.43
% 0.20/0.43 ----> UNIT CONFLICT at 0.04 sec ----> 275 [binary,274.1,2.1] {-} $F.
% 0.20/0.43
% 0.20/0.43 Length of proof is 5. Level of proof is 4.
% 0.20/0.43
% 0.20/0.43 ---------------- PROOF ----------------
% 0.20/0.43 % SZS status Unsatisfiable
% 0.20/0.43 % SZS output start Refutation
% 0.20/0.43
% 0.20/0.43 1 [] {-} A!=apply(fixed_pt,A).
% 0.20/0.43 2 [copy,1,flip.1] {+} apply(fixed_pt,A)!=A.
% 0.20/0.43 3 [] {-} apply(apply(apply(s,A),B),C)=apply(apply(A,C),apply(B,C)).
% 0.20/0.43 4 [] {-} apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 0.20/0.43 7 [] {+} apply(i,A)=A.
% 0.20/0.43 10 [copy,3,flip.1] {-} apply(apply(A,B),apply(C,B))=apply(apply(apply(s,A),C),B).
% 0.20/0.43 13 [para_into,10.1.1.1,7.1.1] {-} apply(A,apply(B,A))=apply(apply(apply(s,i),B),A).
% 0.20/0.43 205 [para_into,13.1.1.2,7.1.1] {-} apply(A,A)=apply(apply(apply(s,i),i),A).
% 0.20/0.43 274 [para_into,205.1.1,4.1.1] {-} apply(A,apply(B,apply(apply(b,A),B)))=apply(apply(apply(s,i),i),apply(apply(b,A),B)).
% 0.20/0.43 275 [binary,274.1,2.1] {-} $F.
% 0.20/0.43
% 0.20/0.43 % SZS output end Refutation
% 0.20/0.43 ------------ end of proof -------------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Search stopped by max_proofs option.
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Search stopped by max_proofs option.
% 0.20/0.43
% 0.20/0.43 ============ end of search ============
% 0.20/0.43
% 0.20/0.43 ----------- soft-scott stats ----------
% 0.20/0.43
% 0.20/0.43 true clauses given 2 (14.3%)
% 0.20/0.43 false clauses given 12
% 0.20/0.43
% 0.20/0.43 FALSE TRUE
% 0.20/0.43 11 2 3
% 0.20/0.43 13 8 4
% 0.20/0.43 15 14 2
% 0.20/0.43 17 35 2
% 0.20/0.43 19 37 0
% 0.20/0.43 21 33 0
% 0.20/0.43 23 18 0
% 0.20/0.43 25 3 0
% 0.20/0.43 27 8 0
% 0.20/0.43 29 16 0
% 0.20/0.43 31 14 0
% 0.20/0.43 33 8 0
% 0.20/0.43 35 8 0
% 0.20/0.43 37 8 0
% 0.20/0.43 39 2 0
% 0.20/0.43 43 2 0
% 0.20/0.43 47 2 0
% 0.20/0.43 57 2 0
% 0.20/0.43 tot: 220 11 (4.8% true)
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.43
% 0.20/0.43 That finishes the proof of the theorem.
% 0.20/0.43
% 0.20/0.43 Process 25989 finished Tue May 31 13:36:40 2022
%------------------------------------------------------------------------------