TSTP Solution File: MGT041+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.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:59 EDT 2022
% Result : Theorem 0.38s 0.63s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : MGT041+2 : TPTP v8.1.0. Released v2.0.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:12:32 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 sandbox2 on n026.cluster.edu,
% 0.13/0.36 Thu Jun 9 08:12:32 2022
% 0.13/0.36 The command was "./sos". The process ID is 32292.
% 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 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 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.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 5
% 0.20/0.40 number of clauses initially in problem: 8
% 0.20/0.40 percentage of clauses intially in UL: 62
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 10
% 0.20/0.40 distinct predicate count: 6
% 0.20/0.40 distinct function count: 0
% 0.20/0.40 distinct constant count: 4
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.38/0.63
% 0.38/0.63 -------- PROOF --------
% 0.38/0.63 % SZS status Theorem
% 0.38/0.63 % SZS output start Refutation
% 0.38/0.63
% 0.38/0.63 Model 3 (0.00 seconds, 0 Inserts)
% 0.38/0.63
% 0.38/0.63 Stopped by limit on number of solutions
% 0.38/0.63
% 0.38/0.63 Stopped by limit on insertions
% 0.38/0.63
% 0.38/0.63 Model 4 [ 1 0 121 ] (0.00 seconds, 250000 Inserts)
% 0.38/0.63
% 0.38/0.63 Stopped by limit on insertions
% 0.38/0.63
% 0.38/0.63 Model 5 [ 2 0 193 ] (0.00 seconds, 250000 Inserts)
% 0.38/0.63
% 0.38/0.63 -----> EMPTY CLAUSE at 0.24 sec ----> 12 [hyper,11,1,8] {-} $F.
% 0.38/0.63
% 0.38/0.63 Length of proof is 3. Level of proof is 3.
% 0.38/0.63
% 0.38/0.63 ---------------- PROOF ----------------
% 0.38/0.63 % SZS status Theorem
% 0.38/0.63 % SZS output start Refutation
% 0.38/0.63
% 0.38/0.63 1 [] {+} -number_of_routines(A,B,low)| -number_of_routines(A,B,high).
% 0.38/0.63 2 [] {+} -organisation_at_time(A,B)| -efficient_producer(A)| -founding_time(A,B)|has_elaborated_routines(A,B).
% 0.38/0.63 3 [] {+} -organisation_at_time(A,B)| -first_mover(A)| -founding_time(A,B)|number_of_routines(A,B,low).
% 0.38/0.63 4 [] {+} -has_elaborated_routines($c2,$c1).
% 0.38/0.63 5 [] {+} -organisation_at_time(A,B)|first_mover(A)|efficient_producer(A).
% 0.38/0.63 6 [] {+} organisation_at_time($c2,$c1).
% 0.38/0.63 7 [] {+} founding_time($c2,$c1).
% 0.38/0.63 8 [] {+} number_of_routines($c2,$c1,high).
% 0.38/0.63 9 [hyper,6,5] {+} first_mover($c2)|efficient_producer($c2).
% 0.38/0.63 10 [hyper,9,3,6,7] {-} efficient_producer($c2)|number_of_routines($c2,$c1,low).
% 0.38/0.63 11 [hyper,10,2,6,7,unit_del,4] {+} number_of_routines($c2,$c1,low).
% 0.38/0.63 12 [hyper,11,1,8] {-} $F.
% 0.46/0.63
% 0.46/0.63 % SZS output end Refutation
% 0.46/0.63 ------------ end of proof -------------
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 Search stopped by max_proofs option.
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 Search stopped by max_proofs option.
% 0.46/0.63
% 0.46/0.63 ============ end of search ============
% 0.46/0.63
% 0.46/0.63 ----------- soft-scott stats ----------
% 0.46/0.63
% 0.46/0.63 true clauses given 1 (16.7%)
% 0.46/0.63 false clauses given 5
% 0.46/0.63
% 0.46/0.63 FALSE TRUE
% 0.46/0.63 tot: 0 0 (-nan% true)
% 0.46/0.63
% 0.46/0.63
% 0.46/0.63 Model 5 [ 2 0 193 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.63
% 0.46/0.63 That finishes the proof of the theorem.
% 0.46/0.63
% 0.46/0.63 Process 32292 finished Thu Jun 9 08:12:33 2022
%------------------------------------------------------------------------------