TSTP Solution File: COL041-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COL041-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:04 EDT 2022
% Result : Unsatisfiable 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL041-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue May 31 08:33:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox2 on n029.cluster.edu,
% 0.19/0.36 Tue May 31 08:33:29 2022
% 0.19/0.36 The command was "./sos". The process ID is 13793.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.19/0.36
% 0.19/0.36 All clauses are units, and equality is present; the
% 0.19/0.36 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.19/0.36
% 0.19/0.36 dependent: set(knuth_bendix).
% 0.19/0.36 dependent: set(para_from).
% 0.19/0.36 dependent: set(para_into).
% 0.19/0.36 dependent: clear(para_from_right).
% 0.19/0.36 dependent: clear(para_into_right).
% 0.19/0.36 dependent: set(para_from_vars).
% 0.19/0.36 dependent: set(eq_units_both_ways).
% 0.19/0.36 dependent: set(dynamic_demod_all).
% 0.19/0.36 dependent: set(dynamic_demod).
% 0.19/0.36 dependent: set(order_eq).
% 0.19/0.36 dependent: set(back_demod).
% 0.19/0.36 dependent: set(lrpo).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] {-} A=A.
% 0.19/0.36 Following clause subsumed by 5 during input processing: 0 [copy,8,flip.1] {-} apply(m,A)=apply(A,A).
% 0.19/0.36 Following clause subsumed by 6 during input processing: 0 [copy,9,flip.1] {-} apply(apply(apply(c,A),B),C)=apply(apply(A,C),B).
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 1
% 0.19/0.38 number of clauses initially in problem: 8
% 0.19/0.38 percentage of clauses intially in UL: 12
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 50
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 6
% 0.19/0.38 distinct predicate count: 1
% 0.19/0.38 distinct function count: 2
% 0.19/0.38 distinct constant count: 3
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 0.19/0.43
% 0.19/0.43 -------- PROOF --------
% 0.19/0.43 % SZS status Unsatisfiable
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 ----> UNIT CONFLICT at 0.05 sec ----> 365 [binary,364.1,313.1] {-} $F.
% 0.19/0.43
% 0.19/0.43 Length of proof is 11. Level of proof is 4.
% 0.19/0.43
% 0.19/0.43 ---------------- PROOF ----------------
% 0.19/0.43 % SZS status Unsatisfiable
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 1 [] {-} apply(A,f(A))!=apply(f(A),apply(A,f(A))).
% 0.19/0.43 2 [copy,1,flip.1] {+} apply(f(A),apply(A,f(A)))!=apply(A,f(A)).
% 0.19/0.43 4,3 [] {-} apply(apply(apply(b,A),B),C)=apply(A,apply(B,C)).
% 0.19/0.43 5 [] {+} apply(m,A)=apply(A,A).
% 0.19/0.43 6 [] {-} apply(apply(apply(c,A),B),C)=apply(apply(A,C),B).
% 0.19/0.43 8 [copy,5,flip.1] {+} apply(A,A)=apply(m,A).
% 0.19/0.43 9 [copy,6,flip.1] {-} apply(apply(A,B),C)=apply(apply(apply(c,A),C),B).
% 0.19/0.43 12 [para_from,6.1.1,2.1.1.2] {+} apply(f(apply(apply(c,A),B)),apply(apply(A,f(apply(apply(c,A),B))),B))!=apply(apply(apply(c,A),B),f(apply(apply(c,A),B))).
% 0.19/0.43 18,17 [para_into,9.1.1,6.1.1,flip.1] {-} apply(apply(apply(c,apply(c,A)),B),C)=apply(apply(A,B),C).
% 0.19/0.43 19 [para_into,9.1.1,3.1.1] {-} apply(A,apply(B,C))=apply(apply(apply(c,apply(b,A)),C),B).
% 0.19/0.43 24 [copy,19,flip.1] {-} apply(apply(apply(c,apply(b,A)),B),C)=apply(A,apply(C,B)).
% 0.19/0.43 26 [para_from,9.1.1,3.1.1.1] {-} apply(apply(apply(apply(c,b),A),B),C)=apply(B,apply(A,C)).
% 0.19/0.43 313 [para_into,12.1.1.2,24.1.1,demod,18,4] {-} apply(f(apply(apply(c,apply(c,apply(b,A))),B)),apply(A,apply(B,f(apply(apply(c,apply(c,apply(b,A))),B)))))!=apply(A,apply(B,f(apply(apply(c,apply(c,apply(b,A))),B)))).
% 0.19/0.43 359 [para_into,26.1.1,8.1.1] {-} apply(m,apply(apply(apply(c,b),A),B))=apply(B,apply(A,apply(apply(apply(c,b),A),B))).
% 0.19/0.43 364 [copy,359,flip.1] {-} apply(A,apply(B,apply(apply(apply(c,b),B),A)))=apply(m,apply(apply(apply(c,b),B),A)).
% 0.19/0.43 365 [binary,364.1,313.1] {-} $F.
% 0.19/0.43
% 0.19/0.43 % SZS output end Refutation
% 0.19/0.43 ------------ end of proof -------------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43 ============ end of search ============
% 0.19/0.43
% 0.19/0.43 ----------- soft-scott stats ----------
% 0.19/0.43
% 0.19/0.43 true clauses given 6 (26.1%)
% 0.19/0.43 false clauses given 17
% 0.19/0.43
% 0.19/0.43 FALSE TRUE
% 0.19/0.43 13 0 2
% 0.19/0.43 15 24 2
% 0.19/0.43 16 1 0
% 0.19/0.43 17 29 7
% 0.19/0.43 19 30 2
% 0.19/0.43 21 57 1
% 0.19/0.43 22 0 2
% 0.19/0.43 23 36 0
% 0.19/0.43 24 2 0
% 0.19/0.43 28 0 3
% 0.19/0.43 30 3 5
% 0.19/0.43 32 5 1
% 0.19/0.43 33 1 0
% 0.19/0.43 34 4 1
% 0.19/0.43 35 1 1
% 0.19/0.43 36 0 2
% 0.19/0.43 38 4 5
% 0.19/0.43 40 5 2
% 0.19/0.43 42 5 2
% 0.19/0.43 44 7 2
% 0.19/0.43 46 7 0
% 0.19/0.43 48 3 0
% 0.19/0.43 50 2 0
% 0.19/0.43 54 4 0
% 0.19/0.43 55 1 0
% 0.19/0.43 56 1 2
% 0.19/0.43 57 2 0
% 0.19/0.43 tot: 234 42 (15.2% true)
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 That finishes the proof of the theorem.
% 0.19/0.43
% 0.19/0.43 Process 13793 finished Tue May 31 08:33:29 2022
%------------------------------------------------------------------------------