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.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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 0.65s 0.83s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : MGT007+1 : TPTP v8.1.0. Released v2.0.0.
% 0.02/0.10 % Command : sos-script %s
% 0.09/0.29 % Computer : n032.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Thu Jun 9 07:33:52 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.09/0.31 ----- Otter 3.2, August 2001 -----
% 0.09/0.31 The process was started by sandbox2 on n032.cluster.edu,
% 0.09/0.31 Thu Jun 9 07:33:52 2022
% 0.09/0.31 The command was "./sos". The process ID is 8672.
% 0.09/0.31
% 0.09/0.31 set(prolog_style_variables).
% 0.09/0.31 set(auto).
% 0.09/0.31 dependent: set(auto1).
% 0.09/0.31 dependent: set(process_input).
% 0.09/0.31 dependent: clear(print_kept).
% 0.09/0.31 dependent: clear(print_new_demod).
% 0.09/0.31 dependent: clear(print_back_demod).
% 0.09/0.31 dependent: clear(print_back_sub).
% 0.09/0.31 dependent: set(control_memory).
% 0.09/0.31 dependent: assign(max_mem, 12000).
% 0.09/0.31 dependent: assign(pick_given_ratio, 4).
% 0.09/0.31 dependent: assign(stats_level, 1).
% 0.09/0.31 dependent: assign(pick_semantic_ratio, 3).
% 0.09/0.31 dependent: assign(sos_limit, 5000).
% 0.09/0.31 dependent: assign(max_weight, 60).
% 0.09/0.31 clear(print_given).
% 0.09/0.31
% 0.09/0.31 formula_list(usable).
% 0.09/0.31
% 0.09/0.31 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=11.
% 0.09/0.31
% 0.09/0.31 This is a non-Horn set without equality. The strategy
% 0.09/0.31 will be ordered hyper_res, ur_res, unit deletion, and
% 0.09/0.31 factoring, with satellites in sos and nuclei in usable.
% 0.09/0.31
% 0.09/0.31 dependent: set(hyper_res).
% 0.09/0.31 dependent: set(factor).
% 0.09/0.31 dependent: set(unit_deletion).
% 0.09/0.31
% 0.09/0.31 ------------> process usable:
% 0.09/0.31
% 0.09/0.31 ------------> process sos:
% 0.09/0.31
% 0.09/0.31 ======= end of input processing =======
% 0.14/0.42
% 0.14/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.42
% 0.14/0.42 Stopped by limit on number of solutions
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42 -------------- Softie stats --------------
% 0.14/0.42
% 0.14/0.42 UPDATE_STOP: 300
% 0.14/0.42 SFINDER_TIME_LIMIT: 2
% 0.14/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.42 number of clauses in intial UL: 44
% 0.14/0.42 number of clauses initially in problem: 50
% 0.14/0.42 percentage of clauses intially in UL: 88
% 0.14/0.42 percentage of distinct symbols occuring in initial UL: 93
% 0.14/0.42 percent of all initial clauses that are short: 100
% 0.14/0.42 absolute distinct symbol count: 16
% 0.14/0.42 distinct predicate count: 6
% 0.14/0.42 distinct function count: 3
% 0.14/0.42 distinct constant count: 7
% 0.14/0.42
% 0.14/0.42 ---------- no more Softie stats ----------
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42 =========== start of search ===========
% 0.65/0.83
% 0.65/0.83 -------- PROOF --------
% 0.65/0.83 % SZS status Theorem
% 0.65/0.83 % SZS output start Refutation
% 0.65/0.83
% 0.65/0.83 Stopped by limit on insertions
% 0.65/0.83
% 0.65/0.83 Stopped by limit on insertions
% 0.65/0.83
% 0.65/0.83 Model 2 [ 1 3 424 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.83
% 0.65/0.83 Stopped by limit on insertions
% 0.65/0.83
% 0.65/0.83 Model 3 [ 1 2 461 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.83
% 0.65/0.83 Stopped by limit on insertions
% 0.65/0.83
% 0.65/0.83 Model 4 [ 1 5 459 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.83
% 0.65/0.83 ----> UNIT CONFLICT at 0.46 sec ----> 63 [binary,62.1,11.1] {-} $F.
% 0.65/0.83
% 0.65/0.83 Length of proof is 7. Level of proof is 3.
% 0.65/0.83
% 0.65/0.83 ---------------- PROOF ----------------
% 0.65/0.83 % SZS status Theorem
% 0.65/0.83 % SZS output start Refutation
% 0.65/0.83
% 0.65/0.83 1 [] {+} -organization(A,B)|reliability(A,$f1(A,B),B).
% 0.65/0.83 2 [] {+} -organization(A,B)|accountability(A,$f2(A,B),B).
% 0.65/0.83 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(F,E)| -greater(H,G).
% 0.65/0.83 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.65/0.83 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.65/0.83 9 [] {+} -greater($c2,$c4).
% 0.65/0.83 10 [] {+} -greater($c3,$c1).
% 0.65/0.83 11 [] {+} -greater($c6,$c5).
% 0.65/0.83 45 [] {+} organization($c7,$c4).
% 0.65/0.83 46 [] {+} organization($c7,$c3).
% 0.65/0.83 47 [] {+} reorganization($c7,$c2,$c1).
% 0.65/0.83 48 [] {+} reproducibility($c7,$c6,$c4).
% 0.65/0.83 49 [] {+} reproducibility($c7,$c5,$c3).
% 0.65/0.83 50 [] {-} greater($c3,$c4).
% 0.65/0.83 52 [hyper,45,2] {+} accountability($c7,$f2($c7,$c4),$c4).
% 0.65/0.83 53 [hyper,45,1] {+} reliability($c7,$f1($c7,$c4),$c4).
% 0.65/0.83 55 [hyper,46,2] {+} accountability($c7,$f2($c7,$c3),$c3).
% 0.65/0.83 56 [hyper,46,1] {+} reliability($c7,$f1($c7,$c3),$c3).
% 0.65/0.83 57 [hyper,56,8,45,46,47,53,52,55,50,unit_del,9,10] {-} greater($f2($c7,$c4),$f2($c7,$c3)).
% 0.65/0.83 58 [hyper,56,7,45,46,47,53,52,55,50,unit_del,9,10] {-} greater($f1($c7,$c4),$f1($c7,$c3)).
% 0.65/0.83 62 [hyper,58,6,46,45,56,53,55,52,49,48,57] {-} greater($c6,$c5).
% 0.65/0.83 63 [binary,62.1,11.1] {-} $F.
% 0.65/0.83
% 0.65/0.83 % SZS output end Refutation
% 0.65/0.83 ------------ end of proof -------------
% 0.65/0.83
% 0.65/0.83
% 0.65/0.83 Search stopped by max_proofs option.
% 0.65/0.83
% 0.65/0.83
% 0.65/0.83 Search stopped by max_proofs option.
% 0.65/0.83
% 0.65/0.83 ============ end of search ============
% 0.65/0.83
% 0.65/0.83 ----------- soft-scott stats ----------
% 0.65/0.83
% 0.65/0.83 true clauses given 8 (57.1%)
% 0.65/0.83 false clauses given 6
% 0.65/0.83
% 0.65/0.83 FALSE TRUE
% 0.65/0.83 tot: 0 0 (-nan% true)
% 0.65/0.83
% 0.65/0.83
% 0.65/0.83 Model 4 [ 1 5 459 ] (0.00 seconds, 250000 Inserts)
% 0.65/0.83
% 0.65/0.83 That finishes the proof of the theorem.
% 0.65/0.83
% 0.65/0.83 Process 8672 finished Thu Jun 9 07:33:53 2022
%------------------------------------------------------------------------------