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.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 : Sun Jul 17 22:25:46 EDT 2022
% Result : Unsatisfiable 1.36s 1.56s
% Output : Refutation 1.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : MGT006-1 : TPTP v8.1.0. Released v2.4.0.
% 0.04/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 08:33:02 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 sandbox2 on n026.cluster.edu,
% 0.19/0.36 Thu Jun 9 08:33:02 2022
% 0.19/0.36 The command was "./sos". The process ID is 31734.
% 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 list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=11.
% 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
% 0.19/0.36 ------------> process sos:
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.49
% 0.19/0.49 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.49
% 0.19/0.49 Stopped by limit on number of solutions
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 -------------- Softie stats --------------
% 0.19/0.49
% 0.19/0.49 UPDATE_STOP: 300
% 0.19/0.49 SFINDER_TIME_LIMIT: 2
% 0.19/0.49 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.49 number of clauses in intial UL: 6
% 0.19/0.49 number of clauses initially in problem: 14
% 0.19/0.49 percentage of clauses intially in UL: 42
% 0.19/0.49 percentage of distinct symbols occuring in initial UL: 78
% 0.19/0.49 percent of all initial clauses that are short: 100
% 0.19/0.49 absolute distinct symbol count: 14
% 0.19/0.49 distinct predicate count: 6
% 0.19/0.49 distinct function count: 1
% 0.19/0.49 distinct constant count: 7
% 0.19/0.49
% 0.19/0.49 ---------- no more Softie stats ----------
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.49
% 0.19/0.49 Stopped by limit on number of solutions
% 0.19/0.49
% 0.19/0.49 =========== start of search ===========
% 1.36/1.56
% 1.36/1.56 -------- PROOF --------
% 1.36/1.56 % SZS status Unsatisfiable
% 1.36/1.56 % SZS output start Refutation
% 1.36/1.56
% 1.36/1.56 Model 3 (0.00 seconds, 0 Inserts)
% 1.36/1.56
% 1.36/1.56 Stopped by limit on number of solutions
% 1.36/1.56
% 1.36/1.56 Stopped by limit on insertions
% 1.36/1.56
% 1.36/1.56 Stopped by limit on insertions
% 1.36/1.56
% 1.36/1.56 Stopped by limit on insertions
% 1.36/1.56
% 1.36/1.56 Model 4 [ 1 2 280 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.56
% 1.36/1.56 Stopped by limit on insertions
% 1.36/1.56
% 1.36/1.56 Stopped by limit on insertions
% 1.36/1.56
% 1.36/1.56 Stopped by limit on insertions
% 1.36/1.56
% 1.36/1.56 -----> EMPTY CLAUSE at 1.06 sec ----> 20 [hyper,19,6,18] {-} $F.
% 1.36/1.56
% 1.36/1.56 Length of proof is 5. Level of proof is 3.
% 1.36/1.56
% 1.36/1.56 ---------------- PROOF ----------------
% 1.36/1.56 % SZS status Unsatisfiable
% 1.36/1.56 % SZS output start Refutation
% 1.36/1.56
% 1.36/1.56 1 [] {+} -organization(A,B)|reproducibility(A,sk1(B,A),B).
% 1.36/1.56 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.56 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.56 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.56 6 [] {+} -greater(sk4,sk3)| -greater(sk6,sk5).
% 1.36/1.56 7 [] {+} organization(sk2,sk7).
% 1.36/1.56 8 [] {+} organization(sk2,sk8).
% 1.36/1.56 9 [] {-} reorganization_free(sk2,sk7,sk8).
% 1.36/1.56 10 [] {-} reliability(sk2,sk3,sk7).
% 1.36/1.56 11 [] {+} reliability(sk2,sk4,sk8).
% 1.36/1.56 12 [] {+} accountability(sk2,sk5,sk7).
% 1.36/1.56 13 [] {+} accountability(sk2,sk6,sk8).
% 1.36/1.56 14 [] {-} greater(sk8,sk7).
% 1.36/1.56 15 [hyper,7,1] {+} reproducibility(sk2,sk1(sk7,sk2),sk7).
% 1.36/1.56 16 [hyper,8,1] {+} reproducibility(sk2,sk1(sk8,sk2),sk8).
% 1.36/1.56 17 [hyper,16,5,7,8,9,15,14] {-} greater(sk1(sk8,sk2),sk1(sk7,sk2)).
% 1.36/1.56 18 [hyper,17,3,7,8,10,11,12,13,15,16] {-} greater(sk6,sk5).
% 1.36/1.56 19 [hyper,17,2,7,8,10,11,12,13,15,16] {-} greater(sk4,sk3).
% 1.36/1.56 20 [hyper,19,6,18] {-} $F.
% 1.36/1.56
% 1.36/1.56 % SZS output end Refutation
% 1.36/1.56 ------------ end of proof -------------
% 1.36/1.56
% 1.36/1.56
% 1.36/1.56 Search stopped by max_proofs option.
% 1.36/1.56
% 1.36/1.56
% 1.36/1.56 Search stopped by max_proofs option.
% 1.36/1.56
% 1.36/1.56 ============ end of search ============
% 1.36/1.56
% 1.36/1.56 ----------- soft-scott stats ----------
% 1.36/1.56
% 1.36/1.56 true clauses given 4 (30.8%)
% 1.36/1.56 false clauses given 9
% 1.36/1.56
% 1.36/1.56 FALSE TRUE
% 1.36/1.56 tot: 0 0 (-nan% true)
% 1.36/1.56
% 1.36/1.56
% 1.36/1.56 Model 4 [ 1 -42 280 ] (0.00 seconds, 250000 Inserts)
% 1.36/1.56
% 1.36/1.56 That finishes the proof of the theorem.
% 1.36/1.56
% 1.36/1.56 Process 31734 finished Thu Jun 9 08:33:04 2022
%------------------------------------------------------------------------------