TSTP Solution File: MGT041-2 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : MGT041-2 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n023.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 : 300s
% DateTime : Mon Jun 24 11:48:18 EDT 2024
% Result : Unsatisfiable 0.19s 0.46s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 13 unt; 4 nHn; 27 RR)
% Number of literals : 56 ( 0 equ; 32 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 24 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_t10_8,negated_conjecture,
( first_mover(X1)
| efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.47YEIpTtwf/E---3.1_31441.p',prove_t10_8) ).
cnf(a16_7,hypothesis,
~ has_elaborated_routines(sk1,sk2),
file('/export/starexec/sandbox/tmp/tmp.47YEIpTtwf/E---3.1_31441.p',a16_7) ).
cnf(a14_2,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.47YEIpTtwf/E---3.1_31441.p',a14_2) ).
cnf(a15_3,hypothesis,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.47YEIpTtwf/E---3.1_31441.p',a15_3) ).
cnf(a16_4,hypothesis,
organisation_at_time(sk1,sk2),
file('/export/starexec/sandbox/tmp/tmp.47YEIpTtwf/E---3.1_31441.p',a16_4) ).
cnf(a16_5,hypothesis,
founding_time(sk1,sk2),
file('/export/starexec/sandbox/tmp/tmp.47YEIpTtwf/E---3.1_31441.p',a16_5) ).
cnf(mp_not_high_and_low_1,axiom,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
file('/export/starexec/sandbox/tmp/tmp.47YEIpTtwf/E---3.1_31441.p',mp_not_high_and_low_1) ).
cnf(a16_6,hypothesis,
number_of_routines(sk1,sk2,high),
file('/export/starexec/sandbox/tmp/tmp.47YEIpTtwf/E---3.1_31441.p',a16_6) ).
cnf(c_0_8,negated_conjecture,
( first_mover(X1)
| efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
inference(fof_simplification,[status(thm)],[prove_t10_8]) ).
cnf(c_0_9,hypothesis,
~ has_elaborated_routines(sk1,sk2),
inference(fof_simplification,[status(thm)],[a16_7]) ).
cnf(c_0_10,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2) ),
inference(fof_simplification,[status(thm)],[a14_2]) ).
cnf(c_0_11,hypothesis,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
inference(fof_simplification,[status(thm)],[a15_3]) ).
cnf(c_0_12,negated_conjecture,
( first_mover(X1)
| efficient_producer(X1)
| ~ organisation_at_time(X1,X2) ),
c_0_8 ).
cnf(c_0_13,hypothesis,
organisation_at_time(sk1,sk2),
a16_4 ).
cnf(c_0_14,hypothesis,
~ has_elaborated_routines(sk1,sk2),
c_0_9 ).
cnf(c_0_15,hypothesis,
( has_elaborated_routines(X1,X2)
| ~ organisation_at_time(X1,X2)
| ~ efficient_producer(X1)
| ~ founding_time(X1,X2) ),
c_0_10 ).
cnf(c_0_16,hypothesis,
founding_time(sk1,sk2),
a16_5 ).
cnf(c_0_17,hypothesis,
( number_of_routines(X1,X2,low)
| ~ organisation_at_time(X1,X2)
| ~ first_mover(X1)
| ~ founding_time(X1,X2) ),
c_0_11 ).
cnf(c_0_18,hypothesis,
( first_mover(sk1)
| efficient_producer(sk1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,hypothesis,
~ efficient_producer(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_13])]) ).
cnf(c_0_20,plain,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
inference(fof_simplification,[status(thm)],[mp_not_high_and_low_1]) ).
cnf(c_0_21,hypothesis,
( number_of_routines(sk1,sk2,low)
| ~ first_mover(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_16]),c_0_13])]) ).
cnf(c_0_22,hypothesis,
first_mover(sk1),
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ number_of_routines(X1,X2,low)
| ~ number_of_routines(X1,X2,high) ),
c_0_20 ).
cnf(c_0_24,hypothesis,
number_of_routines(sk1,sk2,low),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_25,hypothesis,
number_of_routines(sk1,sk2,high),
a16_6 ).
cnf(c_0_26,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : MGT041-2 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.11 % Command : run_E %s %d SAT
% 0.11/0.32 % Computer : n023.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Wed Jun 19 17:50:24 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.19/0.45 Running first-order model finding
% 0.19/0.45 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.47YEIpTtwf/E---3.1_31441.p
% 0.19/0.46 # Version: 3.2.0
% 0.19/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.46 # Starting sh5l with 300s (1) cores
% 0.19/0.46 # new_bool_1 with pid 31520 completed with status 0
% 0.19/0.46 # Result found by new_bool_1
% 0.19/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.46 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.19/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.46 # SAT001_MinMin_p005000_rr_RG with pid 31526 completed with status 0
% 0.19/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.46 # Search class: FGHNF-FFSS00-SFFFFFNN
% 0.19/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.46 # Preprocessing time : 0.001 s
% 0.19/0.46 # Presaturation interreduction done
% 0.19/0.46
% 0.19/0.46 # Proof found!
% 0.19/0.46 # SZS status Unsatisfiable
% 0.19/0.46 # SZS output start CNFRefutation
% See solution above
% 0.19/0.46 # Parsed axioms : 8
% 0.19/0.46 # Removed by relevancy pruning/SinE : 0
% 0.19/0.46 # Initial clauses : 8
% 0.19/0.46 # Removed in clause preprocessing : 0
% 0.19/0.46 # Initial clauses in saturation : 8
% 0.19/0.46 # Processed clauses : 21
% 0.19/0.46 # ...of these trivial : 0
% 0.19/0.46 # ...subsumed : 0
% 0.19/0.46 # ...remaining for further processing : 21
% 0.19/0.46 # Other redundant clauses eliminated : 0
% 0.19/0.46 # Clauses deleted for lack of memory : 0
% 0.19/0.46 # Backward-subsumed : 0
% 0.19/0.46 # Backward-rewritten : 1
% 0.19/0.46 # Generated clauses : 6
% 0.19/0.46 # ...of the previous two non-redundant : 6
% 0.19/0.46 # ...aggressively subsumed : 0
% 0.19/0.46 # Contextual simplify-reflections : 0
% 0.19/0.46 # Paramodulations : 5
% 0.19/0.46 # Factorizations : 0
% 0.19/0.46 # NegExts : 0
% 0.19/0.46 # Equation resolutions : 0
% 0.19/0.46 # Disequality decompositions : 0
% 0.19/0.46 # Total rewrite steps : 5
% 0.19/0.46 # ...of those cached : 1
% 0.19/0.46 # Propositional unsat checks : 0
% 0.19/0.46 # Propositional check models : 0
% 0.19/0.46 # Propositional check unsatisfiable : 0
% 0.19/0.46 # Propositional clauses : 0
% 0.19/0.46 # Propositional clauses after purity: 0
% 0.19/0.46 # Propositional unsat core size : 0
% 0.19/0.46 # Propositional preprocessing time : 0.000
% 0.19/0.46 # Propositional encoding time : 0.000
% 0.19/0.46 # Propositional solver time : 0.000
% 0.19/0.46 # Success case prop preproc time : 0.000
% 0.19/0.46 # Success case prop encoding time : 0.000
% 0.19/0.46 # Success case prop solver time : 0.000
% 0.19/0.46 # Current number of processed clauses : 11
% 0.19/0.46 # Positive orientable unit clauses : 5
% 0.19/0.46 # Positive unorientable unit clauses: 0
% 0.19/0.46 # Negative unit clauses : 2
% 0.19/0.46 # Non-unit-clauses : 4
% 0.19/0.46 # Current number of unprocessed clauses: 1
% 0.19/0.46 # ...number of literals in the above : 2
% 0.19/0.46 # Current number of archived formulas : 0
% 0.19/0.46 # Current number of archived clauses : 10
% 0.19/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.19/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.19/0.46 # Non-unit clause-clause subsumptions : 0
% 0.19/0.46 # Unit Clause-clause subsumption calls : 6
% 0.19/0.46 # Rewrite failures with RHS unbound : 0
% 0.19/0.46 # BW rewrite match attempts : 2
% 0.19/0.46 # BW rewrite match successes : 1
% 0.19/0.46 # Condensation attempts : 0
% 0.19/0.46 # Condensation successes : 0
% 0.19/0.46 # Termbank termtop insertions : 283
% 0.19/0.46 # Search garbage collected termcells : 19
% 0.19/0.46
% 0.19/0.46 # -------------------------------------------------
% 0.19/0.46 # User time : 0.003 s
% 0.19/0.46 # System time : 0.000 s
% 0.19/0.46 # Total time : 0.003 s
% 0.19/0.46 # Maximum resident set size: 1620 pages
% 0.19/0.46
% 0.19/0.46 # -------------------------------------------------
% 0.19/0.46 # User time : 0.005 s
% 0.19/0.46 # System time : 0.001 s
% 0.19/0.46 # Total time : 0.006 s
% 0.19/0.46 # Maximum resident set size: 1696 pages
% 0.19/0.46 % E---3.1 exiting
% 0.19/0.46 % E exiting
%------------------------------------------------------------------------------