TSTP Solution File: MGT001+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT001+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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 : Sun Jul 17 22:25:44 EDT 2022
% Result : Theorem 0.46s 0.66s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MGT001+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 09:19:47 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox2 on n028.cluster.edu,
% 0.12/0.34 Thu Jun 9 09:19:47 2022
% 0.12/0.34 The command was "./sos". The process ID is 9885.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 formula_list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=11.
% 0.12/0.34
% 0.12/0.34 This is a Horn set without equality. The strategy will
% 0.12/0.34 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.34 in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: clear(order_hyper).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.19/0.47
% 0.19/0.47 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.47
% 0.19/0.47 Stopped by limit on number of solutions
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 -------------- Softie stats --------------
% 0.19/0.47
% 0.19/0.47 UPDATE_STOP: 300
% 0.19/0.47 SFINDER_TIME_LIMIT: 2
% 0.19/0.47 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.47 number of clauses in intial UL: 10
% 0.19/0.47 number of clauses initially in problem: 19
% 0.19/0.47 percentage of clauses intially in UL: 52
% 0.19/0.47 percentage of distinct symbols occuring in initial UL: 68
% 0.19/0.47 percent of all initial clauses that are short: 100
% 0.19/0.47 absolute distinct symbol count: 19
% 0.19/0.47 distinct predicate count: 8
% 0.19/0.47 distinct function count: 3
% 0.19/0.47 distinct constant count: 8
% 0.19/0.47
% 0.19/0.47 ---------- no more Softie stats ----------
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 =========== start of search ===========
% 0.46/0.66
% 0.46/0.66 -------- PROOF --------
% 0.46/0.66 % SZS status Theorem
% 0.46/0.66 % SZS output start Refutation
% 0.46/0.66
% 0.46/0.66 Stopped by limit on insertions
% 0.46/0.66
% 0.46/0.66 ----> UNIT CONFLICT at 0.28 sec ----> 30 [binary,29.1,10.1] {-} $F.
% 0.46/0.66
% 0.46/0.66 Length of proof is 10. Level of proof is 4.
% 0.46/0.66
% 0.46/0.66 ---------------- PROOF ----------------
% 0.46/0.66 % SZS status Theorem
% 0.46/0.66 % SZS output start Refutation
% 0.46/0.66
% 0.46/0.66 1 [] {+} -organization(A,B)|reliability(A,$f1(A,B),B).
% 0.46/0.66 2 [] {+} -organization(A,B)|accountability(A,$f2(A,B),B).
% 0.46/0.66 3 [] {+} -organization(A,B)|reproducibility(A,$f3(A,B),B).
% 0.46/0.66 4 [] {+} -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -survival_chance(A,I,B)| -survival_chance(C,J,D)| -greater(F,E)| -greater(H,G)|greater(J,I).
% 0.46/0.66 5 [] {+} -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)| -greater(J,I)|greater(F,E).
% 0.46/0.66 6 [] {+} -organization(A,B)| -organization(C,D)| -reliability(A,E,B)| -reliability(C,F,D)| -accountability(A,G,B)| -accountability(C,H,D)| -reproducibility(A,I,B)| -reproducibility(C,J,D)| -greater(J,I)|greater(H,G).
% 0.46/0.66 9 [] {+} -organization(A,B)| -organization(C,D)| -reorganization_free(A,B,B)| -reorganization_free(C,D,D)| -reproducibility(A,E,B)| -reproducibility(C,F,D)| -inertia(A,G,B)| -inertia(C,H,D)|greater(F,E)| -greater(H,G).
% 0.46/0.66 10 [] {+} -greater($c1,$c2).
% 0.46/0.66 11 [] {+} organization($c8,$c6).
% 0.46/0.66 12 [] {+} organization($c7,$c5).
% 0.46/0.66 13 [] {+} reorganization_free($c8,$c6,$c6).
% 0.46/0.66 14 [] {+} reorganization_free($c7,$c5,$c5).
% 0.46/0.66 15 [] {+} inertia($c8,$c4,$c6).
% 0.46/0.66 16 [] {+} inertia($c7,$c3,$c5).
% 0.46/0.66 17 [] {+} survival_chance($c8,$c2,$c6).
% 0.46/0.66 18 [] {+} survival_chance($c7,$c1,$c5).
% 0.46/0.66 19 [] {-} greater($c3,$c4).
% 0.46/0.66 20 [hyper,11,3] {+} reproducibility($c8,$f3($c8,$c6),$c6).
% 0.46/0.66 21 [hyper,11,2] {+} accountability($c8,$f2($c8,$c6),$c6).
% 0.46/0.66 22 [hyper,11,1] {+} reliability($c8,$f1($c8,$c6),$c6).
% 0.46/0.66 23 [hyper,12,3] {+} reproducibility($c7,$f3($c7,$c5),$c5).
% 0.46/0.66 24 [hyper,12,2] {+} accountability($c7,$f2($c7,$c5),$c5).
% 0.46/0.66 25 [hyper,12,1] {+} reliability($c7,$f1($c7,$c5),$c5).
% 0.46/0.66 26 [hyper,23,9,11,12,13,14,20,15,16,19] {-} greater($f3($c7,$c5),$f3($c8,$c6)).
% 0.46/0.66 27 [hyper,25,6,11,12,22,21,24,20,23,26] {-} greater($f2($c7,$c5),$f2($c8,$c6)).
% 0.46/0.66 28 [hyper,25,5,11,12,22,21,24,20,23,26] {-} greater($f1($c7,$c5),$f1($c8,$c6)).
% 0.46/0.66 29 [hyper,28,4,11,12,22,25,21,24,17,18,27] {-} greater($c1,$c2).
% 0.46/0.66 30 [binary,29.1,10.1] {-} $F.
% 0.46/0.66
% 0.46/0.66 % SZS output end Refutation
% 0.46/0.66 ------------ end of proof -------------
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 Search stopped by max_proofs option.
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 Search stopped by max_proofs option.
% 0.46/0.66
% 0.46/0.66 ============ end of search ============
% 0.46/0.66
% 0.46/0.66 ----------- soft-scott stats ----------
% 0.46/0.66
% 0.46/0.66 true clauses given 14 (77.8%)
% 0.46/0.66 false clauses given 4
% 0.46/0.66
% 0.46/0.66 FALSE TRUE
% 0.46/0.66 tot: 0 0 (-nan% true)
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 Model 1 (0.00 seconds, 0 Inserts)
% 0.46/0.66
% 0.46/0.66 That finishes the proof of the theorem.
% 0.46/0.66
% 0.46/0.66 Process 9885 finished Thu Jun 9 09:19:47 2022
%------------------------------------------------------------------------------