TSTP Solution File: MGT006+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT006+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:46 EDT 2022
% Result : Theorem 1.36s 1.60s
% Output : Refutation 1.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT006+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n022.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 08:12:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n022.cluster.edu,
% 0.12/0.35 Thu Jun 9 08:12:19 2022
% 0.12/0.35 The command was "./sos". The process ID is 22511.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=11.
% 0.12/0.35
% 0.12/0.35 This is a Horn set without equality. The strategy will
% 0.12/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35 in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.47
% 0.18/0.47 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.47
% 0.18/0.47 Stopped by limit on number of solutions
% 0.18/0.47
% 0.18/0.47
% 0.18/0.47 -------------- Softie stats --------------
% 0.18/0.47
% 0.18/0.47 UPDATE_STOP: 300
% 0.18/0.47 SFINDER_TIME_LIMIT: 2
% 0.18/0.47 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.47 number of clauses in intial UL: 6
% 0.18/0.47 number of clauses initially in problem: 14
% 0.18/0.47 percentage of clauses intially in UL: 42
% 0.18/0.47 percentage of distinct symbols occuring in initial UL: 78
% 0.18/0.47 percent of all initial clauses that are short: 100
% 0.18/0.47 absolute distinct symbol count: 14
% 0.18/0.47 distinct predicate count: 6
% 0.18/0.47 distinct function count: 1
% 0.18/0.47 distinct constant count: 7
% 0.18/0.47
% 0.18/0.47 ---------- no more Softie stats ----------
% 0.18/0.47
% 0.18/0.47
% 0.18/0.47
% 0.18/0.47 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.47
% 0.18/0.47 Stopped by limit on number of solutions
% 0.18/0.47
% 0.18/0.47 =========== start of search ===========
% 1.36/1.60
% 1.36/1.60 -------- PROOF --------
% 1.36/1.60 % SZS status Theorem
% 1.36/1.60 % SZS output start Refutation
% 1.36/1.60
% 1.36/1.60 Model 3 (0.00 seconds, 0 Inserts)
% 1.36/1.60
% 1.36/1.60 Stopped by limit on number of solutions
% 1.36/1.60
% 1.36/1.60 Stopped by limit on insertions
% 1.36/1.60
% 1.36/1.60 Stopped by limit on insertions
% 1.36/1.60
% 1.36/1.60 Stopped by limit on insertions
% 1.36/1.60
% 1.36/1.60 Model 4 [ 1 1 280 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.60
% 1.36/1.60 Stopped by limit on insertions
% 1.36/1.60
% 1.36/1.60 Stopped by limit on insertions
% 1.36/1.60
% 1.36/1.60 Stopped by limit on insertions
% 1.36/1.60
% 1.36/1.60 -----> EMPTY CLAUSE at 1.10 sec ----> 20 [hyper,19,6,18] {-} $F.
% 1.36/1.60
% 1.36/1.60 Length of proof is 5. Level of proof is 3.
% 1.36/1.60
% 1.36/1.60 ---------------- PROOF ----------------
% 1.36/1.60 % SZS status Theorem
% 1.36/1.60 % SZS output start Refutation
% 1.36/1.60
% 1.36/1.60 1 [] {+} -organization(A,B)|reproducibility(A,$f1(A,B),B).
% 1.36/1.60 2 [] {+} -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).
% 1.36/1.60 3 [] {+} -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).
% 1.36/1.60 5 [] {+} -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -reproducibility(A,D,B)| -reproducibility(A,E,C)| -greater(C,B)|greater(E,D).
% 1.36/1.60 6 [] {+} -greater($c5,$c6)| -greater($c3,$c4).
% 1.36/1.60 7 [] {+} organization($c7,$c2).
% 1.36/1.60 8 [] {+} organization($c7,$c1).
% 1.36/1.60 9 [] {-} reorganization_free($c7,$c2,$c1).
% 1.36/1.60 10 [] {-} reliability($c7,$c6,$c2).
% 1.36/1.60 11 [] {+} reliability($c7,$c5,$c1).
% 1.36/1.60 12 [] {+} accountability($c7,$c4,$c2).
% 1.36/1.60 13 [] {+} accountability($c7,$c3,$c1).
% 1.36/1.60 14 [] {-} greater($c1,$c2).
% 1.36/1.60 15 [hyper,7,1] {+} reproducibility($c7,$f1($c7,$c2),$c2).
% 1.36/1.60 16 [hyper,8,1] {+} reproducibility($c7,$f1($c7,$c1),$c1).
% 1.36/1.60 17 [hyper,16,5,7,8,9,15,14] {-} greater($f1($c7,$c1),$f1($c7,$c2)).
% 1.36/1.60 18 [hyper,17,3,7,8,10,11,12,13,15,16] {-} greater($c3,$c4).
% 1.36/1.60 19 [hyper,17,2,7,8,10,11,12,13,15,16] {-} greater($c5,$c6).
% 1.36/1.60 20 [hyper,19,6,18] {-} $F.
% 1.36/1.60
% 1.36/1.60 % SZS output end Refutation
% 1.36/1.60 ------------ end of proof -------------
% 1.36/1.60
% 1.36/1.60
% 1.36/1.60 Search stopped by max_proofs option.
% 1.36/1.60
% 1.36/1.60
% 1.36/1.60 Search stopped by max_proofs option.
% 1.36/1.60
% 1.36/1.60 ============ end of search ============
% 1.36/1.60
% 1.36/1.60 ----------- soft-scott stats ----------
% 1.36/1.60
% 1.36/1.60 true clauses given 4 (30.8%)
% 1.36/1.60 false clauses given 9
% 1.36/1.60
% 1.36/1.60 FALSE TRUE
% 1.36/1.60 tot: 0 0 (-nan% true)
% 1.36/1.60
% 1.36/1.60
% 1.36/1.60 Model 4 [ 1 -44 280 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.60
% 1.36/1.60 That finishes the proof of the theorem.
% 1.36/1.60
% 1.36/1.60 Process 22511 finished Thu Jun 9 08:12:21 2022
%------------------------------------------------------------------------------