TSTP Solution File: MGT007-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT007-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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 0.82s 1.04s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : MGT007-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n024.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 9 08:26:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n024.cluster.edu,
% 0.13/0.36 Thu Jun 9 08:26:19 2022
% 0.13/0.36 The command was "./sos". The process ID is 17308.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=11.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.52
% 0.19/0.52 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 -------------- Softie stats --------------
% 0.19/0.52
% 0.19/0.52 UPDATE_STOP: 300
% 0.19/0.52 SFINDER_TIME_LIMIT: 2
% 0.19/0.52 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.52 number of clauses in intial UL: 44
% 0.19/0.52 number of clauses initially in problem: 50
% 0.19/0.52 percentage of clauses intially in UL: 88
% 0.19/0.52 percentage of distinct symbols occuring in initial UL: 93
% 0.19/0.52 percent of all initial clauses that are short: 100
% 0.19/0.52 absolute distinct symbol count: 16
% 0.19/0.52 distinct predicate count: 6
% 0.19/0.52 distinct function count: 3
% 0.19/0.52 distinct constant count: 7
% 0.19/0.52
% 0.19/0.52 ---------- no more Softie stats ----------
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 =========== start of search ===========
% 0.82/1.04
% 0.82/1.04 -------- PROOF --------
% 0.82/1.04 % SZS status Unsatisfiable
% 0.82/1.04 % SZS output start Refutation
% 0.82/1.04
% 0.82/1.04 Stopped by limit on insertions
% 0.82/1.04
% 0.82/1.04 Stopped by limit on insertions
% 0.82/1.04
% 0.82/1.04 Model 2 [ 1 3 474 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.04
% 0.82/1.04 Stopped by limit on insertions
% 0.82/1.04
% 0.82/1.04 Model 3 [ 1 6 776 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.04
% 0.82/1.04 Stopped by limit on insertions
% 0.82/1.04
% 0.82/1.04 Model 4 [ 1 4 823 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.04
% 0.82/1.04 Stopped by limit on insertions
% 0.82/1.04
% 0.82/1.04 Model 5 [ 1 5 415 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.04
% 0.82/1.04 ----> UNIT CONFLICT at 0.60 sec ----> 63 [binary,62.1,11.1] {+} $F.
% 0.82/1.04
% 0.82/1.04 Length of proof is 7. Level of proof is 3.
% 0.82/1.04
% 0.82/1.04 ---------------- PROOF ----------------
% 0.82/1.04 % SZS status Unsatisfiable
% 0.82/1.04 % SZS output start Refutation
% 0.82/1.04
% 0.82/1.04 1 [] {+} -organization(A,B)|reliability(A,sk1(B,A),B).
% 0.82/1.04 2 [] {+} -organization(A,B)|accountability(A,sk2(B,A),B).
% 0.82/1.04 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(F,E)| -greater(H,G)|greater(J,I).
% 0.82/1.04 7 [] {+} -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -reliability(A,F,B)| -reliability(A,G,C)| -accountability(A,H,B)| -accountability(A,I,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(F,G).
% 0.82/1.04 8 [] {+} -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -reliability(A,F,B)| -reliability(A,G,C)| -accountability(A,H,B)| -accountability(A,I,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(H,I).
% 0.82/1.04 9 [] {+} -greater(sk9,sk7).
% 0.82/1.04 10 [] {+} -greater(sk8,sk10).
% 0.82/1.04 11 [] {+} -greater(sk5,sk6).
% 0.82/1.04 45 [] {+} organization(sk4,sk7).
% 0.82/1.04 46 [] {+} organization(sk4,sk8).
% 0.82/1.04 47 [] {+} reorganization(sk4,sk9,sk10).
% 0.82/1.04 48 [] {+} reproducibility(sk4,sk5,sk7).
% 0.82/1.04 49 [] {+} reproducibility(sk4,sk6,sk8).
% 0.82/1.04 50 [] {-} greater(sk8,sk7).
% 0.82/1.04 52 [hyper,45,2] {+} accountability(sk4,sk2(sk7,sk4),sk7).
% 0.82/1.04 53 [hyper,45,1] {+} reliability(sk4,sk1(sk7,sk4),sk7).
% 0.82/1.04 55 [hyper,46,2] {+} accountability(sk4,sk2(sk8,sk4),sk8).
% 0.82/1.04 56 [hyper,46,1] {+} reliability(sk4,sk1(sk8,sk4),sk8).
% 0.82/1.04 57 [hyper,56,8,45,46,47,53,52,55,50,unit_del,9,10] {-} greater(sk2(sk7,sk4),sk2(sk8,sk4)).
% 0.82/1.04 58 [hyper,56,7,45,46,47,53,52,55,50,unit_del,9,10] {-} greater(sk1(sk7,sk4),sk1(sk8,sk4)).
% 0.82/1.04 62 [hyper,58,6,46,45,56,53,55,52,49,48,57] {-} greater(sk5,sk6).
% 0.82/1.04 63 [binary,62.1,11.1] {+} $F.
% 0.82/1.04
% 0.82/1.04 % SZS output end Refutation
% 0.82/1.04 ------------ end of proof -------------
% 0.82/1.04
% 0.82/1.04
% 0.82/1.04 Search stopped by max_proofs option.
% 0.82/1.04
% 0.82/1.04
% 0.82/1.04 Search stopped by max_proofs option.
% 0.82/1.04
% 0.82/1.04 ============ end of search ============
% 0.82/1.04
% 0.82/1.04 ----------- soft-scott stats ----------
% 0.82/1.04
% 0.82/1.04 true clauses given 7 (50.0%)
% 0.82/1.04 false clauses given 7
% 0.82/1.04
% 0.82/1.04 FALSE TRUE
% 0.82/1.04 tot: 0 0 (-nan% true)
% 0.82/1.04
% 0.82/1.04
% 0.82/1.04 Model 5 [ 1 5 415 ] (0.00 seconds, 250000 Inserts)
% 0.82/1.04
% 0.82/1.04 That finishes the proof of the theorem.
% 0.82/1.04
% 0.82/1.04 Process 17308 finished Thu Jun 9 08:26:20 2022
%------------------------------------------------------------------------------