TSTP Solution File: CSR056+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CSR056+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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 1.07s 1.28s
% Output : Refutation 1.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR056+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.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 : Thu Jun 9 22:06:03 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 sandbox on n026.cluster.edu,
% 0.19/0.36 Thu Jun 9 22:06:03 2022
% 0.19/0.36 The command was "./sos". The process ID is 32445.
% 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 formula_list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.19/0.36
% 0.19/0.36 This is a Horn set without equality. The strategy will
% 0.19/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.19/0.36 in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: clear(order_hyper).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36 Following clause subsumed by 7 during input processing: 0 [] {-} -genlpreds(A,B)|predicate(B).
% 0.19/0.36 Following clause subsumed by 8 during input processing: 0 [] {-} -genlpreds(A,B)|predicate(A).
% 0.19/0.36 Following clause subsumed by 10 during input processing: 0 [] {-} -predicate(A)|genlpreds(A,A).
% 0.19/0.36 Following clause subsumed by 27 during input processing: 0 [] {-} -isa(A,B)|collection(B).
% 0.19/0.36 Following clause subsumed by 28 during input processing: 0 [] {-} -isa(A,B)|thing(A).
% 0.19/0.36 Following clause subsumed by 31 during input processing: 0 [] {-} -genlmt(A,B)|microtheory(B).
% 0.19/0.36 Following clause subsumed by 32 during input processing: 0 [] {-} -genlmt(A,B)|microtheory(A).
% 0.19/0.36 Following clause subsumed by 34 during input processing: 0 [] {-} -microtheory(A)|genlmt(A,A).
% 0.19/0.36 Following clause subsumed by 39 during input processing: 0 [] {-} -genls(A,B)|collection(B).
% 0.19/0.36 Following clause subsumed by 40 during input processing: 0 [] {-} -genls(A,B)|collection(A).
% 0.19/0.36 Following clause subsumed by 42 during input processing: 0 [] {-} -collection(A)|genls(A,A).
% 0.19/0.36 Following clause subsumed by 41 during input processing: 0 [] {-} -genls(A,B)| -genls(C,A)|genls(C,B).
% 0.19/0.36 Following clause subsumed by 41 during input processing: 0 [] {-} -genls(A,B)| -genls(B,C)|genls(A,C).
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 43
% 0.19/0.39 number of clauses initially in problem: 57
% 0.19/0.39 percentage of clauses intially in UL: 75
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 73
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 38
% 0.19/0.39 distinct predicate count: 21
% 0.19/0.39 distinct function count: 1
% 0.19/0.39 distinct constant count: 16
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 1.07/1.28
% 1.07/1.28 -------- PROOF --------
% 1.07/1.28 % SZS status Theorem
% 1.07/1.28 % SZS output start Refutation
% 1.07/1.28
% 1.07/1.28 Model 2 (0.00 seconds, 0 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on number of solutions
% 1.07/1.28
% 1.07/1.28 Model 3 (0.00 seconds, 0 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on number of solutions
% 1.07/1.28
% 1.07/1.28 Model 4 (0.00 seconds, 0 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on number of solutions
% 1.07/1.28
% 1.07/1.28 Model 5 (0.00 seconds, 0 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on number of solutions
% 1.07/1.28
% 1.07/1.28 Model 6 (0.00 seconds, 0 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on number of solutions
% 1.07/1.28
% 1.07/1.28 Model 7 (0.00 seconds, 0 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on number of solutions
% 1.07/1.28
% 1.07/1.28 Stopped by limit on insertions
% 1.07/1.28
% 1.07/1.28 Model 8 [ 1 1 203 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on insertions
% 1.07/1.28
% 1.07/1.28 Model 9 [ 1 1 204 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on insertions
% 1.07/1.28
% 1.07/1.28 Stopped by limit on insertions
% 1.07/1.28
% 1.07/1.28 Stopped by limit on insertions
% 1.07/1.28
% 1.07/1.28 Model 10 [ 2 0 234 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on insertions
% 1.07/1.28
% 1.07/1.28 Model 11 [ 2 0 279 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on insertions
% 1.07/1.28
% 1.07/1.28 Model 12 [ 2 0 554 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.28
% 1.07/1.28 Stopped by limit on insertions
% 1.07/1.28
% 1.07/1.28 Model 13 [ 2 0 268 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.28
% 1.07/1.28 ----> UNIT CONFLICT at 0.89 sec ----> 97 [binary,96.1,43.1] {-} $F.
% 1.07/1.28
% 1.07/1.28 Length of proof is 5. Level of proof is 5.
% 1.07/1.28
% 1.07/1.28 ---------------- PROOF ----------------
% 1.07/1.28 % SZS status Theorem
% 1.07/1.28 % SZS output start Refutation
% 1.07/1.28
% 1.07/1.28 1 [] {+} -artsupplies(A)|supplies(A).
% 1.07/1.28 2 [] {+} -mtvisible(c_tptp_spindleheadmt)| -supplies(A)|tptpofobject(A,f_tptpquantityfn_14(n_232)).
% 1.07/1.28 4 [] {+} -mtvisible(c_cyclistsmt)|artsupplies(c_tptpartsupplies).
% 1.07/1.28 30 [] {+} -mtvisible(A)| -genlmt(A,B)|mtvisible(B).
% 1.07/1.28 43 [] {+} -tptpofobject(c_tptpartsupplies,A).
% 1.07/1.28 50 [] {+} genlmt(c_tptp_spindleheadmt,c_cyclistsmt).
% 1.07/1.28 51 [] {+} genlmt(c_tptp_member3717_mt,c_tptp_spindleheadmt).
% 1.07/1.28 57 [] {+} mtvisible(c_tptp_member3717_mt).
% 1.07/1.28 74 [hyper,51,30,57] {-} mtvisible(c_tptp_spindleheadmt).
% 1.07/1.28 76 [hyper,74,30,50] {-} mtvisible(c_cyclistsmt).
% 1.07/1.28 79 [hyper,76,4] {+} artsupplies(c_tptpartsupplies).
% 1.07/1.28 91 [hyper,79,1] {+} supplies(c_tptpartsupplies).
% 1.07/1.28 96 [hyper,91,2,74] {-} tptpofobject(c_tptpartsupplies,f_tptpquantityfn_14(n_232)).
% 1.07/1.28 97 [binary,96.1,43.1] {-} $F.
% 1.07/1.28
% 1.07/1.28 % SZS output end Refutation
% 1.07/1.28 ------------ end of proof -------------
% 1.07/1.28
% 1.07/1.28
% 1.07/1.28 Search stopped by max_proofs option.
% 1.07/1.28
% 1.07/1.28
% 1.07/1.28 Search stopped by max_proofs option.
% 1.07/1.28
% 1.07/1.28 ============ end of search ============
% 1.07/1.28
% 1.07/1.28 ----------- soft-scott stats ----------
% 1.07/1.28
% 1.07/1.28 true clauses given 19 (57.6%)
% 1.07/1.28 false clauses given 14
% 1.07/1.28
% 1.07/1.28 FALSE TRUE
% 1.07/1.28 3 0 17
% 1.07/1.28 5 0 1
% 1.07/1.28 tot: 0 18 (100.0% true)
% 1.07/1.28
% 1.07/1.28
% 1.07/1.28 Model 13 [ 2 0 268 ] (0.00 seconds, 250000 Inserts)
% 1.07/1.28
% 1.07/1.28 That finishes the proof of the theorem.
% 1.07/1.28
% 1.07/1.28 Process 32445 finished Thu Jun 9 22:06:04 2022
%------------------------------------------------------------------------------