TSTP Solution File: SCT061-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SCT061-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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 : Mon Jul 18 22:11:54 EDT 2022
% Result : Unsatisfiable 0.19s 0.46s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SCT061-1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n015.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 : Sat Jul 2 06:27:29 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.43 ----- Otter 3.2, August 2001 -----
% 0.19/0.43 The process was started by sandbox on n015.cluster.edu,
% 0.19/0.43 Sat Jul 2 06:27:29 2022
% 0.19/0.43 The command was "./sos". The process ID is 13540.
% 0.19/0.43
% 0.19/0.43 set(prolog_style_variables).
% 0.19/0.43 set(auto).
% 0.19/0.43 dependent: set(auto1).
% 0.19/0.43 dependent: set(process_input).
% 0.19/0.43 dependent: clear(print_kept).
% 0.19/0.43 dependent: clear(print_new_demod).
% 0.19/0.43 dependent: clear(print_back_demod).
% 0.19/0.43 dependent: clear(print_back_sub).
% 0.19/0.43 dependent: set(control_memory).
% 0.19/0.43 dependent: assign(max_mem, 12000).
% 0.19/0.43 dependent: assign(pick_given_ratio, 4).
% 0.19/0.43 dependent: assign(stats_level, 1).
% 0.19/0.43 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.43 dependent: assign(sos_limit, 5000).
% 0.19/0.43 dependent: assign(max_weight, 60).
% 0.19/0.43 clear(print_given).
% 0.19/0.43
% 0.19/0.43 list(usable).
% 0.19/0.43
% 0.19/0.43 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.19/0.43
% 0.19/0.43 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.43 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.43 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.43 clauses in usable.
% 0.19/0.43
% 0.19/0.43 dependent: set(knuth_bendix).
% 0.19/0.43 dependent: set(para_from).
% 0.19/0.43 dependent: set(para_into).
% 0.19/0.43 dependent: clear(para_from_right).
% 0.19/0.43 dependent: clear(para_into_right).
% 0.19/0.43 dependent: set(para_from_vars).
% 0.19/0.43 dependent: set(eq_units_both_ways).
% 0.19/0.43 dependent: set(dynamic_demod_all).
% 0.19/0.43 dependent: set(dynamic_demod).
% 0.19/0.43 dependent: set(order_eq).
% 0.19/0.43 dependent: set(back_demod).
% 0.19/0.43 dependent: set(lrpo).
% 0.19/0.43 dependent: set(hyper_res).
% 0.19/0.43 dependent: set(unit_deletion).
% 0.19/0.43 dependent: set(factor).
% 0.19/0.43
% 0.19/0.43 ------------> process usable:
% 0.19/0.43 Following clause subsumed by 47 during input processing: 0 [] {-} A=B| -c_lessequals(B,A,tc_fun(C,tc_bool))| -c_lessequals(A,B,tc_fun(C,tc_bool)).
% 0.19/0.43 Following clause subsumed by 48 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|B=C| -c_lessequals(C,B,A)| -c_lessequals(B,C,A).
% 0.19/0.43 Following clause subsumed by 48 during input processing: 0 [] {-} -class_Orderings_Oorder(A)|B=C| -c_lessequals(B,C,A)| -c_lessequals(C,B,A).
% 0.19/0.43 Following clause subsumed by 66 during input processing: 0 [] {-} c_lessequals(c_Lattices_Oupper__semilattice__class_Osup(A,B,tc_fun(C,tc_bool)),D,tc_fun(C,tc_bool))| -c_lessequals(B,D,tc_fun(C,tc_bool))| -c_lessequals(A,D,tc_fun(C,tc_bool)).
% 0.19/0.43 Following clause subsumed by 67 during input processing: 0 [] {-} -class_Lattices_Oupper__semilattice(A)|c_lessequals(c_Lattices_Oupper__semilattice__class_Osup(B,C,A),D,A)| -c_lessequals(C,D,A)| -c_lessequals(B,D,A).
% 0.19/0.43 Following clause subsumed by 67 during input processing: 0 [] {-} -class_Lattices_Oupper__semilattice(A)|c_lessequals(c_Lattices_Oupper__semilattice__class_Osup(B,C,A),D,A)| -c_lessequals(C,D,A)| -c_lessequals(B,D,A).
% 0.19/0.43 Following clause subsumed by 18 during input processing: 0 [] {-} c_Set_Oinsert(A,B,C)!=c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool))|c_in(A,B,C).
% 0.19/0.43 Following clause subsumed by 15 during input processing: 0 [] {-} c_lessequals(A,c_Set_Oinsert(B,C,D),tc_fun(D,tc_bool))| -c_lessequals(A,C,tc_fun(D,tc_bool))|c_in(B,A,D).
% 0.19/0.43 Following clause subsumed by 15 during input processing: 0 [] {-} c_lessequals(A,c_Set_Oinsert(B,C,D),tc_fun(D,tc_bool))| -c_lessequals(A,C,tc_fun(D,tc_bool))|c_in(B,A,D).
% 0.19/0.43 Following clause subsumed by 79 during input processing: 0 [] {-} c_lessequals(A,B,tc_fun(C,tc_bool))| -c_lessequals(A,c_Set_Oinsert(D,B,C),tc_fun(C,tc_bool))|c_in(D,A,C).
% 0.19/0.43 Following clause subsumed by 86 during input processing: 0 [] {-} -class_Lattices_Olower__semilattice(A)|c_lessequals(B,C,A)| -c_lessequals(B,c_Lattices_Olower__semilattice__class_Oinf(C,D,A),A).
% 0.19/0.43 Following clause subsumed by 87 during input processing: 0 [] {-} -class_Lattices_Olower__semilattice(A)|c_lessequals(B,C,A)| -c_lessequals(B,c_Lattices_Olower__semilattice__class_Oinf(D,C,A),A).
% 0.19/0.43 Following clause subsumed by 103 during input processing: 0 [] {-} c_in(A,c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_fun(D,tc_bool)),D)| -c_in(A,C,D)| -c_in(A,B,D).
% 0.19/0.43 Following clause subsumed by 104 during input processing: 0 [] {-} c_in(A,B,C)| -c_lessequals(D,B,tc_fun(C,tc_bool))| -c_in(A,D,C).
% 0.19/0.43 Following clause subsumed by 104 during input processing: 0 [] {-} c_in(A,B,C)| -c_in(A,D,C)| -c_lessequals(D,B,tc_fun(C,tc_bool)).
% 0.19/0.43 Following clause subsumed by 104 during input processing: 0 [] {-} c_in(A,B,C)| -c_in(A,D,C)| -c_lessequals(D,B,tc_fun(C,tc_bool)).
% 0.19/0.43 Following clause subsumed by 107 during input processing: 0 [] {-} hBOOL(hAPP(A,B))| -c_in(B,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C).
% 0.19/0.43 Following clause subsumed by 107 during input processing: 0 [] {-} -c_in(A,c_Orderings_Obot__class_Obot(tc_fun(B,tc_bool)),B).
% 0.19/0.43 Following clause subsumed by 107 during input processing: 0 [] {-} -c_in(A,c_Orderings_Obot__class_Obot(tc_fun(B,tc_bool)),B).
% 0.19/0.43 Following clause subsumed by 107 during input processing: 0 [] {-} -hBOOL(hAPP(A,B))| -c_in(B,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C).
% 0.19/0.43 Following clause subsumed by 129 during input processing: 0 [] {-} -class_Lattices_Olower__semilattice(A)|c_lessequals(B,c_Lattices_Olower__semilattice__class_Oinf(C,D,A),A)| -c_lessequals(B,D,A)| -c_lessequals(B,C,A).
% 0.19/0.43 Following clause subsumed by 129 during input processing: 0 [] {-} -class_Lattices_Olower__semilattice(A)|c_lessequals(B,c_Lattices_Olower__semilattice__class_Oinf(C,D,A),A)| -c_lessequals(B,D,A)| -c_lessequals(B,C,A).
% 0.19/0.43 Following clause subsumed by 132 during input processing: 0 [] {-} c_lessequals(A,c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_fun(D,tc_bool)),tc_fun(D,tc_bool))| -c_lessequals(A,C,tc_fun(D,tc_bool))| -c_lessequals(A,B,tc_fun(D,tc_bool)).
% 0.19/0.43 Following clause subsumed by 143 during input processing: 0 [] {-} -class_Lattices_Oupper__semilattice(A)|c_lessequals(B,C,A)| -c_lessequals(c_Lattices_Oupper__semilattice__class_Osup(D,B,A),C,A).
% 0.19/0.43 Following clause subsumed by 144 during input processing: 0 [] {-} -class_Lattices_Oupper__semilattice(A)|c_lessequals(B,C,A)| -c_lessequals(c_Lattices_Oupper__semilattice__class_Osup(B,D,A),C,A).
% 0.19/0.43 Following clause subsumed by 152 during input processing: 0 [] {-} hBOOL(hAPP(A,B))| -c_lessequals(C,A,tc_fun(D,tc_bool))| -hBOOL(hAPP(C,B)).
% 0.19/0.43 Following clause subsumed by 241 during input processing: 0 [] {-} c_Relation_OImage(A,c_Set_Oinsert(B,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),C,C)=c_Relation_OImage(A,c_Set_Oinsert(D,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),C,C)| -c_in(c_Pair(B,D,C,C),A,tc_prod(C,C))| -c_Equiv__Relations_Oequiv(E,A,C).
% 0.19/0.43 Following clause subsumed by 242 during input processing: 0 [] {-} c_Relation_OImage(A,c_Set_Oinsert(B,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),C,C)!=c_Relation_OImage(A,c_Set_Oinsert(D,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),C,C)| -c_Equiv__Relations_Oequiv(E,A,C)|c_in(c_Pair(B,D,C,C),A,tc_prod(C,C))| -c_in(D,E,C)| -c_in(B,E,C).
% 0.19/0.43 Following clause subsumed by 241 during input processing: 0 [] {-} c_Relation_OImage(A,c_Set_Oinsert(B,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),C,C)=c_Relation_OImage(A,c_Set_Oinsert(D,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),C,C)| -c_in(c_Pair(B,D,C,C),A,tc_prod(C,C))| -c_in(D,E,C)| -c_in(B,E,C)| -c_Equiv__Relations_Oequiv(E,A,C).
% 0.19/0.43 Following clause subsumed by 242 during input processing: 0 [] {-} c_Relation_OImage(A,c_Set_Oinsert(B,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),C,C)!=c_Relation_OImage(A,c_Set_Oinsert(D,c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)),C),C,C)| -c_in(D,E,C)| -c_in(B,E,C)| -c_Equiv__Relations_Oequiv(E,A,C)|c_in(c_Pair(B,D,C,C),A,tc_prod(C,C)).
% 0.19/0.43 Following clause subsumed by 263 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(B,C,D),D)| -c_in(A,C,D).
% 0.19/0.43 Following clause subsumed by 292 during input processing: 0 [] {-} hAPP(c_Recdef_Ocut(A,B,C,D,E),F)=hAPP(A,F)| -c_in(c_Pair(F,C,D,D),B,tc_prod(D,D)).
% 0.19/0.43 Following clause subsumed by 294 during input processing: 0 [] {-} c_in(A,c_Wellfounded_Oacc(B,C),C)| -c_in(D,c_Wellfounded_Oacc(B,C),C)| -c_in(c_Pair(A,D,C,C),c_Transitive__Closure_Ortrancl(B,C),tc_prod(C,C)).
% 0.19/0.43 Following clause subsumed by 310 during input processing: 0 [] {-} c_in(c_Pair(A,B,C,C),c_Transitive__Closure_Otrancl(D,C),tc_prod(C,C))|A=B| -c_in(c_Pair(A,B,C,C),c_Transitive__Closure_Ortrancl(D,C),tc_prod(C,C)).
% 0.19/0.46 Following clause subsumed by 306 duri
% 0.19/0.46 -------- PROOF --------
% 0.19/0.46 % SZS status Unsatisfiable
% 0.19/0.46 % SZS output start Refutation
% 0.19/0.46 ng input processing: 0 [] {-} c_in(c_Pair(A,B,C,C),c_Transitive__Closure_Otrancl(D,C),tc_prod(C,C))| -c_in(c_Pair(A,B,C,C),D,tc_prod(C,C)).
% 0.19/0.46 Following clause subsumed by 330 during input processing: 0 [] {-} A=B| -c_in(c_Pair(B,A,C,C),D,tc_prod(C,C))| -c_in(c_Pair(A,B,C,C),D,tc_prod(C,C))| -c_Relation_Oantisym(D,C).
% 0.19/0.46 Following clause subsumed by 339 during input processing: 0 [] {-} c_in(c_Pair(A,B,C,C),D,tc_prod(C,C))| -c_in(c_Pair(B,A,C,C),D,tc_prod(C,C))| -c_Relation_Osym(D,C).
% 0.19/0.46 Following clause subsumed by 343 during input processing: 0 [] {-} -c_in(A,B,C)|c_in(hAPP(D,A),hAPP(E,A),F)| -c_in(D,c_FuncSet_OPi(B,E,C,F),tc_fun(C,F)).
% 0.19/0.46 Following clause subsumed by 370 during input processing: 0 [] {-} c_in(c_Pair(A,B,C,D),c_Product__Type_OSigma(E,F,C,D),tc_prod(C,D))| -c_in(B,hAPP(F,A),D)| -c_in(A,E,C).
% 0.19/0.46 Following clause subsumed by 371 during input processing: 0 [] {-} c_in(A,c_Wellfounded_Oacc(B,C),C)| -c_in(c_Pair(A,D,C,C),B,tc_prod(C,C))| -c_in(D,c_Wellfounded_Oacc(B,C),C).
% 0.19/0.46 Following clause subsumed by 372 during input processing: 0 [] {-} c_in(A,c_Relation_OImage(B,C,D,E),E)| -c_in(c_Pair(F,A,D,E),B,tc_prod(D,E))| -c_in(F,C,D).
% 0.19/0.46 Following clause subsumed by 377 during input processing: 0 [] {-} c_in(A,c_Relation_ORange(B,C,D),D)| -c_in(c_Pair(E,A,C,D),B,tc_prod(C,D)).
% 0.19/0.46 Following clause subsumed by 378 during input processing: 0 [] {-} c_in(A,c_Relation_ODomain(B,C,D),C)| -c_in(c_Pair(A,E,C,D),B,tc_prod(C,D)).
% 0.19/0.46 Following clause subsumed by 382 during input processing: 0 [] {-} c_in(c_Pair(A,A,B,B),C,tc_prod(B,B))| -c_in(A,D,B)| -c_Relation_Orefl__on(D,C,B).
% 0.19/0.46 Following clause subsumed by 395 during input processing: 0 [] {-} c_in(c_Pair(A,B,C,D),hAPP(c_Relation_Oconverse(D,C),E),tc_prod(C,D))| -c_in(c_Pair(B,A,D,C),E,tc_prod(D,C)).
% 0.19/0.46 Following clause subsumed by 121 during input processing: 0 [copy,18,flip.1] {-} c_Orderings_Obot__class_Obot(tc_fun(A,tc_bool))!=c_Set_Oinsert(B,C,A).
% 0.19/0.46 Following clause subsumed by 18 during input processing: 0 [copy,121,flip.1] {-} c_Set_Oinsert(A,B,C)!=c_Orderings_Obot__class_Obot(tc_fun(C,tc_bool)).
% 0.19/0.46 311 back subsumes 309.
% 0.19/0.46 347 back subsumes 346.
% 0.19/0.46 350 back subsumes 349.
% 0.19/0.46
% 0.19/0.46 ------------> process sos:
% 0.19/0.46 Following clause subsumed by 498 during input processing: 0 [] {-} c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(tc_prod(A,A),tc_bool)),B,tc_fun(tc_prod(A,A),tc_bool)).
% 0.19/0.46 Following clause subsumed by 498 during input processing: 0 [] {-} c_lessequals(c_Orderings_Obot__class_Obot(tc_fun(A,tc_bool)),c_Orderings_Obot__class_Obot(tc_fun(A,tc_bool)),tc_fun(A,tc_bool)).
% 0.19/0.46 Following clause subsumed by 586 during input processing: 0 [] {-} c_lessequals(A,A,tc_fun(B,tc_bool)).
% 0.19/0.46 Following clause subsumed by 632 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(A,B,C),C).
% 0.19/0.46 Following clause subsumed by 632 during input processing: 0 [] {-} c_in(A,c_Set_Oinsert(A,B,C),C).
% 0.19/0.46 Following clause subsumed by 707 during input processing: 0 [] {-} c_in(c_Pair(A,A,B,B),c_Transitive__Closure_Ortrancl(C,B),tc_prod(B,B)).
% 0.19/0.46 Following clause subsumed by 707 during input processing: 0 [demod,604] {-} c_in(c_Pair(A,A,B,B),c_Transitive__Closure_Ortrancl(c_Relation_OId__on(c_Orderings_Obot__class_Obot(tc_fun(B,tc_bool)),B),B),tc_prod(B,B)).
% 0.19/0.46 Following clause subsumed by 707 during input processing: 0 [demod,604] {-} c_in(c_Pair(A,A,B,B),c_Transitive__Closure_Ortrancl(c_Relation_OId__on(c_Orderings_Obot__class_Obot(tc_fun(B,tc_bool)),B),B),tc_prod(B,B)).
% 0.19/0.46
% 0.19/0.46 ----> UNIT CONFLICT at 0.06 sec ----> 727 [binary,725.1,390.1] {-} $F.
% 0.19/0.46
% 0.19/0.46 Length of proof is 1. Level of proof is 1.
% 0.19/0.46
% 0.19/0.46 ---------------- PROOF ----------------
% 0.19/0.46 % SZS status Unsatisfiable
% 0.19/0.46 % SZS output start Refutation
% 0.19/0.46
% 0.19/0.46 389 [] {-} v_a____!=v_b____.
% 0.19/0.46 390 [copy,389,flip.1] {-} v_b____!=v_a____.
% 0.19/0.46 725 [] {-} v_b____=v_a____.
% 0.19/0.46 727 [binary,725.1,390.1] {-} $F.
% 0.19/0.46
% 0.19/0.46 % SZS output end Refutation
% 0.19/0.46 ------------ end of proof -------------
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 Search stopped by max_proofs option.
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 Search stopped by max_proofs option.
% 0.19/0.46
% 0.19/0.46 ============ end of search ============
% 0.19/0.46
% 0.19/0.46 That finishes the proof of the theorem.
% 0.19/0.46
% 0.19/0.46 Process 13540 finished Sat Jul 2 06:27:29 2022
%------------------------------------------------------------------------------