%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET677+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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 : Tue Jul 19 05:20:00 EDT 2022
% Result : Theorem 1.45s 1.65s
% Output : Refutation 1.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET677+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.31 % Computer : n016.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Sun Jul 10 01:51:40 EDT 2022
% 0.12/0.31 % CPUTime :
% 0.17/0.34 ----- Otter 3.2, August 2001 -----
% 0.17/0.34 The process was started by sandbox on n016.cluster.edu,
% 0.17/0.34 Sun Jul 10 01:51:40 2022
% 0.17/0.34 The command was "./sos". The process ID is 12184.
% 0.17/0.34
% 0.17/0.34 set(prolog_style_variables).
% 0.17/0.34 set(auto).
% 0.17/0.34 dependent: set(auto1).
% 0.17/0.34 dependent: set(process_input).
% 0.17/0.34 dependent: clear(print_kept).
% 0.17/0.34 dependent: clear(print_new_demod).
% 0.17/0.34 dependent: clear(print_back_demod).
% 0.17/0.34 dependent: clear(print_back_sub).
% 0.17/0.34 dependent: set(control_memory).
% 0.17/0.34 dependent: assign(max_mem, 12000).
% 0.17/0.34 dependent: assign(pick_given_ratio, 4).
% 0.17/0.34 dependent: assign(stats_level, 1).
% 0.17/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.17/0.34 dependent: assign(sos_limit, 5000).
% 0.17/0.34 dependent: assign(max_weight, 60).
% 0.17/0.34 clear(print_given).
% 0.17/0.34
% 0.17/0.34 formula_list(usable).
% 0.17/0.34
% 0.17/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.17/0.34
% 0.17/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.17/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.17/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.17/0.34 clauses in usable.
% 0.17/0.34
% 0.17/0.34 dependent: set(knuth_bendix).
% 0.17/0.34 dependent: set(para_from).
% 0.17/0.34 dependent: set(para_into).
% 0.17/0.34 dependent: clear(para_from_right).
% 0.17/0.34 dependent: clear(para_into_right).
% 0.17/0.34 dependent: set(para_from_vars).
% 0.17/0.34 dependent: set(eq_units_both_ways).
% 0.17/0.34 dependent: set(dynamic_demod_all).
% 0.17/0.34 dependent: set(dynamic_demod).
% 0.17/0.34 dependent: set(order_eq).
% 0.17/0.34 dependent: set(back_demod).
% 0.17/0.34 dependent: set(lrpo).
% 0.17/0.34 dependent: set(hyper_res).
% 0.17/0.34 dependent: set(unit_deletion).
% 0.17/0.34 dependent: set(factor).
% 0.17/0.34
% 0.17/0.34 ------------> process usable:
% 0.17/0.34
% 0.17/0.34 ------------> process sos:
% 0.17/0.34 Following clause subsumed by 118 during input processing: 0 [] {-} ilf_type($c3,set_type).
% 0.17/0.34 118 back subsumes 102.
% 0.17/0.34 118 back subsumes 101.
% 0.17/0.34 118 back subsumes 96.
% 0.17/0.34 118 back subsumes 92.
% 0.17/0.34 118 back subsumes 84.
% 0.17/0.34 118 back subsumes 58.
% 0.17/0.34 118 back subsumes 53.
% 0.17/0.34 118 back subsumes 50.
% 0.17/0.34 118 back subsumes 49.
% 0.17/0.34 118 back subsumes 45.
% 0.17/0.34 118 back subsumes 41.
% 0.17/0.34 118 back subsumes 39.
% 0.17/0.34 118 back subsumes 34.
% 0.17/0.34 118 back subsumes 24.
% 0.17/0.34 118 back subsumes 23.
% 0.17/0.34 118 back subsumes 22.
% 0.17/0.34 118 back subsumes 16.
% 0.17/0.34 118 back subsumes 15.
% 0.17/0.34 Following clause subsumed by 121 during input processing: 0 [copy,121,flip.1] {-} A=A.
% 0.17/0.34 121 back subsumes 114.
% 0.17/0.34 121 back subsumes 83.
% 0.17/0.34 121 back subsumes 76.
% 0.17/0.34
% 0.17/0.34 ======= end of input processing =======
% 0.17/0.38
% 0.17/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.38
% 0.17/0.38 Stopped by limit on number of solutions
% 0.17/0.38
% 0.17/0.38
% 0.17/0.38 -------------- Softie stats --------------
% 0.17/0.38
% 0.17/0.38 UPDATE_STOP: 300
% 0.17/0.38 SFINDER_TIME_LIMIT: 2
% 0.17/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.38 number of clauses in intial UL: 91
% 0.17/0.38 number of clauses initially in problem: 96
% 0.17/0.38 percentage of clauses intially in UL: 94
% 0.17/0.38 percentage of distinct symbols occuring in initial UL: 97
% 0.17/0.38 percent of all initial clauses that are short: 98
% 0.17/0.38 absolute distinct symbol count: 35
% 0.17/0.38 distinct predicate count: 6
% 0.17/0.38 distinct function count: 24
% 0.17/0.38 distinct constant count: 5
% 0.17/0.38
% 0.17/0.38 ---------- no more Softie stats ----------
% 0.17/0.38
% 0.17/0.38
% 0.17/0.38
% 0.17/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.17/0.38
% 0.17/0.38 Stopped by limit on number of solutions
% 0.17/0.38
% 0.17/0.38 =========== start of search ===========
% 1.45/1.65
% 1.45/1.65 -------- PROOF --------
% 1.45/1.65 % SZS status Theorem
% 1.45/1.65 % SZS output start Refutation
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 Model 3 [ 2 1 6577 ] (0.00 seconds, 250000 Inserts)
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 Model 4 [ 2 1 8980 ] (0.00 seconds, 250000 Inserts)
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 Model 5 [ 1 12 157192 ] (0.00 seconds, 250000 Inserts)
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 Model 6 [ 4 0 880 ] (0.00 seconds, 250000 Inserts)
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 Model 7 [ 2 6 120525 ] (0.00 seconds, 250000 Inserts)
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 Model 8 [ 2 0 6712 ] (0.00 seconds, 250000 Inserts)
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 Stopped by limit on insertions
% 1.45/1.65
% 1.45/1.65 -----> EMPTY CLAUSE at 1.29 sec ----> 279 [back_demod,66,demod,275,272,unit_del,121,121] {-} $F.
% 1.45/1.65
% 1.45/1.65 Length of proof is 8. Level of proof is 3.
% 1.45/1.65
% 1.45/1.65 ---------------- PROOF ----------------
% 1.45/1.65 % SZS status Theorem
% 1.45/1.65 % SZS output start Refutation
% 1.45/1.65
% 1.45/1.65 1 [] {-} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(B,A))| -subset(identity_relation_of(B),C)|B=domain(B,A,C).
% 1.45/1.65 2 [copy,1,flip.5] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(B,A))| -subset(identity_relation_of(B),C)|domain(B,A,C)=B.
% 1.45/1.65 5 [] {-} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(A,B))| -subset(identity_relation_of(B),C)|B=range(A,B,C).
% 1.45/1.65 6 [copy,5,flip.5] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(A,B))| -subset(identity_relation_of(B),C)|range(A,B,C)=B.
% 1.45/1.65 11 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(B,identity_relation_of_type(A))|ilf_type(B,relation_type(A,A)).
% 1.45/1.65 65 [] {-} $c3!=domain($c3,$c3,$c2)|$c3!=range($c3,$c3,$c2).
% 1.45/1.65 66 [copy,65,flip.1,flip.2] {+} domain($c3,$c3,$c2)!=$c3|range($c3,$c3,$c2)!=$c3.
% 1.45/1.65 67 [factor,2.1.2] {+} -ilf_type(A,set_type)| -ilf_type(B,relation_type(A,A))| -subset(identity_relation_of(A),B)|domain(A,A,B)=A.
% 1.45/1.65 70 [factor,6.1.2] {+} -ilf_type(A,set_type)| -ilf_type(B,relation_type(A,A))| -subset(identity_relation_of(A),B)|range(A,A,B)=A.
% 1.45/1.65 118 [] {-} ilf_type(A,set_type).
% 1.45/1.65 119 [] {+} ilf_type($c2,identity_relation_of_type($c3)).
% 1.45/1.65 120 [] {-} subset(identity_relation_of($c3),$c2).
% 1.45/1.65 121 [] {+} A=A.
% 1.45/1.65 152 [hyper,119,11,118,118] {+} ilf_type($c2,relation_type($c3,$c3)).
% 1.45/1.65 272,271 [hyper,152,70,118,120] {-} range($c3,$c3,$c2)=$c3.
% 1.45/1.65 275,274 [hyper,152,67,118,120] {-} domain($c3,$c3,$c2)=$c3.
% 1.45/1.65 279 [back_demod,66,demod,275,272,unit_del,121,121] {-} $F.
% 1.45/1.65
% 1.45/1.65 % SZS output end Refutation
% 1.45/1.65 ------------ end of proof -------------
% 1.45/1.65
% 1.45/1.65
% 1.45/1.65 Search stopped by max_proofs option.
% 1.45/1.65
% 1.45/1.65
% 1.45/1.65 Search stopped by max_proofs option.
% 1.45/1.65
% 1.45/1.65 ============ end of search ============
% 1.45/1.65
% 1.45/1.65 ----------- soft-scott stats ----------
% 1.45/1.65
% 1.45/1.65 true clauses given 3 (17.6%)
% 1.45/1.65 false clauses given 14
% 1.45/1.65
% 1.45/1.65 FALSE TRUE
% 1.45/1.65 6 3 2
% 1.45/1.65 7 3 0
% 1.45/1.65 8 1 3
% 1.45/1.65 9 3 4
% 1.45/1.65 10 5 9
% 1.45/1.65 11 4 5
% 1.45/1.65 12 1 5
% 1.45/1.65 13 2 1
% 1.45/1.65 14 0 1
% 1.45/1.65 15 6 7
% 1.45/1.65 16 1 1
% 1.45/1.65 17 1 0
% 1.45/1.65 19 0 1
% 1.45/1.65 tot: 30 39 (56.5% true)
% 1.45/1.65
% 1.45/1.65
% 1.45/1.65 Model 8 [ 2 -26 6712 ] (0.00 seconds, 250000 Inserts)
% 1.45/1.65
% 1.45/1.65 That finishes the proof of the theorem.
% 1.45/1.65
% 1.45/1.65 Process 12184 finished Sun Jul 10 01:51:41 2022
%------------------------------------------------------------------------------