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