TSTP Solution File: CSR055+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CSR055+1 : TPTP v8.1.0. Released v3.4.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 23:21:38 EDT 2022
% Result : Theorem 0.50s 0.68s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : CSR055+1 : TPTP v8.1.0. Released v3.4.0.
% 0.06/0.10 % Command : sos-script %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Thu Jun 9 21:50:23 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.31 ----- Otter 3.2, August 2001 -----
% 0.15/0.31 The process was started by sandbox2 on n032.cluster.edu,
% 0.15/0.31 Thu Jun 9 21:50:23 2022
% 0.15/0.31 The command was "./sos". The process ID is 18801.
% 0.15/0.31
% 0.15/0.31 set(prolog_style_variables).
% 0.15/0.31 set(auto).
% 0.15/0.31 dependent: set(auto1).
% 0.15/0.31 dependent: set(process_input).
% 0.15/0.31 dependent: clear(print_kept).
% 0.15/0.31 dependent: clear(print_new_demod).
% 0.15/0.31 dependent: clear(print_back_demod).
% 0.15/0.31 dependent: clear(print_back_sub).
% 0.15/0.31 dependent: set(control_memory).
% 0.15/0.31 dependent: assign(max_mem, 12000).
% 0.15/0.31 dependent: assign(pick_given_ratio, 4).
% 0.15/0.31 dependent: assign(stats_level, 1).
% 0.15/0.31 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.31 dependent: assign(sos_limit, 5000).
% 0.15/0.31 dependent: assign(max_weight, 60).
% 0.15/0.31 clear(print_given).
% 0.15/0.31
% 0.15/0.31 formula_list(usable).
% 0.15/0.31
% 0.15/0.31 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.15/0.31
% 0.15/0.31 This is a Horn set without equality. The strategy will
% 0.15/0.31 be hyperresolution, with satellites in sos and nuclei
% 0.15/0.31 in usable.
% 0.15/0.31
% 0.15/0.31 dependent: set(hyper_res).
% 0.15/0.31 dependent: clear(order_hyper).
% 0.15/0.31
% 0.15/0.31 ------------> process usable:
% 0.15/0.31 Following clause subsumed by 2 during input processing: 0 [] {-} -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 0.15/0.31 Following clause subsumed by 3 during input processing: 0 [] {-} -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 0.15/0.31 Following clause subsumed by 7 during input processing: 0 [] {-} -arg2isa(A,B)| -genls(B,C)|arg2isa(A,C).
% 0.15/0.31 Following clause subsumed by 8 during input processing: 0 [] {-} -genlpreds(A,B)|predicate(B).
% 0.15/0.31 Following clause subsumed by 9 during input processing: 0 [] {-} -genlpreds(A,B)|predicate(A).
% 0.15/0.31 Following clause subsumed by 11 during input processing: 0 [] {-} -predicate(A)|genlpreds(A,A).
% 0.15/0.31 Following clause subsumed by 4 during input processing: 0 [] {-} -disjointwith(A,B)|collection(B).
% 0.15/0.31 Following clause subsumed by 25 during input processing: 0 [] {-} -genlmt(A,B)|microtheory(B).
% 0.15/0.31 Following clause subsumed by 26 during input processing: 0 [] {-} -genlmt(A,B)|microtheory(A).
% 0.15/0.31 Following clause subsumed by 28 during input processing: 0 [] {-} -microtheory(A)|genlmt(A,A).
% 0.15/0.31 Following clause subsumed by 31 during input processing: 0 [] {-} -isa(A,B)|collection(B).
% 0.15/0.31 Following clause subsumed by 32 during input processing: 0 [] {-} -isa(A,B)|thing(A).
% 0.15/0.31
% 0.15/0.31 ------------> process sos:
% 0.15/0.31
% 0.15/0.31 ======= end of input processing =======
% 0.15/0.34
% 0.15/0.34 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.34
% 0.15/0.34 Stopped by limit on number of solutions
% 0.15/0.34
% 0.15/0.34
% 0.15/0.34 -------------- Softie stats --------------
% 0.15/0.34
% 0.15/0.34 UPDATE_STOP: 300
% 0.15/0.34 SFINDER_TIME_LIMIT: 2
% 0.15/0.34 SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.34 number of clauses in intial UL: 33
% 0.15/0.34 number of clauses initially in problem: 44
% 0.15/0.34 percentage of clauses intially in UL: 75
% 0.15/0.34 percentage of distinct symbols occuring in initial UL: 70
% 0.15/0.34 percent of all initial clauses that are short: 100
% 0.15/0.34 absolute distinct symbol count: 27
% 0.15/0.34 distinct predicate count: 16
% 0.15/0.34 distinct function count: 0
% 0.15/0.34 distinct constant count: 11
% 0.15/0.34
% 0.15/0.34 ---------- no more Softie stats ----------
% 0.15/0.34
% 0.15/0.34
% 0.15/0.34
% 0.15/0.34 Model 2 (0.00 seconds, 0 Inserts)
% 0.15/0.34
% 0.15/0.34 Stopped by limit on number of solutions
% 0.15/0.34
% 0.15/0.34 =========== start of search ===========
% 0.50/0.68
% 0.50/0.68 -------- PROOF --------
% 0.50/0.68 % SZS status Theorem
% 0.50/0.68 % SZS output start Refutation
% 0.50/0.68
% 0.50/0.68 Model 3 (0.00 seconds, 0 Inserts)
% 0.50/0.68
% 0.50/0.68 Stopped by limit on number of solutions
% 0.50/0.68
% 0.50/0.68 Model 4 (0.00 seconds, 0 Inserts)
% 0.50/0.68
% 0.50/0.68 Stopped by limit on number of solutions
% 0.50/0.68
% 0.50/0.68 Model 5 (0.00 seconds, 0 Inserts)
% 0.50/0.68
% 0.50/0.68 Stopped by limit on number of solutions
% 0.50/0.68
% 0.50/0.68 Model 6 (0.00 seconds, 0 Inserts)
% 0.50/0.68
% 0.50/0.68 Stopped by limit on number of solutions
% 0.50/0.68
% 0.50/0.68 Model 7 (0.00 seconds, 0 Inserts)
% 0.50/0.68
% 0.50/0.68 Stopped by limit on number of solutions
% 0.50/0.68
% 0.50/0.68 Stopped by limit on insertions
% 0.50/0.68
% 0.50/0.68 Model 8 [ 4 0 127 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.68
% 0.50/0.68 Model 9 (0.00 seconds, 250000 Inserts)
% 0.50/0.68
% 0.50/0.68 Stopped by limit on number of solutions
% 0.50/0.68
% 0.50/0.68 Stopped by limit on insertions
% 0.50/0.68
% 0.50/0.68 Model 10 [ 1 0 186 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.68
% 0.50/0.68 Stopped by limit on insertions
% 0.50/0.68
% 0.50/0.68 Model 11 [ 2 0 246 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.68
% 0.50/0.68 Stopped by limit on insertions
% 0.50/0.68
% 0.50/0.68 Model 12 [ 4 0 245 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.68
% 0.50/0.68 -----> EMPTY CLAUSE at 0.35 sec ----> 61 [hyper,56,1,34] {-} $F.
% 0.50/0.68
% 0.50/0.68 Length of proof is 1. Level of proof is 1.
% 0.50/0.68
% 0.50/0.68 ---------------- PROOF ----------------
% 0.50/0.68 % SZS status Theorem
% 0.50/0.68 % SZS output start Refutation
% 0.50/0.68
% 0.50/0.68 1 [] {+} -collection(A)| -individual(A).
% 0.50/0.68 18 [] {+} -disjointwith(A,B)|collection(A).
% 0.50/0.68 34 [] {+} individual(c_xskijump_thegame).
% 0.50/0.68 44 [] {+} disjointwith(c_xskijump_thegame,c_tptpcol_16_35301).
% 0.50/0.68 56 [hyper,44,18] {+} collection(c_xskijump_thegame).
% 0.50/0.68 61 [hyper,56,1,34] {-} $F.
% 0.50/0.68
% 0.50/0.68 % SZS output end Refutation
% 0.50/0.68 ------------ end of proof -------------
% 0.50/0.68
% 0.50/0.68
% 0.50/0.68 Search stopped by max_proofs option.
% 0.50/0.68
% 0.50/0.68
% 0.50/0.68 Search stopped by max_proofs option.
% 0.50/0.68
% 0.50/0.68 ============ end of search ============
% 0.50/0.68
% 0.50/0.68 ----------- soft-scott stats ----------
% 0.50/0.68
% 0.50/0.68 true clauses given 4 (26.7%)
% 0.50/0.68 false clauses given 11
% 0.50/0.68
% 0.50/0.68 FALSE TRUE
% 0.50/0.68 2 2 4
% 0.50/0.68 3 2 3
% 0.50/0.68 tot: 4 7 (63.6% true)
% 0.50/0.68
% 0.50/0.68
% 0.50/0.68 Model 12 [ 4 0 245 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.68
% 0.50/0.68 That finishes the proof of the theorem.
% 0.50/0.68
% 0.50/0.68 Process 18801 finished Thu Jun 9 21:50:23 2022
%------------------------------------------------------------------------------